Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Type-Based Termination for Dependent Types Andreas Abel
 

Summary: Type-Based Termination for Dependent Types
Andreas Abel
INRIA, Team r2
PPS Lab, Paris
ProVal Seminar
INRIA Saclay, Parc Orsay Universit´e, Paris, France
19 March 2010
Andreas Abel (INRIA) Type-Based Termination ProVal '10 1 / 17
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 (INRIA) Type-Based Termination ProVal '10 2 / 17
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