Termination checking with types
Artikel i vetenskaplig tidskrift, 2004

The paradigm of type-based termination is explored for functional programming with recursive data types. The article introduces Lambda(mu)(+), a lambda-calculus with recursion, inductive types, subtyping and bounded quanti. cation. 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 established formally.

course-of-value recursion

strong normalization

sized types

type-based termination

bidirectional type checking

inductive types


Andreas Abel

Chalmers, Institutionen för datavetenskap

RAIRO - Theoretical Informatics and Applications

0988-3754 (ISSN) 1290-385X (eISSN)

Vol. 38 4 277-319


Data- och informationsvetenskap



Mer information

Senast uppdaterat