Nominal Coalgebraic Data Types with Applications to Lambda Calculus

Authors

Alexander Kurz, Chapman UniversityFollow
Daniela Petrişan, University of Leicester
Paula Severi, University of Leicester
Fer-Jan de Vries, University of Leicester

Document Type

Article

Publication Date

2013

Abstract

We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.

Comments

This article was originally published in Logical Methods in Computer Science, volume 9, issue 4, in 2013. DOI: 10.2168/LMCS-9(4:20)2013

Recommended Citation

A. Kurz, D. Petrisan, P. Severi, and F.-J. de Vries, “Nominal Coalgebraic Data Types with Applications to Lambda Calculus,” Logical Methods in Computer Science, vol. 9, no. 4, Dec. 2013. DOI: 10.2168/LMCS-9(4:20)2013

Copyright

The authors

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.