| | |
Summary: MiniAgda: Checking Termination using Sized Types
Andreas Abel
Department of Computer Science
University of Munich
Workshop on Partiality and Recursion
in Interactive Theorem Proving
FLoC 2010, Edinburgh, UK
15 July 2010
Andreas Abel (LMU) MiniAgda PAR '10 1 / 19
Introduction
Type-based termination
View data (natural numbers, lists, binary trees) as trees.
Type of data is equipped with a size.
Size = upper bound on height of tree.
Size must decrease in each recursive call.
Termination is ensured by type-checker.
Andreas Abel (LMU) MiniAgda PAR '10 2 / 19
Introduction
Sized types in a nutshell
Sizes are upper bounds.
|
