John Harrison focuses on HOL, Programming language, Automated theorem proving, Algebra and Mathematical proof. His HOL research incorporates elements of Discrete mathematics, Vector space and Euclidean space. John Harrison interconnects Simple, Proof assistant, Theoretical computer science and Automation in the investigation of issues within Programming language.
The various areas that John Harrison examines in his Automated theorem proving study include Multiplication and Symbolic computation. When carried out as part of a general Algebra research project, his work on Hol light and Quadratic form is frequently linked to work in Ellipsoid method, Univariate and Explained sum of squares, therefore connecting diverse disciplines of study. His research in Mathematical proof intersects with topics in Software, Correctness, Combinatorics and Round-off error.
His main research concerns Automated theorem proving, HOL, Algorithm, Formal verification and Calculus. His Automated theorem proving research includes themes of Proof assistant, Hol light and Proof theory. His HOL research focuses on Symbolic computation and how it relates to Real number.
His Formal verification research also works with subjects such as
John Harrison spends much of his time researching Cognition, Disease, Calculus, Discrete mathematics and Functional composite. His study looks at the intersection of Cognition and topics like Cognitive psychology with Dementia. His Disease study incorporates themes from Physical therapy, Clinical trial and Clinical psychology.
His studies in Calculus integrate themes in fields like Proof assistant, Mathematical proof, Formal proof and Formal verification. His biological study spans a wide range of topics, including Space and Automated theorem proving. His Automated theorem proving study is concerned with the larger field of Theoretical computer science.
His primary scientific interests are in Calculus, Discrete mathematics, Kepler conjecture, Formal proof and Hol light. His Calculus research incorporates themes from Algorithm, Automated theorem proving, Formal verification, Proof assistant and Fundamental theorem. His work carried out in the field of Discrete mathematics brings together such families of science as Isometry and Locally convex topological vector space.
John Harrison performs multidisciplinary studies into Kepler conjecture and Algebra in his work. The study incorporates disciplines such as Development, HOL and Euclidean space in addition to Algebra.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
HOL Light: A Tutorial Introduction
formal methods in computer aided design (1996)
Handbook of Practical Logic and Automated Reasoning
PBT2 Rapidly Improves Cognition in Alzheimer's Disease: Additional Phase II Analyses
Noel G. Faux;Craig W. Ritchie;Adam Gunn;Alan Rembach;Alan Rembach.
Journal of Alzheimer's Disease (2010)
Theorem Proving with the Real Numbers
Synaesthesia: Prevalence and Familiality:
Simon Baron-Cohen;Lucy Burt;Fiona Smith-Laittan;John Harrison.
Experience with Embedding Hardware Description Languages in HOL
Richard J. Boulton;Andrew Gordon;Michael J. C. Gordon;John Harrison.
Proceedings of the IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience (1992)
HOL Light: An Overview
theorem proving in higher order logics (2009)
The Library of Isaac Newton
John R. Harrison.
A formal proof of the Kepler conjecture
Thomas C. Hales;Mark Adams;Gertrud Bauer;Dat Tat Dang.
Forum of Mathematics, Pi (2017)
A Machine-Checked Theory of Floating Point Arithmetic
theorem proving in higher order logics (1999)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: