Pages that link to "Item:Q5958299"
From MaRDI portal
The following pages link to Proof by computation in the Coq system (Q5958299):
Displaying 20 items.
- Proving tight bounds on univariate expressions with elementary functions in Coq (Q331615) (← links)
- Proofs of randomized algorithms in Coq (Q923886) (← links)
- Incorporating quotation and evaluation into Church's type theory (Q1753993) (← links)
- Proof reflection in Coq (Q1868509) (← links)
- Dealing with algebraic expressions over a field in Coq using Maple (Q2456560) (← links)
- (Q2754039) (← links)
- (Q2754056) (← links)
- Generation and presentation of formal mathematical documents (Q2760868) (← links)
- A logical framework with explicit conversions (Q2871837) (← links)
- Completeness and Decidability Results for CTL in Coq (Q2879254) (← links)
- The power of parameterization in coinductive proof (Q2931796) (← links)
- (Q3086937) (← links)
- Tactics for Reasoning Modulo AC in Coq (Q3100211) (← links)
- Proofs of Randomized Algorithms in Coq (Q3618814) (← links)
- (Q4246942) (← links)
- (Q4357063) (← links)
- A mechanized proof system of the third generation calculus in Coq (Q5064241) (← links)
- (Q5094119) (← links)
- Proof by computation in the Coq system (Q5958299) (← links)
- On the proof theory of Coquand's calculus of constructions (Q5961667) (← links)