The following pages link to Subset Coercions in Coq (Q3612448):
Displayed 13 items.
- Implementing and reasoning about hash-consed data structures in Coq (Q2351422) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols (Q2424886) (← links)
- A Coq Library for Internal Verification of Running-Times (Q2798271) (← links)
- A Hoare Logic for the State Monad (Q3183544) (← links)
- First-Class Type Classes (Q3543665) (← links)
- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance (Q3637183) (← links)
- A New Elimination Rule for the Calculus of Inductive Constructions (Q3638245) (← links)
- A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq (Q3638257) (← links)
- Simulating Finite Eilenberg Machines with a Reactive Engine (Q5166624) (← links)
- The Matita Interactive Theorem Prover (Q5200015) (← links)
- Indexed containers (Q5371943) (← links)
- Mtac: A monad for typed tactic programming in Coq (Q5371944) (← links)
- The Implicit Calculus of Constructions as a Programming Language with Dependent Types (Q5458373) (← links)