Nominal Coalgebraic Data Types with Applications to Lambda Calculus
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.
| Published in: | Logical Methods in Computer Science |
|---|---|
| Main Authors: | , , , |
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2013-12-01
|
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/865/pdf |