Recursive Domain Equations of Filter Models
From MaRDI portal
Publication:5448641
Recommendations
Cites work
- scientific article; zbMATH DE number 3831284 (Why is no real title available?)
- scientific article; zbMATH DE number 3889502 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 2044491 (Why is no real title available?)
- A complete characterization of complete intersection-type preorders
- A filter lambda model and the completeness of type assignment
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- An extension of basic functionality theory for \(\lambda\)-calculus
- Behavioural inverse limit \(\lambda\)-models
- Compositional characterisations of \(\lambda\)-terms using intersection types
- Continuous Lattices and Domains
- Full abstraction in the lazy lambda calculus
- Lambda‐Calculus Models and Extensionality
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- The Category-Theoretic Solution of Recursive Domain Equations
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The parametric lambda calculus. A metamodel for computation.
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
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)