The following pages link to Subtyping dependent types (Q5958760):
Displaying 15 items.
- Higher-order subtyping and its decidability (Q598199) (← links)
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters (Q884953) (← links)
- Dependent type system with subtyping I: Type level transitivity elimination (Q1273074) (← links)
- Order-sorted inductive types (Q1286367) (← links)
- Typed operational semantics for higher-order subtyping. (Q1401950) (← links)
- Dependent types with subtyping and late-bound overloading (Q1854436) (← links)
- Polymorphic Contracts (Q3000571) (← links)
- Roles, stacks, histories: A triple for Hoare (Q3021420) (← links)
- A Delta for Hybrid Type Checking (Q3188298) (← links)
- Automath Type Inclusion in Barendregt’s Cube (Q3194722) (← links)
- Structural subtyping for inductive types with functorial equality rules (Q3535679) (← links)
- Coherence of subsumption for monadic types (Q3616445) (← links)
- Implicit coercions in type systems (Q4647565) (← links)
- Realist Consequence, Epistemic Inference, Computational Correctness (Q5350353) (← links)
- Subtyping dependent types (Q5958760) (← links)
