Summary: Strong Normalization for Equi-(Co-)Inductive Types
Department of Computer Science
TYPES Workshop, 2 May 2007
Andreas Abel (LMU Munich) Normalization for Equi-Inductive Types TYPES'07 1 / 16
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
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.