| | |
Summary: Slide 1
Termination and Guardedness Checking with
Continuous Types
Towards a Higher-Order Polymorphic Lambda-Calculus
With Sized Types
Andreas Abel
Graduiertenkolleg Logik in der Informatik
Munich, Germany
May 30, 2003
| Work in progress |
Work supported by: GKLI (DFG), TYPES and APPSEM-II
Slide 2
Setting the stage. . .
Curry-Howard-Isomorphism:
proofs by induction = programs with recursion
Only terminating programs constitute valid proofs.
Design issue: How to integrate terminating recursion into
proof/programming language?
1
|
