An irregular filter model
From MaRDI portal
Publication:930872
DOI10.1016/J.TCS.2008.01.047zbMath1146.68046OpenAlexW2065881193MaRDI QIDQ930872
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.047
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cut-elimination in the strict intersection type assignment system is strongly normalizing
- 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
- Algebras and combinators
- Domain theory in logical form
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Full abstraction in the lazy lambda calculus
- Semantical analysis of perpetual strategies in \(\lambda\)-calculus
- Intersection types and domain operators
- Behavioural inverse limit \(\lambda\)-models
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Compositional characterisations of \(\lambda\)-terms using intersection types
- A domain equation for bisimulation
- A filter lambda model and the completeness of type assignment
- Lambda‐Calculus Models and Extensionality
- The Category-Theoretic Solution of Recursive Domain Equations
- Data Types as Lattices
- Continuous Lattices and Domains
- A complete characterization of complete intersection-type preorders
This page was built for publication: An irregular filter model
