Monad Translating Inductive and Coinductive Types
- First Online:
- Cite this paper as:
- Uustalu T. (2003) Monad Translating Inductive and Coinductive Types. In: Geuvers H., Wiedijk F. (eds) Types for Proofs and Programs. TYPES 2002. Lecture Notes in Computer Science, vol 2646. Springer, Berlin, Heidelberg
We show that the call-by-name monad translation of simply typed lambda calculus extended with sum and product types extends to special and general inductive and coinductive types so that its crucial property of preserving typings and β- and commuting reductions is maintained. Specific similar-purpose translations such as CPS translations follow from the general monad translations by specialization for appropriate concrete monads.
Unable to display preview. Download preview PDF.