1932 search results - page 179 / 387 » A Functional Quantum Programming Language |
171
click to vote
POPL
1993
ACM
15 years 10 months ago
1993
ACM
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
180
click to vote
JFP
2000
15 years 6 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
137
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...
161
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
200
click to vote
ICFP
1999
ACM
15 years 10 months ago
1999
ACM
A good foreign-language interface is crucial for the success of any modern programming language implementation. Although all serious compilers for functional languages have some f...