Graph easy sets of mute lambda terms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3648679 (Why is no real title available?)
- scientific article; zbMATH DE number 3916224 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 23772 (Why is no real title available?)
- scientific article; zbMATH DE number 3556025 (Why is no real title available?)
- scientific article; zbMATH DE number 482822 (Why is no real title available?)
- scientific article; zbMATH DE number 2044491 (Why is no real title available?)
- scientific article; zbMATH DE number 937379 (Why is no real title available?)
- A filter lambda model and the completeness of type assignment
- Consistency of a \(\lambda\)-theory with \(n\)-tuples and easy term
- Decomposing the lattice of meaningless sets in the infinitary lambda calculus
- Easiness in graph models
- Easy lambda-terms are not always simple
- Forcing in stable models of untyped -calculus
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Graph lambda theories
- Graph models of $\lambda$-calculus at work, and variations
- Isomorphism and equational equivalence of continuous \(\lambda\)-models
- Mathematical Foundations of Computer Science 2003
- Minimal \(\lambda\)-theories by ultraproducts
- Not Enough Points Is Enough
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Simple easy terms
- Some new results on easy lambda-terms
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The þ-function in λ-K-conversion
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- Weakening the axiom of overlap in infinitary lambda calculus
Cited in
(2)
This page was built for publication: Graph easy sets of mute lambda terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288793)
