Recursive Domain Equations of Filter Models
From MaRDI portal
Publication:5448641
DOI10.1007/978-3-540-77566-9_11zbMATH Open1133.03006OpenAlexW1552838787MaRDI QIDQ5448641FDOQ5448641
Authors: Fabio Alessi, Paula 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
Recommendations
Cites Work
- The Category-Theoretic Solution of Recursive Domain Equations
- Title not available (Why is that?)
- Continuous Lattices and Domains
- The lambda calculus. Its syntax and semantics. Rev. ed.
- An extension of basic functionality theory for \(\lambda\)-calculus
- The parametric lambda calculus. A metamodel for computation.
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- A filter lambda model and the completeness of type assignment
- Title not available (Why is that?)
- Full abstraction in the lazy lambda calculus
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Lambda‐Calculus Models and Extensionality
- Title not available (Why is that?)
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Title not available (Why is that?)
- Behavioural inverse limit \(\lambda\)-models
- Compositional characterisations of \(\lambda\)-terms using intersection types
- A complete characterization of complete intersection-type preorders
Cited In (4)
This page was built for publication: Recursive Domain Equations of Filter Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448641)