Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Strong Normalization for Equi-(Co-)Inductive Types Andreas Abel
 

Summary: Strong Normalization for Equi-(Co-)Inductive Types
Andreas Abel
Department of Computer Science
Ludwig-Maximilians-University Munich
Typed Lambda Calculi and Applications, TLCA'07
27 June 2007
Paris, France
Andreas Abel (LMU Munich) Normalization for Equi-Inductive Types TLCA'07 1 / 21
Introduction
Type-based termination: Each well-typed program terminates.
Applications:
Type-theoretic theorem provers
Dependently-typed programming!?
Mixed inductive/coinductive types and mixed recursive/corecursive
programs.
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.

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences