The following pages link to (Q3075239):
Displayed 14 items.
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- Formalization of the arithmetization of Euclidean plane geometry and applications (Q1640646) (← links)
- A formal C memory model for separation logic (Q1694027) (← links)
- Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
- Automating change of representation for proofs in discrete mathematics (extended version) (Q2364883) (← links)
- Cardinalities of Finite Relations in Coq (Q2829280) (← links)
- Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL (Q2938044) (← links)
- Foundational Property-Based Testing (Q2945645) (← links)
- Iris from the ground up: A modular foundation for higher-order concurrent separation logic (Q4625160) (← links)
- Extensional equality preservation and verified generic programming (Q5019020) (← links)
- (Q5028480) (← links)
- Quotients of Bounded Natural Functors (Q5048992) (← links)
- Computer Certified Efficient Exact Reals in Coq (Q5200110) (← links)
- (Q5856420) (← links)