The following pages link to Lawrence Charles Paulson (Q352969):
Displaying 17 items.
- A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle (Q286772) (← links)
- The higher-order prover \textsc{Leo}-II (Q287283) (← links)
- Proving termination of normalization functions for conditional expressions (Q1101251) (← links)
- Set theory for verification. I: From foundations to functions (Q1319386) (← links)
- Organizing numerical theories using axiomatic type classes (Q1774558) (← links)
- The foundation of a generic theorem prover (Q1823013) (← links)
- Machine learning for first-order theorem proving (Q2351414) (← links)
- Translating higher-order clauses to first-order clauses (Q2471742) (← links)
- Mechanizing compositional reasoning for concurrent systems: some lessons (Q2576572) (← links)
- Automated theorem proving for special functions (Q2819703) (← links)
- An Isabelle/HOL Formalisation of Green’s Theorem (Q2829238) (← links)
- A Formal Proof of Cauchy’s Residue Theorem (Q2829261) (← links)
- Real Algebraic Strategies for MetiTarski Proofs (Q2907335) (← links)
- The Relative Consistency of the Axiom of Choice — Mechanized Using Isabelle/ZF (Q3507465) (← links)
- Natural deduction as higher-order resolution (Q4720797) (← links)
- MetiTarski: An Automatic Prover for the Elementary Functions (Q5505501) (← links)
- Mechanizing UNITY in Isabelle (Q5738896) (← links)
