Unfixing the Fixpoint: The Theories of the λY-Calculus

DOI10.1007/978-3-642-38164-5_11zbMath1264.68045OpenAlexW99014182MaRDI QIDQ4922079

Marina Lenisa, Furio Honsell

Publication date: 28 May 2013

Published in: Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38164-5_11

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• On the completeness of order-theoretic models of the \(\lambda \)-calculus
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Full abstraction in the lazy lambda calculus
• Full abstraction for PCF
• Categories of Coalgebraic Games with Selective Sum
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unfixing the Fixpoint: The Theories of the λY-Calculus