- Home
- Top Scientists - Computer Science
- Tobias Nipkow

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
H-index
40
Citations
11,829
122
World Ranking
4419
National Ranking
203

- 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.

- 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)

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.

- Programming language (40.89%)
- HOL (31.98%)
- Automated theorem proving (27.53%)

- Programming language (40.89%)
- HOL (31.98%)
- Theoretical computer science (18.22%)

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.

- 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)

- 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.

Isabelle/HOL: A Proof Assistant for Higher-Order Logic

Tobias Nipkow;Markus Wenzel;Lawrence C. Paulson.

**(2002)**

4173 Citations

Term rewriting and all that

Franz Baader;Tobias Nipkow.

**(1998)**

3801 Citations

Isabelle: A Generic Theorem Prover

Lawrence C. Paulson;Tobias Nipkow.

**(1994)**

1608 Citations

Higher-order critical pairs

T. Nipkow.

logic in computer science **(1991)**

400 Citations

A machine-checked model for a Java-like language, virtual machine, and compiler

Gerwin Klein;Tobias Nipkow.

ACM Transactions on Programming Languages and Systems **(2006)**

352 Citations

FM 2006: Formal Methods

Jayadev Misra;Tobias Nipkow;Emil Sekerinski.

**(2006)**

316 Citations

Nitpick: a counterexample generator for higher-order logic based on a relational model finder

Jasmin Christian Blanchette;Tobias Nipkow.

interactive theorem proving **(2010)**

275 Citations

Javalight is type-safe—definitely

Tobias Nipkow;David von Oheimb.

symposium on principles of programming languages **(1998)**

264 Citations

Concrete Semantics: With Isabelle/HOL

Tobias Nipkow;Gerwin Klein.

**(2014)**

228 Citations

Code generation via higher-order rewrite systems

Florian Haftmann;Tobias Nipkow.

international symposium on functional and logic programming **(2010)**

213 Citations

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

University of Cambridge

TU Dresden

TU Darmstadt

RWTH Aachen University

Max Planck Institute for Informatics

Intel (United States)

Technical University of Munich

The University of Texas at Austin

Technical University of Munich

Czech Technical University in Prague

French Institute for Research in Computer Science and Automation - INRIA

Publications: 37

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:

Something went wrong. Please try again later.