The following pages link to Coercive subtyping (Q4238487):
Displaying 23 items.
- Adjectival and adverbial modification: the view from modern type theories (Q683682) (← links)
- A constructive algebraic hierarchy in Coq. (Q1404425) (← links)
- Transitivity in coercive subtyping (Q1776403) (← links)
- Coercive subtyping: theory and implementation (Q1951591) (← links)
- Natural language inference in Coq (Q2258817) (← links)
- User interaction with the Matita proof assistant (Q2462635) (← links)
- Interfaces as functors, programs as coalgebras -- a final coalgebra theorem in intensional type theory (Q2503336) (← links)
- Coercive subtyping via mappings of reduction behaviour (Q2871871) (← links)
- Definitional Extension in Type Theory (Q2968420) (← links)
- Hints in Unification (Q3183522) (← links)
- Working with Mathematical Structures in Type Theory (Q3499757) (← links)
- Coercions in a polymorphic type system (Q3520150) (← links)
- Structural subtyping for inductive types with functorial equality rules (Q3535679) (← links)
- Manifest Fields and Module Mechanisms in Intensional Type Theory (Q3638256) (← links)
- (Q4499226) (← links)
- Taming the Merge Operator (Q5020905) (← links)
- A User Interface for a Mathematical System that Allows Ambiguous Formulae (Q5166498) (← links)
- The Matita Interactive Theorem Prover (Q5200015) (← links)
- Types for Proofs and Programs (Q5712310) (← links)
- 2-Dimensional Directed Type Theory (Q5739362) (← links)
- Coercion completion and conservativity in coercive subtyping (Q5957918) (← links)
- Subtyping dependent types (Q5958760) (← links)
- Propositional forms of judgemental interpretations (Q6053842) (← links)
