Pages that link to "Item:Q1924327"
From MaRDI portal
The following pages link to Strong normalization and typability with intersection types (Q1924327):
Displaying 19 items.
- Cut-elimination in the strict intersection type assignment system is strongly normalizing (Q558418) (← links)
- On strong normalization and type inference in the intersection type discipline (Q930868) (← links)
- The heart of intersection type assignment: Normalisation proofs revisited (Q930869) (← links)
- Strong normalization for typed terms with surjective pairing (Q1092042) (← links)
- An elementary proof of strong normalization for intersection types (Q1407502) (← links)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- The completeness of BCD for an operational semantics (Q1709713) (← links)
- How to think of intersection types as Cartesian products (Q1744395) (← links)
- Strong normalization through intersection types and memory (Q1744407) (← links)
- Normalization without reducibility (Q1840460) (← links)
- Intersection types for explicit substitutions (Q1887145) (← links)
- Term-space semantics of typed lambda calculus (Q1981989) (← links)
- Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) (← links)
- Strongly normalising cut-elimination with strict intersection types (Q2842832) (← links)
- Reducibility: a ubiquitous method in lambda calculus with intersection types (Q2842839) (← links)
- A New Type Assignment for Strongly Normalizable Terms (Q2958549) (← links)
- Intersection Types for the Resource Control Lambda Calculi (Q3105748) (← links)
- (Q4457448) (← links)
- Full intersection types and topologies in lambda calculus (Q5943119) (← links)
