Logical Methods in Computer Science · 2013 · 21 citations · 32 references
Natural SciencesComputer ScienceMathematicsAlgebraSet TheoryCategory TheoryModel TheoryRecursion TheoryType SystemsDatatypes TheoryLambda CalculusLambda Calculus SemanticsTyped 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.
32
Nominal logic, a first order theory of names and binding
Andrew M. Pitts · Information and Computation · 2003 · 418 citations
Humanities, Computer Science, Logic +12
Abstract syntax and variable binding
Marcelo Fiore, Gordon Plotkin, Daniele Turi · 2003 · 359 citations · Full text
A new approach to abstract syntax involving binders
Murdoch J. Gabbay, Andrew M. Pitts · 2003 · 279 citations
Computing, Computer Science, Algebra +15