Summary: Slide 1
Termination and Guardedness Checking with
Towards a HigherOrder Polymorphic LambdaCalculus
With Sized Types
June 10, 2003
--- Work in progress ---
Work supported by: GKLI (DFG), TYPES and APPSEMII
Setting the stage. . .
proofs by induction = programs with recursion
. Only terminating programs constitute valid proofs.
. Design issue: How to integrate terminating recursion into