Pages that link to "Item:Q1350344"
From MaRDI portal
The following pages link to Intersection type assignment systems (Q1350344):
Displaying 22 items.
- Semantic types and approximation for Featherweight Java (Q387991) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Cut-elimination in the strict intersection type assignment system is strongly normalizing (Q558418) (← links)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) (Q636376) (← links)
- Linearity and iterator types for Gödel's system \(\mathcal T\) (Q656851) (← 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)
- A typed lambda calculus with intersection types (Q930870) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- Nominal essential intersection types (Q1643145) (← links)
- Normalization, approximation, and semantics for combinator systems (Q1853619) (← links)
- Intersection types for explicit substitutions (Q1887145) (← links)
- Logical equivalence for subtyping object and recursive types (Q2481559) (← links)
- Strongly Normalising Cut-Elimination with Strict Intersection Types (Q2842832) (← links)
- Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming (Q3007669) (← links)
- On sets of terms having a given intersection type (Q5043597) (← links)
- (Q5076061) (← links)
- (Q5089036) (← links)
- Type Inference for Rank 2 Gradual Intersection Types (Q5098736) (← links)
- Functional Type Assignment for Featherweight Java (Q5410450) (← links)
- Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) (Q6076174) (← links)
- From semantics to types: the case of the imperative \(\lambda\)-calculus (Q6093581) (← links)