The following pages link to (Q3221961):
Displaying 50 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← 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 type assignment system for game semantics (Q930873) (← links)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Fully abstract submodels of typed lambda calculi (Q1095880) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Filter models with polymorphic types (Q1186431) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus (Q1198661) (← 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)
- Proof-functional connectives and realizability (Q1330311) (← links)
- Intersection type assignment systems (Q1350344) (← links)
- Intersection types and domain operators (Q1434348) (← links)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- Generalized filter models (Q1575259) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Building continuous webbed models for system F (Q1826624) (← links)
- On phase semantics and denotational semantics in multiplicative-additive linear logic (Q1971797) (← links)
- The untyped computational \(\lambda \)-calculus and its intersection type discipline (Q2210507) (← links)
- Easiness in graph models (Q2368937) (← links)
- Intersection types and lambda models (Q2369008) (← links)
- Intersection-types à la Church (Q2381503) (← links)
- Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) (← links)
- Logical Semantics for Stability (Q2805169) (← links)
- Simple Easy Terms (Q2842831) (← links)
- The Relevance of Semantic Subtyping (Q2842838) (← links)
- Easy lambda-terms are not always simple (Q2889181) (← links)
- Finitary Semantics of Linear Logic and Higher-Order Model-Checking (Q2946341) (← links)
- (Q4580329) (← links)
- Towards Lambda Calculus Order-Incompleteness (Q4916175) (← links)
- Intersection Types and Computational Rules (Q4924527) (← links)
- (Q5090978) (← links)
- A semantics for type checking (Q5096209) (← links)
- Intersection and union types (Q5096243) (← links)
- Essential and relational models (Q5269000) (← links)
- Recursive Domain Equations of Filter Models (Q5448641) (← links)
- Full abstraction for lambda calculus with resources and convergence testing (Q5878917) (← links)
- A \(\kappa\)-denotational semantics for map theory in ZFC+SI (Q5906925) (← links)
- Intersection types for \(\lambda\)-trees (Q5958291) (← links)
- Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models (Q5958296) (← links)
