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.
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
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Algebra Commons, Logic and Foundations Commons, Other Computer Engineering Commons, Other Computer Sciences Commons, Other Mathematics Commons
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