| | |
Summary: Slide 1
Termination and Guardedness Checking
with Continuous Types
Ordinal Indices for (Co)Inductive Types
Andreas Abel
Gemeinsamer Workshop der Graduiertenkollegs 301 und 334
Dresden University of Technology
February 12, 2001
1. Introduction
2. Recursion plus Examples
3. Corecursion plus Examples
4. Continuous Types
5. Strong Normalization
6. Further and Related Work
Work supported by: PhD Programme Logic in Computer Science, Munich (DFG)
Slide 2
Strong Normalization for General Recursion
1. Interactive theorem proving: Coq, Isabelle, Nuprl, PVS, Twelf
Primitive recursion: typing easy, but uncomfortable to use.
Programs-as-proofs: Induction proofs via recursive functions.
|
