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.
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.
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.
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)
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
Journal of Logic and Computation (1991)
Logic programming in a fragment of intuitionistic linear logic
J.S. Hodas;D. Miller.
logic in computer science (1991)
A logical analysis of modules in logic programming
Journal of Logic Programming (1989)
Unification under a mixed prefix
Journal of Symbolic Computation (1992)
Higher-Order Logic Programming
Dale A Miller;Gopalan Nadathur.
international conference on logic programming (1986)
Focusing and polarization in linear, intuitionistic, and classical logics
Chuck Liang;Dale Miller.
Theoretical Computer Science (2009)
Forum: a multiple-conclusion specification logic
Theoretical Computer Science (1996)
A proof theory for generic judgments
Dale Miller;Alwen Tiu.
ACM Transactions on Computational Logic (2005)
The pi-Calculus as a Theory in Linear Logic: Preliminary Results
international workshop on extensions of logic programming (1992)
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.
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: