Pages that link to "Item:Q1198661"
From MaRDI portal
The following pages link to An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus (Q1198661):
Displaying 30 items.
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness (Q730088) (← links)
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca (Q930863) (← links)
- Towards the range property for the lambda theory \(\mathcal H\) (Q930864) (← links)
- An irregular filter model (Q930872) (← links)
- On the completeness of order-theoretic models of the \(\lambda \)-calculus (Q1021569) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- Semantical analysis of perpetual strategies in \(\lambda\)-calculus (Q1275628) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- Intersection types and domain operators (Q1434348) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Order-incompleteness and finite lambda reduction models (Q1884896) (← links)
- Easiness in graph models (Q2368937) (← links)
- Intersection types and lambda models (Q2369008) (← links)
- Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) (← links)
- Logical semantics for stability (Q2805169) (← links)
- Simple easy terms (Q2842831) (← links)
- Easy lambda-terms are not always simple (Q2889181) (← links)
- Graph lambda theories (Q3535680) (← links)
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 (Q3616431) (← links)
- Effective λ-models versus recursively enumerable λ-theories (Q3643360) (← links)
- On Proving Limiting Completeness (Q3769943) (← links)
- The interpretation of unsolvable <i>λ</i>-terms in models of untyped <i>λ</i>-calculus (Q4254697) (← links)
- (Q4580329) (← links)
- Towards Lambda Calculus Order-Incompleteness (Q4916175) (← links)
- Unfixing the Fixpoint: The Theories of the λY-Calculus (Q4922079) (← links)
- Intersection Types and Computational Rules (Q4924527) (← links)
- Call-by-value Solvability (Q4953339) (← links)
- Essential and relational models (Q5269000) (← links)
- Recursive Domain Equations of Filter Models (Q5448641) (← links)
- On the construction of stable models of untyped \(\lambda\)-calculus (Q5958611) (← links)
