169 search results - page 23 / 34 » A type system for well-founded recursion |
TAPSOFT
1993
Springer
13 years 11 months ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
ECOOP
1998
Springer
13 years 12 months ago
1998
Springer
Many problems require recursively speci ed types ofdata and a collection of tools that operate on those data. Over time, these problems evolve so that the programmer must extend t...
TLDI
2005
ACM
14 years 1 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...
FPCA
1989
13 years 11 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
ICFP
2005
ACM
14 years 7 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...