- Home
- Best Scientists - Computer Science
- Dale Miller

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
35
Citations
6,521
109
World Ranking
5744
National Ranking
136

- Programming language
- First-order logic
- Mathematical logic

His scientific interests lie mostly in Horn clause, Programming language, Logic programming, Prolog and Functional logic programming. His Horn clause research includes elements of Proof theory, Unification and Linear logic. Particularly relevant to λProlog is his body of work in Logic programming.

He works mostly in the field of Prolog, limiting it down to topics relating to Predicate and, in certain cases, Negation, Unit propagation, Arithmetic, SLD resolution and Horn-satisfiability. His work deals with themes such as Fifth-generation programming language and Theoretical computer science, which intersect with Functional logic programming. His biological study spans a wide range of topics, including Operational semantics and Type erasure.

- Uniform proofs as a foundation for logic programming (554 citations)
- Logic programming in a fragment of intuitionistic linear logic (379 citations)
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification (325 citations)

Dale Miller spends much of his time researching Programming language, Logic programming, Mathematical proof, Proof theory and Theoretical computer science. His Programming language study frequently involves adjacent topics like Linear logic. His research in Logic programming intersects with topics in Inductive programming, Functional logic programming and Prolog.

His study in Mathematical proof is interdisciplinary in nature, drawing from both Structure, Automated theorem proving and Rule of inference. His Proof theory research is multidisciplinary, incorporating elements of Proof complexity, Algorithm, Sequent calculus and Calculus. As a part of the same scientific family, Dale Miller mostly works in the field of Horn clause, focusing on Unification and, on occasion, Quantifier.

- Programming language (51.10%)
- Logic programming (29.96%)
- Mathematical proof (28.63%)

- Mathematical proof (28.63%)
- Programming language (51.10%)
- Proof theory (22.47%)

Mathematical proof, Programming language, Proof theory, Structural proof theory and Proof assistant are his primary areas of study. The concepts of his Mathematical proof study are interwoven with issues in Theoretical computer science, Rule of inference and Metatheory. His study in Syntax, Data structure, Automated theorem proving, Logic programming and Functional programming is done as part of Programming language.

In his research on the topic of Logic programming, Horn clause and Prolog is strongly related with Inductive programming. He has researched Proof theory in several fields, including Bisimulation, Mathematical logic and Linear logic. His studies in Structural proof theory integrate themes in fields like Discrete mathematics and Calculus.

- Automation of Higher-Order Logic (45 citations)
- Abella: A System for Reasoning about Relational Specifications (36 citations)
- A formal framework for specifying sequent calculus proof systems (34 citations)

- Programming language
- First-order logic
- Algorithm

Dale Miller mainly investigates Mathematical proof, Discrete mathematics, Structural proof theory, Proof theory and Calculus. The study incorporates disciplines such as Certificate and Programming language, Metatheory in addition to Mathematical proof. His studies deal with areas such as Natural number and Automaton as well as Programming language.

In his study, which falls under the umbrella issue of Discrete mathematics, Proof by contradiction and Analytic proof is strongly linked to Proof complexity. His research investigates the connection with Calculus and areas like Algorithm which intersect with concerns in Method of analytic tableaux, Multimodal logic, Normal modal logic and Modal logic. He studied Higher-order logic and Linear logic that intersect with Intuitionistic logic.

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.

Uniform proofs as a foundation for logic programming

D. Miller;G. Nadathur;F. Pfenning;A. Scedrov.

Annals of Pure and Applied Logic **(1991)**

860 Citations

A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification

Dale Miller.

Journal of Logic and Computation **(1991)**

749 Citations

Logic programming in a fragment of intuitionistic linear logic

J.S. Hodas;D. Miller.

logic in computer science **(1991)**

584 Citations

A logical analysis of modules in logic programming

Dale Miller.

Journal of Logic Programming **(1989)**

389 Citations

Unification under a mixed prefix

Dale Miller.

Journal of Symbolic Computation **(1992)**

275 Citations

Higher-Order Logic Programming

Dale A Miller;Gopalan Nadathur.

international conference on logic programming **(1986)**

259 Citations

Focusing and polarization in linear, intuitionistic, and classical logics

Chuck Liang;Dale Miller.

Theoretical Computer Science **(2009)**

203 Citations

Forum: a multiple-conclusion specification logic

Dale Miller.

Theoretical Computer Science **(1996)**

197 Citations

A proof theory for generic judgments

Dale Miller;Alwen Tiu.

ACM Transactions on Computational Logic **(2005)**

181 Citations

The pi-Calculus as a Theory in Linear Logic: Preliminary Results

Dale Miller.

international workshop on extensions of logic programming **(1992)**

175 Citations

French Institute for Research in Computer Science and Automation - INRIA

Carnegie Mellon University

University of Pennsylvania

Institute of Science and Technology Austria

Newcastle University

University of Southampton

University of Central Florida

University of Edinburgh

The University of Texas at Austin

University of Pennsylvania

French Institute for Research in Computer Science and Automation - INRIA

Publications: 16

Profile was last updated on December 6th, 2021.

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

The ranking d-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

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.