• Publications
  • Influence
Perspex Machine VIII: axioms of transreal arithmetic
Transreal arithmetic is a total arithmetic that contains real arithmetic, but which has no arithmetical exceptions. It allows the specification of the Universal Perspex Machine which unifies geometryExpand
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS
TLDR
We describe an interface between version 6 of the Maple computer algebra system with the PVS automated theorem prover. Expand
VSDITLU: a verifiable symbolic definite integral table look-up
TLDR
We present a verifiable symbolic definite integral table look-up: a system which matches a query, comprising a definite integral with parameters and side conditions, against an entry in verifiable table and uses a call to a library of facts about the reals in the theorem prover PVS to aid in the transformation of the table entry into an answer. Expand
Health risks of salmon sushi
Theorem Proving in Higher Order Logics
TLDR
A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL . Expand
Automated theorem proving in support of computer algebra: symbolic definite integration as a case study
TLDR
A verifiable symbolic definite integral table look up: a system which matches a query comprising a definite integral with parameters and side conditions, against an entry in a verifiable table and uses a call to a library of lemmas about the reals in the theorem prover PVS to aid in the transformation of the table entry into an answer. Expand
Rippling in PVS
Rippling is a method of controlling rewriting of the terms in an induction step of an inductive proof, to ensure that a position is reached whereby the induction hypothesis can be applied. RipplingExpand
Vsditlu: a Veriied Symbolic Deenite Integral Table Look-up
We present a veriied symbolic deenite integral table look-up: a system which matches a query, comprising a deenite integral with parameters and side conditions, against an entry in a veriied tableExpand
A formalisation of weak normalisation (with respect to permutations) of sequent calculus proofs
Dyckhoff and Pinto present a weakly normalising system of reductions on derivations in the cut-free intuitionistic sequent calculus, where the normal derivations are characterised as the fixed pointsExpand
...
1
2
...