Pages that link to "Item:Q1893736"
From MaRDI portal
The following pages link to Intersection and union types: Syntax and semantics (Q1893736):
Displaying 37 items.
- The vectorial \(\lambda\)-calculus (Q529049) (← links)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) (Q636376) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- A descriptive type foundation for RDF Schema (Q739626) (← links)
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca (Q930863) (← links)
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage (Q930871) (← links)
- Combining type disciplines (Q1319505) (← links)
- The ``relevance'' of intersection and union types (Q1381437) (← links)
- Typed generic traversal with term rewriting strategies (Q1394988) (← links)
- A binary modal logic for the intersection types of lambda-calculus. (Q1427854) (← links)
- The semantics of entailment omega (Q1430899) (← links)
- Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
- Infinite intersection types (Q1887155) (← links)
- Union and intersection types to support both dynamic and static typing (Q1944090) (← links)
- Minimal type inference for linked data consumers (Q2348796) (← links)
- A note on subject reduction in \((\to, \exists)\)-Curry with respect to complete developments (Q2350605) (← links)
- On the unity of duality (Q2482843) (← links)
- Combinatory logic and the semantics of substructural logics (Q2642518) (← links)
- The Relevance of Semantic Subtyping (Q2842838) (← links)
- Elaborating intersection and union types (Q2875228) (← links)
- Idealized coinductive type systems for imperative object-oriented programs (Q3006157) (← links)
- A Filter Model for the λμ-Calculus (Q3007668) (← links)
- Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification? (Q3067532) (← links)
- A Realizability Interpretation for Intersection and Union Types (Q3179292) (← links)
- A Type Theory for Probabilistic $$\lambda $$–calculus (Q3297838) (← links)
- On the Values of Reducibility Candidates (Q3637200) (← links)
- Type Inference by Coinductive Logic Programming (Q3638242) (← links)
- Cut Elimination in a Class of Sequent Calculi for Pure Type Systems (Q4924532) (← links)
- Taming the Merge Operator (Q5020905) (← links)
- Soundness Conditions for Big-Step Semantics (Q5041092) (← links)
- (Q5090978) (← links)
- Singleton, union and intersection types for program extraction (Q5096245) (← links)
- (Q5216307) (← links)
- Isomorphism of intersection and union types (Q5268999) (← links)
- Deriving session and union types for objects (Q5410236) (← links)
- Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models (Q5958296) (← links)
- Completeness of type assignment systems with intersection, union, and type quantifiers (Q5958301) (← links)