| Issue |
RAIRO-Theor. Inf. Appl.
Volume 38, Number 4, October-December 2004
Fixed Points in Computer Science (FICS'03)
|
|
|---|---|---|
| Page(s) | 277 - 319 | |
| DOI | https://doi.org/10.1051/ita:2004015 | |
| Published online | 15 October 2004 | |
Termination checking with types
Department of Computer Science, Chalmers University of Technology, Rännvägen 6, 41296 Göteborg, Sweden; abel@cs.chalmers.se.
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 established formally.
Mathematics Subject Classification: 68N15 / 68N18 / 68Q42
Key words: Type-based termination / sized types / inductive types / course-of-value recursion / bidirectional type checking / strong normalization
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.