Final semantics for untyped -calculus

DOI10.1007/BFB0014057MaRDI QIDQ3024839zbMATH OpenFDO

Authors Furio Honsell, Marina Lenisa

Publication date 4 July 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0014057

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Recommendations

• Final semantics for a higher order concurrent language
• Semantic techniques for deriving coinductive characterizations of observational equivalences for -calculi
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
• An Alpha-Corecursion Principle for the Infinitary Lambda Calculus
• scientific article; zbMATH DE number 3909726

Cited in

(13)

• Semantical analysis of perpetual strategies in -calculus
• Universal coalgebra: A theory of systems
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Parametric parameter passing \(\lambda\)-calculus
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• Untyped -calculus with relative typing
• Game semantics for untyped -calculus
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• Towards lambda calculus order-incompleteness
• A partial evaluator for the untyped lambda-calculus
• scientific article; zbMATH DE number 7340562 (Why is no real title available?)
• Final semantics for a higher order concurrent language
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness

This page was built for publication: Final semantics for untyped \(\lambda\)-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024839)