Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.2168/LMCS-9(4:20)2013 | LOGICAL METHODS IN COMPUTER SCIENCE |
Keywords | Field | DocType |
coinduction,corecursion,nominal sets,infinitary lambda calculus | Discrete mathematics,Lambda calculus,Typed lambda calculus,Simply typed lambda calculus,Binary lambda calculus,Lambda cube,System F,Church encoding,Pure type system,Mathematics | Journal |
Volume | Issue | ISSN |
9 | 4 | 1860-5974 |
Citations | PageRank | References |
9 | 0.62 | 20 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Kurz | 1 | 12 | 1.34 |
| Daniela Petrisan | 2 | 56 | 8.54 |
| Paula Severi | 3 | 122 | 16.19 |
| Fer-Jan de Vries | 4 | 244 | 21.67 |
| Daniela Luan Petrişan | 5 | 9 | 0.62 |