Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
MiniAgda: Checking Termination using Sized Types Andreas Abel
 

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.

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences