Semantic subtyping, dealing set-theoretically with function, union, intersection, and negation types
From MaRDI portal
Publication:3452185
Recommendations
Cited in
(28)- A typed lambda calculus with intersection types
- The better bubbling lemma
- Theoretical Computer Science
- The recursive union of some gradual types
- Categorical approximation fixpoint theory
- On projecting processes into session types
- On specifications, subset types and interpretation of proposition in type theory
- Polarized subtyping
- Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
- scientific article; zbMATH DE number 7561489 (Why is no real title available?)
- Judgmental subtyping systems with intersection types and modal types
- The relevance of semantic subtyping
- Applicative intersection types
- Automata, Languages and Programming
- Automated Deduction – CADE-19
- Sound and complete flow typing with unions, intersections and negations
- Semantic subtyping with an SMT solver
- Precise subtyping for synchronous multiparty sessions
- Semantic subtyping with an SMT solver
- Computer Science Logic
- A calculus with recursive types, record concatenation and subtyping
- scientific article; zbMATH DE number 7453961 (Why is no real title available?)
- scientific article; zbMATH DE number 7168151 (Why is no real title available?)
- scientific article; zbMATH DE number 1479640 (Why is no real title available?)
- Precise Subtyping for Asynchronous Multiparty Sessions
- Type Inference for Rank 2 Gradual Intersection Types
- scientific article; zbMATH DE number 7559294 (Why is no real title available?)
- Backward type inference for XML queries
This page was built for publication: Semantic subtyping, dealing set-theoretically with function, union, intersection, and negation types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452185)