Subtyping with singleton types
From MaRDI portal
Recommendations
Cited in
(14)- Singleton, union, and intersection types for program extraction
- System ST toward a type system for extraction and proofs of programs
- Dependent types with subtyping and late-bound overloading
- Intersection and singleton type assignment characterizing finite Böhm-trees
- Strong normalization with singleton types
- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
- Manifest Fields and Module Mechanisms in Intensional Type Theory
- Singleton, union and intersection types for program extraction
- Extensional equivalence and singleton types
- Dynamic translucency with abstraction kinds and higher-order coercions
- Subtyping dependent types
- Controlling unfolding in type theory
- Q\# as a quantum algorithmic language
- Towards the type safety of pure subtype systems
This page was built for publication: Subtyping with singleton types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474826)