Summary: Slide 1
A Higher-Order Polymorphic Lambda-Calculus
With Sized Types
This is where the subtitle would have gone.
First APPSEM II Workshop
March 28, 2003
-- Work in progress --
Work supported by: PhD Prg. Logic in Computer Science, Munich (DFG)
Setting the stage. . .
proofs by induction = programs with recursion
∑ Only terminating programs constitute valid proofs.
∑ Design issue: How to integrate terminating recursion into
One approach: special forms of recursion