Summary: Slide 1
Termination and Guardedness Checking with
Towards a Higher-Order Polymorphic Lambda-Calculus
With Sized Types
Graduiertenkolleg Logik in der Informatik
May 30, 2003
-- Work in progress --
Work supported by: GKLI (DFG), TYPES and APPSEM-II
Setting the stage. . .
proofs by induction = programs with recursion
∑ Only terminating programs constitute valid proofs.
∑ Design issue: How to integrate terminating recursion into