Encoding fix in object calculi
Roy L. Crole (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Roy L. Crole (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Dilian Gurov, Bruce Kapron (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
F. Kröger (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Andreas Abel (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The paradigm of type-based termination is explored for functional programming with recursive data types. The article introduces , a lambda-calculus with recursion, inductive types, subtyping and bounded quantification. Decorated type variables representing approximations of inductive types are used to track the size of function arguments and return values. The system is shown to be type safe and strongly normalizing. The main novelty is a bidirectional type checking algorithm whose...
Paul Feautrier (1975)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
G. Lévi, A. M. Pegna (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Egidio Astesiano, Gerardo Costa (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: