Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Termination Checking = Type Checking Structural Recursion beyond Subterm Ordering
 

Summary: Slide 1
Termination Checking = Type Checking
Structural Recursion beyond Subterm Ordering
Andreas Abel
International Summer School Marktoberdorf
August 3, 2001
1. Introduction
2. Informal Description
3. Properties
4. Applications and Further Work
Work supported by: O∆ce for Technology in Education (Carnegie Mellon,
Pittsburgh), PhD Programme Logic in Computer Science (GKLI, Munich)
Slide 2
Termination Checking
 Special case: Structural recursion (examples follow!)
 Applications:
{ Functional and logic programming
{ Theorem proving: proof as recursive function (LEGO, Coq,
Twelf, . . . )
 Methods:

  

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

 

Collections: Computer Technologies and Information Sciences