scientific article; zbMATH DE number 3648679
From MaRDI portal
Publication:3206926
Cited in
(21)- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\)
- Finite type structures within combinatory algebras
- Infinite \(\lambda\)-calculus and types
- Some new results on easy lambda-terms
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- On the Jacopini technique
- Intersection types and domain operators
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Consistency argument and classification problem in -calculus
- Easiness in graph models
- Simple easy terms
- Graph easy sets of mute lambda terms
- Easy lambda-terms are not always simple
- Collapsing partial combinatory algebras
- Unfixing the fixpoint: the theories of the Y-calculus
- Computability in higher types, P and the completeness of type assignment
- A -denotational semantics for map theory in ZFC+SI
- On the construction of stable models of untyped -calculus
- Forcing in stable models of untyped -calculus
- Weak completeness of type assignment in -calculus models: A generalization of Hindley's result
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206926)
