| | |
Summary: MiniAgda: Checking Termination using Sized Types
Andreas Abel
Department of Computer Science
Ludwig-Maximilians-University Munich
Logic and Computation Seminar
School of Computer Science
McGill University, Montreal, Canada
14 March 2011
Andreas Abel (LMU) MiniAgda McGill '11 1 / 21
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 McGill '11 2 / 21
Introduction
Sized types in a nutshell
Sizes are upper bounds.
|
