A Filter Model for the λμ-Calculus

DOI10.1007/978-3-642-21691-6_18zbMath1331.03021OpenAlexW1601420996MaRDI QIDQ3007668

Ugo de'Liguoro, Franco Barbanera, Steffen van Bakel

Publication date: 17 June 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-21691-6_18

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

Unnamed Item, Unnamed Item, The approximation theorem for the Λμ-calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
• An extension of basic functionality theory for \(\lambda\)-calculus
• Domain theory in logical form
• Intersection and union types: Syntax and semantics
• Intersection types and lambda models
• Completeness of continuation models for \(\lambda_\mu\)-calculus
• λμ-calculus and Böhm's theorem
• The duality of computation
• A filter lambda model and the completeness of type assignment
• On the Relations between the Syntactic Theories of λμ-Calculi
• Classical logic, continuation semantics and abstract machines
• What is a model of the lambda calculus?
• Continuous Lattices and Domains
• A complete characterization of complete intersection-type preorders
• Recursive Domain Equations of Filter Models