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
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.

  

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

 

Collections: Computer Technologies and Information Sciences