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
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.
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.
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.
Term rewriting and all that
Franz Baader;Tobias Nipkow.
Isabelle: A Generic Theorem Prover
Lawrence C. Paulson;Tobias Nipkow.
Higher-order critical pairs
logic in computer science (1991)
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)
FM 2006: Formal Methods
Jayadev Misra;Tobias Nipkow;Emil Sekerinski.
Nitpick: a counterexample generator for higher-order logic based on a relational model finder
Jasmin Christian Blanchette;Tobias Nipkow.
interactive theorem proving (2010)
Javalight is type-safe—definitely
Tobias Nipkow;David von Oheimb.
symposium on principles of programming languages (1998)
Concrete Semantics: With Isabelle/HOL
Tobias Nipkow;Gerwin Klein.
Code generation via higher-order rewrite systems
Florian Haftmann;Tobias Nipkow.
international symposium on functional and logic programming (2010)
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: