| | |
Summary: Slide 1
Termination of Mutually Recursive Functions
Andreas Abel
POP Seminar, CMU Computer Science
May 26, 2000
1. Introduction
2. The foetus Project
3. Mutually Recursive Functions with One Argument
4. Mutually Recursive Functions with Several Arguments
Slide 2
Recursion over Inductive Types
Functional programming languages and logical frameworks base upon
-calculus enriched with inductive types.
Examples: ML, LEGO
De nition of functions/constants by recursion over inductive type possible.
Standard means: recursor/elimination. Ensures totality.
Example:
half' = R N (x B : 0) (x N f B!N : R B (f true) (1 + (f false)))
half = n N : half' n false
Drawback: Misses intuition, readability, usability.
|
