posted on 2015-07-09, 12:03authored byAlexander A. Kurz, Daniela Petrisan, Paula Severi, Fer-Jan de Vries
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.
History
Citation
Logical Methods in Computer Science, 2013, 9 (4), 20
Author affiliation
/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science