115 search results - page 2 / 23 » Type Inference for Recursive Definitions |
DAGSTUHL
2001
13 years 6 months ago
2001
We give two finite axiomatizations of indexed inductive-recursive definitions in intuitionistic type theory. They extend our previous finite axiomatizations of inductive-recursive...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
ICFP
2005
ACM
14 years 5 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...
ESOP
2009
Springer
13 years 9 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...