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