Summary: MiniAgda: Checking Termination using Sized Types
Andreas Abel
Department of Computer Science
University of Munich
TCS Oberseminar
University of Munich
7 May 2010
Andreas Abel (LMU) MiniAgda TCS '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 TCS '10 2 / 19
Introduction
Sized types in a nutshell
Sizes are upper bounds.
Lista

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München

Collections: Computer Technologies and Information Sciences