Sciweavers

5415 search results - page 431 / 1083
» The Implementation of Functional Programming Languages
Sort
View
POPL
1993
ACM
15 years 11 months ago
Formal Parametric Polymorphism
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...
Martín Abadi, Luca Cardelli, Pierre-Louis C...
JFP
2000
91views more  JFP 2000»
15 years 6 months ago
Uniform confluence in concurrent computation
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...
Joachim Niehren
ICFP
2006
ACM
16 years 6 months ago
OCaml + XDuce
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...
Alain Frisch
POPL
2010
ACM
16 years 4 months ago
Nominal System T
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...
Andrew M. Pitts
SIGCSE
2010
ACM
182views Education» more  SIGCSE 2010»
16 years 1 months ago
Frances: a tool for understanding code generation
Compiler and programming language implementation courses are integral parts of many computer science curricula. However, the range of topics necessary to teach in such a course ar...
Tyler Sondag, Kian L. Pokorny, Hridesh Rajan