Pages that link to "Item:Q3335753"
From MaRDI portal
The following pages link to A filter lambda model and the completeness of type assignment (Q3335753):
Displayed 50 items.
- 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)
- Nominal essential intersection types (Q1643145) (← links)
- How to think of intersection types as Cartesian products (Q1744395) (← links)
- Strong normalization through intersection types and memory (Q1744407) (← links)
- Typing and computational properties of lambda expressions (Q1819575) (← links)
- On the semantics of polymorphism (Q1835664) (← links)
- The completeness theorem for typing lambda-terms (Q1839242) (← links)
- Normalization without reducibility (Q1840460) (← links)
- Normalization, approximation, and semantics for combinator systems (Q1853619) (← links)
- Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
- Dependent types with subtyping and late-bound overloading (Q1854436) (← links)
- Intersection and singleton type assignment characterizing finite Böhm-trees (Q1854555) (← links)
- Infinite intersection types (Q1887155) (← links)
- Strong normalization and typability with intersection types (Q1924327) (← links)
- Term-space semantics of typed lambda calculus (Q1981989) (← 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)
- Precise subtyping for synchronous multiparty sessions (Q2423747) (← links)
- Logical equivalence for subtyping object and recursive types (Q2481559) (← links)
- On the unity of duality (Q2482843) (← links)
- Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) (← links)
- Combinatory logic and the semantics of substructural logics (Q2642518) (← links)
- Logical Semantics for Stability (Q2805169) (← links)
- Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms (Q2811355) (← links)
- Reasoning About Call-by-need by Means of Types (Q2811356) (← links)
- A Fully Abstract Model for Mobile Ambients (Q2841277) (← links)
- Simple Easy Terms (Q2842831) (← links)
- Strongly Normalising Cut-Elimination with Strict Intersection Types (Q2842832) (← links)
- Subtyping in Logical Form (Q2842836) (← links)
- The Relevance of Semantic Subtyping (Q2842838) (← links)
- Reducibility (Q2842839) (← links)
- The Better Bubbling Lemma (Q2864214) (← links)
- Implicit self-adjusting computation for purely functional programs (Q2875225) (← links)
- Elaborating intersection and union types (Q2875228) (← links)
- Easy lambda-terms are not always simple (Q2889181) (← links)
- Typing Weak MSOL Properties (Q2949449) (← links)
- Finite Combinatory Logic with Intersection Types (Q3007665) (← links)
- A Filter Model for the λμ-Calculus (Q3007668) (← links)
- Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming (Q3007669) (← links)
- Principal Types for Nominal Theories (Q3088280) (← links)
- Intersection Types for the Resource Control Lambda Calculi (Q3105748) (← links)
- A Realizability Interpretation for Intersection and Union Types (Q3179292) (← links)
- Graph lambda theories (Q3535680) (← links)
- On Isomorphisms of Intersection Types (Q3540197) (← links)
- Some reasons for generalising domain theory (Q3559971) (← links)