Pages that link to "Item:Q3598006"
From MaRDI portal
The following pages link to The Four Colour Theorem: Engineering of a Formal Proof (Q3598006):
Displaying 27 items.
- Applications of real number theorem proving in PVS (Q469367) (← links)
- Tests and proofs for custom data generators (Q1624592) (← links)
- Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
- Incorporating quotation and evaluation into Church's type theory (Q1753993) (← links)
- A fully automatic theorem prover with human-style output (Q2362206) (← links)
- Proof checking and logic programming (Q2628296) (← links)
- Tests and Proofs for Enumerative Combinatorics (Q2827441) (← links)
- Proof-Producing Reflection for HOL (Q2945631) (← links)
- A Brief Overview of Agda – A Functional Language with Dependent Types (Q3183520) (← links)
- Formalizing Physics: Automation, Presentation and Foundation Issues (Q3453125) (← links)
- Working with Mathematical Structures in Type Theory (Q3499757) (← links)
- Pure Pointer Programs with Iteration (Q3540172) (← links)
- A Compiled Implementation of Normalization by Evaluation (Q3543648) (← links)
- Computational logic: its origins and applications (Q4559535) (← links)
- (Q5015189) (← links)
- Pollack-inconsistency (Q5170237) (← links)
- Proof Auditing Formalised Mathematics (Q5195266) (← links)
- Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC (Q5195279) (← links)
- Towards Formal Proof Script Refactoring (Q5200123) (← links)
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem (Q5204803) (← links)
- How Hard Is Positive Quantification? (Q5278190) (← links)
- Constructive Mathematics and Functional Programming (Abstract) (Q5458392) (← links)
- Proof Checking and Logic Programming (Q5743582) (← links)
- A proof system for graph (non)-isomorphism verification (Q5883756) (← links)
- Formalising Mathematics in Simple Type Theory (Q6075439) (← links)
- What is the point of computers? A question for pure mathematicians (Q6118162) (← links)
- Large-scale formal proof for the working mathematician -- lessons learnt from the ALEXANDRIA project (Q6118809) (← links)
