| | |
Summary: Slide 1
A Higher-Order Polymorphic Lambda-Calculus
With Sized Types
This is where the subtitle would have gone.
Andreas Abel
First APPSEM II Workshop
Nottingham, UK
March 28, 2003
-- Work in progress --
Work supported by: PhD Prg. Logic in Computer Science, Munich (DFG)
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
Slide 3
One approach: special forms of recursion
|
