Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
 

Summary: Theoretical Informatics and Applications Will be set by the publisher
Informatique Th´eorique et Applications
TERMINATION CHECKING WITH TYPES
Andreas Abel1
Abstract. The paradigm of type-based termination is explored for
functional programming with recursive data types. The article intro-
duces +
µ , a lambda-calculus with recursion, inductive types, subtyping
and bounded quantification. Decorated type variables representing ap-
proximations of inductive types are used to track the size of function
arguments and return values. The system is shown to be type safe and
strongly normalizing. The main novelty is a bidirectional type checking
algorithm whose soundness is established formally.
1991 Mathematics Subject Classification. 68N15, 68N18, 68Q42.
Introduction
In interactive theorem provers like Alfa [26], Coq [29], or LEGO [33,43], which
are based on the Curry-Howard isomorphism, inductive proofs can be supplied
as recursive functions. However, only functions which terminate on all inputs
constitute valid proofs. In functional programming, functions are commonly de-
fined via general recursion and pattern matching. This imposes some challenge

  

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

 

Collections: Computer Technologies and Information Sciences