| | |
Summary: Strong Normalization for Equi-(Co-)Inductive Types
Andreas Abel
Department of Computer Science
Ludwig-Maximilians-University Munich
TYPES Workshop, 2 May 2007
Cividale, Italy
Andreas Abel (LMU Munich) Normalization for Equi-Inductive Types TYPES'07 1 / 16
Introduction
Theme: Liberate recursive definitions in Type Theory.
More convenient use of proof assistants.
Functional programming approach.
Interesting interplay between recursion/corecursion.
Andreas Abel (LMU Munich) Normalization for Equi-Inductive Types TYPES'07 2 / 16
Inductive Types
Least fixed-points µF of monotone type constructors F.
E.g. List A = µF with F X = 1 + A × X.
Iso-inductive types: Explicit folding and unfolding.
F (µF)
in
µF
|
