What is he best known for?
The fields of study he is best known for:
- Programming language
- Algebra
- Algorithm
Tobias Nipkow mainly focuses on Programming language, HOL, Theoretical computer science, Proof assistant and Higher-order logic.
His HOL study incorporates themes from Operational semantics, Formal language, Soundness, Counterexample and Java.
His studies in Theoretical computer science integrate themes in fields like Correctness and Compiler.
His Proof assistant research is multidisciplinary, incorporating perspectives in Rule of inference and Natural deduction.
His Functional programming research incorporates themes from Type and Recursion.
His Recursion study also includes
- Cryptographic protocol that connect with fields like Discrete mathematics,
- Unification most often made with reference to Combinatory logic.
His most cited work include:
- Term rewriting and all that (2223 citations)
- Isabelle/HOL: A Proof Assistant for Higher-Order Logic (2168 citations)
- Isabelle: A Generic Theorem Prover (916 citations)
What are the main themes of his work throughout his whole career to date?
Tobias Nipkow mainly investigates Programming language, HOL, Automated theorem proving, Discrete mathematics and Theoretical computer science.
Tobias Nipkow studied HOL and Hoare logic that intersect with Separation logic.
His Automated theorem proving research includes themes of Executable, Calculus and Algebra.
Confluence, Rewriting and Unification are the primary areas of interest in his Algebra study.
His work in the fields of Discrete mathematics, such as Higher-order logic and Reduction, overlaps with other areas such as Kepler conjecture.
His Theoretical computer science research is multidisciplinary, relying on both Bytecode, Data type and Data structure.
He most often published in these fields:
- Programming language (40.89%)
- HOL (31.98%)
- Automated theorem proving (27.53%)
What were the highlights of his more recent work (between 2012-2021)?
- Programming language (40.89%)
- HOL (31.98%)
- Theoretical computer science (18.22%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Programming language, HOL, Theoretical computer science, Automated theorem proving and Mathematical proof.
His Programming language study incorporates themes from Code generation and Code.
His HOL research integrates issues from Discrete mathematics, Correctness, Splay tree, Separation logic and Simple.
His biological study spans a wide range of topics, including Binary search tree, Data structure, Search tree and Proof assistant.
His Automated theorem proving study integrates concerns from other disciplines, such as Functional programming, Soundness and Probabilistic analysis of algorithms.
His work deals with themes such as Semantics, Structural induction and Algebra, which intersect with Functional programming.
Between 2012 and 2021, his most popular works were:
- A formal proof of the Kepler conjecture (160 citations)
- Concrete Semantics: With Isabelle/HOL (94 citations)
- A Fully Verified Executable LTL Model Checker (54 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algebra
- Algorithm
His main research concerns Programming language, HOL, Theoretical computer science, Automated theorem proving and Functional programming.
His studies deal with areas such as Proof assistant, Mathematical proof and Code as well as Programming language.
Tobias Nipkow combines subjects such as Splay tree and Code generation with his study of HOL.
His Splay tree research includes themes of Skew, Discrete mathematics and Amortized analysis.
His Automated theorem proving research is multidisciplinary, incorporating elements of Focus, Algebra, Counterexample, Theory of computation and Kernel.
He focuses mostly in the field of Functional programming, narrowing it down to matters related to Structural induction and, in some cases, Functional logic programming.
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.
