Summary: Strong Normalization for Equi-(Co-)Inductive Types
Department of Computer Science
Typed Lambda Calculi and Applications, TLCA'07
27 June 2007
Andreas Abel (LMU Munich) Normalization for Equi-Inductive Types TLCA'07 1 / 21
Type-based termination: Each well-typed program terminates.
Type-theoretic theorem provers
Mixed inductive/coinductive types and mixed recursive/corecursive
Andreas Abel (LMU Munich) Normalization for Equi-Inductive Types TLCA'07 2 / 21
Example: Stream Processors
Modelling I/O in purely functional languages.
SP a b contains codes for stream processors,
i.e., functions from streams over a to streams over b.