Recursive Domain Equations of Filter Models

DOI10.1007/978-3-540-77566-9_11zbMath1133.03006OpenAlexW1552838787MaRDI QIDQ5448641

Fabio Alessi, Paula G.Severi

Publication date: 7 March 2008

Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_11

Mathematics Subject Classification ID

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

Related Items (2)

From semantics to types: the case of the imperative \(\lambda\)-calculus ⋮ A Filter Model for the λμ-Calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The parametric lambda calculus. A metamodel for computation.
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• An extension of basic functionality theory for \(\lambda\)-calculus
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Full abstraction in the lazy lambda calculus
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Behavioural inverse limit \(\lambda\)-models
• Compositional characterisations of \(\lambda\)-terms using intersection types
• A filter lambda model and the completeness of type assignment
• Lambda‐Calculus Models and Extensionality
• The Category-Theoretic Solution of Recursive Domain Equations
• Continuous Lattices and Domains
• A complete characterization of complete intersection-type preorders

This page was built for publication: Recursive Domain Equations of Filter Models