Pages that link to "Item:Q1102936"
From MaRDI portal
The following pages link to Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936):
Displaying 33 items.
- Relational graph models, Taylor expansion and extensionality (Q283769) (← links)
- Strong normalization from an unusual point of view (Q534700) (← links)
- Cut-elimination in the strict intersection type assignment system is strongly normalizing (Q558418) (← links)
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca (Q930863) (← links)
- An irregular filter model (Q930872) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Recursion over realizability structures (Q1173956) (← links)
- Filter models with polymorphic types (Q1186431) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
- Intersection types for combinatory logic (Q1199823) (← links)
- Types with intersection: An introduction (Q1201298) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- Semantical analysis of perpetual strategies in \(\lambda\)-calculus (Q1275628) (← links)
- Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- Intersection type assignment systems (Q1350344) (← links)
- Intersection types and domain operators (Q1434348) (← links)
- Generalized filter models (Q1575259) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Discrimination by parallel observers: the algorithm. (Q1854269) (← 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)
- 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)
- (Q4625694) (← links)
- From Böhm's Theorem to Observational Equivalences (Q4916172) (← links)
- Intersection Types and Computational Rules (Q4924527) (← links)
- (Q5111316) (← links)
- The infinitary lambda calculus of the infinite eta Böhm trees (Q5269002) (← links)
- Recursive Domain Equations of Filter Models (Q5448641) (← links)
