Pages that link to "Item:Q1314361"
From MaRDI portal
The following pages link to Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361):
Displayed 25 items.
- Comparing models of the intensional typed \(\lambda\)-calculus (Q671646) (← links)
- Uniqueness of Scott's reflexive domain in \(P\omega \) (Q672137) (← links)
- A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\) (Q1127535) (← links)
- Enlargements of functional algebras for the lambda calculus (Q1129261) (← links)
- Intersection types and domain operators (Q1434348) (← links)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
- Residuated structures and orthomodular lattices (Q2062191) (← links)
- Intuitionistic fixed point logic (Q2220485) (← links)
- Stochastic \(\lambda\)-calculi: an extended abstract (Q2250553) (← 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)
- (Q4580329) (← links)
- Towards Lambda Calculus Order-Incompleteness (Q4916175) (← links)
- Intersection Types and Computational Rules (Q4924527) (← links)
- On the ubiquity of certain total type structures (Q5430138) (← links)
- Recursive Domain Equations of Filter Models (Q5448641) (← links)
- Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models (Q5958296) (← links)