What is he best known for?
The fields of study he is best known for:
- Programming language
- Algebra
- Complex number
Lawrence C. Paulson mostly deals with Programming language, Mathematical proof, Proof assistant, Theoretical computer science and HOL.
Mathematical proof and Protocol are two areas of study in which he engages in interdisciplinary research.
His biological study spans a wide range of topics, including Discrete mathematics, Natural deduction, Logic for Computable Functions, Automated reasoning and Axiom.
His work carried out in the field of Discrete mathematics brings together such families of science as Resolution and Set theory.
The HOL study which covers Cryptographic protocol that intersects with Public-key cryptography.
His Logical framework study integrates concerns from other disciplines, such as Automated theorem proving and Calculus.
His most cited work include:
- Isabelle/HOL: A Proof Assistant for Higher-Order Logic (2168 citations)
- Isabelle: A Generic Theorem Prover (916 citations)
- The inductive approach to verifying cryptographic protocols (869 citations)
What are the main themes of his work throughout his whole career to date?
His scientific interests lie mostly in Mathematical proof, Programming language, Automated theorem proving, HOL and Computer security.
His study in Mathematical proof is interdisciplinary in nature, drawing from both Correctness, Axiom and Theoretical computer science.
His Automated theorem proving research also works with subjects such as
- Algebra which connect with Recursion,
- Simple which connect with Function.
His studies deal with areas such as Discrete mathematics and Polynomial as well as HOL.
His Discrete mathematics research integrates issues from Axiom of choice and Set theory.
His research investigates the connection between Computer security and topics such as Protocol that intersect with problems in Set and Session.
He most often published in these fields:
- Mathematical proof (24.91%)
- Programming language (24.22%)
- Automated theorem proving (18.69%)
What were the highlights of his more recent work (between 2013-2021)?
- HOL (17.65%)
- Mathematical proof (24.91%)
- Proof assistant (13.49%)
In recent papers he was focusing on the following fields of study:
Lawrence C. Paulson focuses on HOL, Mathematical proof, Proof assistant, Automated theorem proving and Discrete mathematics.
His work deals with themes such as Polynomial, Symbolic computation, Algebra and Theoretical computer science, which intersect with HOL.
The various areas that Lawrence C. Paulson examines in his Mathematical proof study include Programming language, Mathematical reasoning, Proposition and Cryptographic protocol.
His Programming language research focuses on subjects like Rotation formalisms in three dimensions, which are linked to Computational logic.
His Proof assistant research includes elements of Proof complexity, Axiom, Calculus and Field.
His Hereditarily finite set study in the realm of Discrete mathematics connects with subjects such as Argument principle, Shannon's source coding theorem and Shannon–Fano coding.
Between 2013 and 2021, his most popular works were:
- Hammering towards QED (102 citations)
- The Higher-Order Prover Leo-II (51 citations)
- Machine Learning for First-Order Theorem Proving (49 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algebra
- Complex number
Lawrence C. Paulson mainly investigates Artificial intelligence, Cylindrical algebraic decomposition, Machine learning, Mathematical proof and Quantifier elimination.
The study incorporates disciplines such as Theoretical computer science and Symbolic computation in addition to Cylindrical algebraic decomposition.
Lawrence C. Paulson interconnects Heuristics and Heuristic in the investigation of issues within Machine learning.
Many of his research projects under Mathematical proof are closely connected to Causal reasoning with Causal reasoning, tying the diverse disciplines of science together.
He studied Proof assistant and Proof procedure that intersect with HOL.
His research integrates issues of Rotation formalisms in three dimensions, Kernel and Counterexample in his study of Programming language.
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.
