86 search results - page 7 / 18 » Constructive Data Refinement in Typed Lambda Calculus |
127
click to vote
TLDI
2005
ACM
15 years 9 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
126
Voted
POPL
2010
ACM
16 years 28 days 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...
135
Voted
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
142
Voted
ICFP
1997
ACM
15 years 7 months ago
1997
ACM
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...
144
click to vote
FOSSACS
2005
Springer
15 years 9 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...