Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Termination checking with types

Andreas Abel — 2004

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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 soundness is...

Termination checking with types

Andreas Abel — 2010

RAIRO - Theoretical Informatics and Applications

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 ...

Page 1

Download Results (CSV)