Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDale Miller 0001
Dale A. Miller
Person information
- affiliation: INRIA Saclay - Île-de-France, France
- affiliation (former): University of Pennsylvania, Computer and Information Science, Philadelphia, PA, USA
- affiliation (PhD 1983): Carnegie Mellon University, Pittsburgh, PA, USA
Other persons with the same name
- Dale Miller 0002 — LORAL Adv. Distributed Simulation, Bellevue, WA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c105]Dale Miller, Jui-Hsuan Wu:
A Positive Perspective on Term Representation (Invited Talk). CSL 2023: 3:1-3:21- [c104]Farah Al Wardani
, Kaustuv Chaudhuri, Dale Miller:
Formal Reasoning Using Distributed Assertions. FroCoS 2023: 176-194 - [c103]Dale Miller:
A system of inference based on proof search: an extended abstract. LICS 2023: 1-11 - [i14]Dale Miller:
A system of inference based on proof search: an extended abstract. CoRR abs/2307.12704 (2023) - [i13]Matteo Manighetti, Dale Miller:
Peano Arithmetic and μMALL. CoRR abs/2312.13634 (2023) - 2022
- [j38]Tomer Libal, Dale Miller:
Functions-as-constructors higher-order unification: extended pattern unification. Ann. Math. Artif. Intell. 90(5): 455-479 (2022) - [j37]Dale Miller, Alexandre Viel:
The undecidability of proof search when equality is a logical connective. Ann. Math. Artif. Intell. 90(5): 523-535 (2022) - [j36]Sonia Marin, Dale Miller, Elaine Pimentel, Marco Volpe:
From axioms to synthetic inference rules via focusing. Ann. Pure Appl. Log. 173(5): 103091 (2022) - [j35]Dale Miller:
A Survey of the Proof-Theoretic Foundations of Logic Programming. Theory Pract. Log. Program. 22(6): 859-904 (2022) - 2021
- [i12]Dale Miller:
A Survey of the Proof-Theoretic Foundations of Logic Programming. CoRR abs/2109.01483 (2021) - 2020
- [j34]Susanne Albers, Nikhil Bansal, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, David Peleg, Vladimiro Sassone, Alexandra Silva:
EATCS Distinguished Dissertation Award 2020 - Call for Nominations. Bull. EATCS 132 (2020) - [c102]Dale Miller:
Andre and the Early Days of Penn's Logic and Computation Group. Logic, Language, and Security 2020: 69-70 - [c101]Dale Miller:
A Distributed and Trusted Web of Formal Proofs. ICDCIT 2020: 21-40 - [c100]Matteo Cimini, Dale Miller, Jeremy G. Siek:
Extrinsically typed operational semantics for functional languages. SLE 2020: 108-125 - [c99]Matteo Manighetti, Dale Miller, Alberto Momigliano:
Two Applications of Logic Programming to Coq. TYPES 2020: 10:1-10:19 - [e8]Holger Hermanns, Lijun Zhang, Naoki Kobayashi, Dale Miller:
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020. ACM 2020, ISBN 978-1-4503-7104-9 [contents]
2010 – 2019
- 2019
- [j33]David Peleg, Susanne Albers, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, Vladimiro Sassone:
EATCS Distinguished Dissertation Award 2019 - Call for Nominations. Bull. EATCS 129 (2019) - [j32]Dale Miller:
Mechanized Metatheory Revisited. J. Autom. Reason. 63(3): 625-665 (2019) - [j31]Quentin Heath, Dale Miller:
A Proof Theory for Model Checking. J. Autom. Reason. 63(4): 857-885 (2019) - [c98]Kaustuv Chaudhuri, Matteo Manighetti, Dale Miller:
A proof-theoretic approach to certifying skolemization. CPP 2019: 78-90 - [c97]Roberto Blanco, Dale Miller, Alberto Momigliano:
Property-Based Testing via Proof Reconstruction. PPDP 2019: 5:1-5:13 - [c96]Ulysse Gérard, Dale Miller, Gabriel Scherer:
Functional programming with λ-tree syntax. PPDP 2019: 12:1-12:16 - [e7]Dale Miller, Ivan Scagnetto:
Proceedings of the Fourteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, LFMTP@LICS 2019, Vancouver, Canada, 22nd June 2019. EPTCS 307, 2019 [contents] - [i11]Ulysse Gérard, Dale Miller, Gabriel Scherer:
Functional programming with lambda-tree syntax. CoRR abs/1908.03619 (2019) - 2017
- [j30]Dale Miller:
Proof checking and logic programming. Formal Aspects Comput. 29(3): 383-399 (2017) - [j29]Zakaria Chihani, Dale Miller, Fabien Renaud:
A Semantic Framework for Proof Evidence. J. Autom. Reason. 59(3): 287-330 (2017) - [c95]Roberto Blanco, Zakaria Chihani, Dale Miller:
Translating Between Implicit and Explicit Versions of Proof. CADE 2017: 255-273 - [c94]Ulysse Gérard, Dale Miller:
Separating Functional Computation from Relations. CSL 2017: 23:1-23:17 - [e6]Dale Miller:
2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK. LIPIcs 84, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-047-7 [contents] - 2016
- [j28]Kaustuv Chaudhuri, Stefan Hetzl, Dale Miller:
A multi-focused proof system isomorphic to expansion proofs. J. Log. Comput. 26(2): 577-603 (2016) - [j27]Ivan Gazeau, Dale Miller, Catuscia Palamidessi:
Preserving differential privacy under finite-precision semantics. Theor. Comput. Sci. 655: 92-108 (2016) - [c93]Sonia Marin, Dale Miller, Marco Volpe:
A focused framework for emulating modal proof systems. Advances in Modal Logic 2016: 469-488 - [c92]Tomer Libal, Dale Miller:
Functions-as-Constructors Higher-Order Unification. FSCD 2016: 26:1-26:17 - [c91]Dale Miller:
Mechanized Metatheory Revisited: An Extended Abstract (Invited Paper). TYPES 2016: 1:1-1:16 - [c90]Quentin Heath, Dale Miller:
A Proof Theory for Model Checking: An Extended Abstract. LINEARITY 2016: 1-10 - [i10]Matteo Cimini, Dale Miller, Jeremy G. Siek:
Well-Typed Languages are Sound. CoRR abs/1611.05105 (2016) - 2015
- [c89]Kaustuv Chaudhuri, Matteo Cimini, Dale Miller:
A Lightweight Formalization of the Metatheory of Bisimulation-Up-To. CPP 2015: 157-166 - [c88]Dale Miller:
Proof Checking and Logic Programming. LOPSTR 2015: 3-17 - [c87]Roberto Blanco, Tomer Libal, Dale Miller:
Defining the meaning of TPTP formatted proofs. IWIL@LPAR 2015: 78-90 - [c86]Dale Miller, Marco Volpe:
Focused Labeled Proof Systems for Modal Logic. LPAR 2015: 266-280 - [c85]Chuck C. Liang, Dale Miller:
On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control. LPAR 2015: 297-312 - [c84]Dale Miller:
Proof checking and logic programming. PPDP 2015: 18 - [c83]Roberto Blanco, Dale Miller:
Proof Outlines as Proof Certificates: A System Description. WoF'15 2015: 7-14 - [c82]Quentin Heath, Dale Miller:
A framework for proof certificates in finite state exploration. PxTP@CADE 2015: 11-26 - [c81]Zakaria Chihani, Dale Miller:
Proof Certificates for Equality Reasoning. LSFA 2015: 93-108 - 2014
- [j26]David Baelde, Kaustuv Chaudhuri, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu, Yuting Wang:
Abella: A System for Reasoning about Relational Specifications. J. Formaliz. Reason. 7(2): 1-89 (2014) - [e5]Thomas A. Henzinger, Dale Miller:
Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014. ACM 2014, ISBN 978-1-4503-2886-9 [contents] - [r1]Christoph Benzmüller, Dale Miller:
Automation of Higher-Order Logic. Computational Logic 2014: 215-254 - 2013
- [j25]Chuck C. Liang, Dale Miller:
Kripke semantics and proof systems for combining intuitionistic logic and classical logic. Ann. Pure Appl. Log. 164(2): 86-111 (2013) - [j24]Dale Miller, Elaine Pimentel:
A formal framework for specifying sequent calculus proof systems. Theor. Comput. Sci. 474: 98-116 (2013) - [c80]Zakaria Chihani, Dale Miller, Fabien Renaud:
Checking Foundational Proof Certificates for First-Order Logic (Extended Abstract). PxTP@CADE 2013: 58-66 - [c79]Zakaria Chihani, Dale Miller, Fabien Renaud:
Foundational Proof Certificates in First-Order Logic. CADE 2013: 162-177 - [c78]Dale Miller, Alwen Tiu:
Extracting Proofs from Tabled Proof Search. CPP 2013: 194-210 - [c77]Dale Miller:
Foundational proof certificates: making proof universal and permanent. LFMTP 2013: 1-2 - [c76]Chuck C. Liang, Dale Miller:
Unifying Classical and Intuitionistic Logics for Computational Control. LICS 2013: 283-292 - [c75]Ivan Gazeau, Dale Miller, Catuscia Palamidessi:
Preserving differential privacy under finite-precision semantics. QAPL 2013: 1-18 - 2012
- [b1]Dale Miller, Gopalan Nadathur:
Programming with Higher-Order Logic. Cambridge University Press 2012, ISBN 978-0-521-87940-8, pp. I-XIII, 1-306 - [j23]Andrew Gacek, Dale Miller, Gopalan Nadathur:
A Two-Level Logic Approach to Reasoning About Computations. J. Autom. Reason. 49(2): 241-273 (2012) - [c74]Kaustuv Chaudhuri, Stefan Hetzl, Dale Miller:
A Systematic Approach to Canonicity in the Classical Sequent Calculus. CSL 2012: 183-197 - [c73]Ivan Gazeau, Dale Miller, Catuscia Palamidessi:
A non-local method for robustness analysis of floating point programs. QAPL 2012: 63-76 - [e4]Bernhard Gramlich, Dale Miller, Uli Sattler:
Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings. Lecture Notes in Computer Science 7364, Springer 2012, ISBN 978-3-642-31364-6 [contents] - [e3]Chris Hawblitzel, Dale Miller:
Certified Programs and Proofs - Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings. Lecture Notes in Computer Science 7679, Springer 2012, ISBN 978-3-642-35307-9 [contents] - [e2]Dale Miller, Zoltán Ésik:
Proceedings 8th Workshop on Fixed Points in Computer Science, FICS 2012, Tallinn, Estonia, 24th March 2012. EPTCS 77, 2012 [contents] - 2011
- [j22]Chuck C. Liang, Dale Miller:
A focused approach to combining logics. Ann. Pure Appl. Log. 162(9): 679-697 (2011) - [j21]Andrew Gacek, Dale Miller, Gopalan Nadathur:
Nominal abstraction. Inf. Comput. 209(1): 48-73 (2011) - [c72]Dale Miller:
A Proposal for Broad Spectrum Proof Certificates. CPP 2011: 54-69 - 2010
- [j20]Olivier Delande, Dale Miller, Alexis Saurin:
Proof and refutation in MALL as a game. Ann. Pure Appl. Log. 161(5): 654-672 (2010) - [j19]Vivek Nigam, Dale Miller:
A Framework for Proof Systems. J. Autom. Reason. 45(2): 157-188 (2010) - [j18]Alwen Tiu, Dale Miller:
Proof search specifications of bisimulation and modal logics for the pi-calculus. ACM Trans. Comput. Log. 11(2): 13:1-13:35 (2010) - [c71]Dale Miller:
Reasoning about Computations Using Two-Levels of Logic. APLAS 2010: 34-46 - [c70]David Baelde, Dale Miller, Zachary Snow:
Focused Inductive Theorem Proving. IJCAR 2010: 278-292 - [c69]Dale Miller:
Fixed Points and Proof Theory: An Extended Abstract. FICS 2010: 9-16
2000 – 2009
- 2009
- [j17]Chuck C. Liang, Dale Miller:
Focusing and polarization in linear, intuitionistic, and classical logics. Theor. Comput. Sci. 410(46): 4747-4768 (2009) - [c68]Chuck C. Liang, Dale Miller:
A Unified Sequent Calculus for Focused Proofs. LICS 2009: 355-364 - [c67]Vivek Nigam, Dale Miller:
Algorithmic specifications in linear logic with subexponentials. PPDP 2009: 129-140 - [i9]Andrew Gacek, Dale Miller, Gopalan Nadathur:
Nominal Abstraction. CoRR abs/0908.1390 (2009) - [i8]Andrew Gacek, Dale Miller, Gopalan Nadathur:
A two-level logic approach to reasoning about computations. CoRR abs/0911.2993 (2009) - 2008
- [j16]Dale Miller:
Formalizing Operational Semantic Specifications in Logic. Bull. EATCS 96: 59-79 (2008) - [c66]Vivek Nigam, Dale Miller:
Focusing in Linear Meta-logic. IJCAR 2008: 507-522 - [c65]Kaustuv Chaudhuri, Dale Miller, Alexis Saurin:
Canonical Sequent Proofs via Multi-Focusing. IFIP TCS 2008: 383-396 - [c64]Andrew Gacek, Dale Miller, Gopalan Nadathur:
Combining Generic Judgments with Recursive Definitions. LICS 2008: 33-44 - [c63]Olivier Delande, Dale Miller:
A Neutral Approach to Proof and Refutation in MALL. LICS 2008: 498-508 - [c62]Andrew Gacek, Dale Miller, Gopalan Nadathur:
Reasoning in Abella about Structural Operational Semantics Specifications. LFMTP@LICS 2008: 85-100 - [c61]Dale Miller:
Formalizing Operational Semantic Specifications in Logic. WFLP 2008: 147-165 - [i7]Andrew Gacek, Dale Miller, Gopalan Nadathur:
Combining generic judgments with recursive definitions. CoRR abs/0802.0865 (2008) - [i6]Andrew Gacek, Dale Miller, Gopalan Nadathur:
Reasoning in Abella about Structural Operational Semantics Specifications. CoRR abs/0804.3914 (2008) - [i5]Alwen Tiu, Dale Miller:
Proof Search Specifications for Bisimulation and Modal Logics for the pi-Calculus. CoRR abs/0805.2785 (2008) - 2007
- [c60]David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu:
The Bedwyr System for Model Checking over Syntactic Expressions. CADE 2007: 391-397 - [c59]Dale Miller, Alexis Saurin:
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. CSL 2007: 405-419 - [c58]Chuck C. Liang, Dale Miller:
Focusing and Polarization in Intuitionistic Logic. CSL 2007: 451-465 - [c57]Dale Miller, Vivek Nigam:
Incorporating Tables into Proofs. CSL 2007: 466-480 - [c56]David Baelde, Dale Miller:
Least and Greatest Fixed Points in Linear Logic. LPAR 2007: 92-106 - [i4]Dale Miller:
Collection analysis for Horn clause programs. CoRR abs/0708.2230 (2007) - [i3]Chuck C. Liang, Dale Miller:
Focusing and Polarization in Intuitionistic Logic. CoRR abs/0708.2252 (2007) - [i2]David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu:
The Bedwyr system for model checking over syntactic expressions. CoRR abs/cs/0702116 (2007) - 2006
- [c55]Dale Miller:
Representing and Reasoning with Operational Semantics. IJCAR 2006: 4-20 - [c54]Gary T. Leavens, Jean-Raymond Abrial, Don S. Batory, Michael J. Butler, Alessandro Coglio, Kathi Fisler, Eric C. R. Hehner, Cliff B. Jones, Dale Miller, Simon L. Peyton Jones, Murali Sitaraman, Douglas R. Smith, Aaron Stump:
Roadmap for enhanced languages and methods to aid verification. GPCE 2006: 221-236 - [c53]Dale Miller:
Collection analysis for Horn clause programs. PPDP 2006: 179-188 - 2005
- [j15]Dale Miller, Alwen Tiu:
A proof theory for generic judgments. ACM Trans. Comput. Log. 6(4): 749-783 (2005) - [c52]Dale Miller, Alexis Saurin:
A game semantics for proof search: preliminary results. GALOP@ETAPS 2005: 92-106 - [c51]Elaine Pimentel, Dale Miller:
On the Specification of Sequent Systems. LPAR 2005: 352-366 - [c50]Axelle Ziegler, Dale Miller, Catuscia Palamidessi:
A Congruence Format for Name-passing Calculi. SOS@ICALP 2005: 169-189 - [c49]Dale Miller:
A Proof Theoretic Approach to Operational Semantics. APC 25 2005: 243-247 - [c48]Dale Miller, Alexis Saurin:
A Game Semantics for Proof Search: Preliminary Results. MFPS 2005: 543-563 - 2004
- [c47]Dale Miller:
Bindings, Mobility of Bindings, and the "generic judgments"-Quantifier: An Abstract. CSL 2004: 24 - [c46]Alwen Fernanto Tiu, Dale Miller:
A Proof Search Specification of the pi-Calculus. FGUC 2004: 79-101 - 2003
- [j14]Raymond McDowell, Dale Miller, Catuscia Palamidessi:
Encoding transition systems in sequent calculus. Theor. Comput. Sci. 294(3): 411-437 (2003) - [c45]Dale Miller, Alwen Fernanto Tiu:
A Proof Theory for Generic Judgments: An extended abstract. LICS 2003: 118-127 - [c44]Dale Miller:
Reasoning about Proof Search Specifications: An Abstract. TPHOLs 2003: 204 - [c43]Dale Miller:
Encryption as an abstract data type. WoLLIC 2003: 18-29 - 2002
- [j13]Raymond McDowell, Dale Miller:
Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. Comput. Log. 3(1): 80-136 (2002) - [c42]Dale Miller:
Higher-Order Quantification and Proof Search. AMAST 2002: 60-74 - [c41]Dale Miller, Alwen Fernanto Tiu:
Encoding Generic Judgments. FSTTCS 2002: 18-32 - [c40]Dale Miller, Elaine Pimentel:
Using Linear Logic to Reason about Sequent Systems. TABLEAUX 2002: 2-23 - 2001
- [c39]Dale Miller:
Encoding Generic Judgments: Preliminary results. MERLIN 2001: 59-78 - 2000
- [j12]Raymond McDowell, Dale Miller:
Cut-elimination for a logic with definitions and induction. Theor. Comput. Sci. 232(1-2): 91-119 (2000) - [c38]Dale Miller:
Abstract Syntax for Variable Binders: An Overview. Computational Logic 2000: 239-253 - [i1]Raymond McDowell, Dale Miller:
Reasoning with Higher-Order Abstract Syntax in a Logical Framework. CoRR cs.LO/0003062 (2000)
1990 – 1999
- 1999
- [j11]Dale Miller, Catuscia Palamidessi:
Foundational Aspects of Syntax. ACM Comput. Surv. 31(3es): 11 (1999) - 1997
- [c37]Raymond McDowell, Dale Miller:
A Logic for Reasoning with Higher-Order Abstract Syntax. LICS 1997: 434-445 - 1996
- [j10]Dale Miller:
Logical Foundations for Open System Design. ACM Comput. Surv. 28(4es): 48 (1996) - [j9]Dale Miller:
Forum: A Multiple-Conclusion Specification Logic. Theor. Comput. Sci. 165(1): 201-232 (1996) - [c36]Dale Miller:
Linear Logic as Logic Programming: An Abstract. LACL 1996: 63-67 - [c35]Raymond McDowell, Dale Miller, Catuscia Palamidessi:
Encoding Transition Systems in Sequent Calculus. Linear Logic Tokyo Meeting 1996: 138-152 - 1995
- [c34]Dale Miller:
Observations about Using Logic as a Specification Language. GULP-PRODE 1995: 61-70 - [p1]Christine M. Neuwirth, Ravinder Chandhok, David Kaufer, James H. Morris, Paul Erion, Dale Miller:
Annotations are not "for free": The Need for Runtime Layer Support in Hypertext Engines. Designing User Interfaces for Hypermedia 1995: 156-166 - 1994
- [j8]Joshua S. Hodas, Dale Miller:
Logic Programming in a Fragment of Intuitionistic Linear Logic. Inf. Comput. 110(2): 327-365 (1994) - [c33]Dale Miller:
Specifications Using Multiple-Conclusion Logic Programs. ALP 1994: 3-4 - [c32]Dale Miller:
A Multiple-Conclusion Meta-Logic. LICS 1994: 272-281 - [c31]Dale Miller:
Specifications Using Multiple-Conclusion Logic Programs. PLILP 1994: 3-4 - 1993
- [c30]Dale Miller:
A Proposal for Modules in Lambda-Prolog. ELP 1993: 206-221 - [e1]Dale Miller:
Logic Programming, Proceedings of the 1993 International Symposium, Vancouver, British Columbia, Canada, October 26-29, 1993. MIT Press 1993, ISBN 0-262-63152-0 [contents] - 1992
- [j7]Dale Miller:
Unification Under a Mixed Prefix. J. Symb. Comput. 14(4): 321-358 (1992) - [j6]John Hannan, Dale Miller:
From Operational Semantics for Abstract Machines. Math. Struct. Comput. Sci. 2(4): 415-459 (1992) - [c29]Christine Neuwirth, Ravinder Chandhok, David Kaufer, Paul Erion, James H. Morris, Dale Miller:
Flexible Diff-ing in a Collaborative Writing System. CSCW 1992: 147-154 - [c28]Dale Miller:
The pi-Calculus as a Theory in Linear Logic: Preliminary Results. ELP 1992: 242-264 - 1991
- [j5]Dale Miller, Gopalan Nadathur, Frank Pfenning, Andre Scedrov:
Uniform Proofs as a Foundation for Logic Programming. Ann. Pure Appl. Log. 51(1-2): 125-157 (1991) - [j4]Dale Miller:
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification. J. Log. Comput. 1(4): 497-536 (1991) - [c27]Dale Miller:
Unification of Simply Typed Lamda-Terms as Logic Programming. ICLP 1991: 255-269 - [c26]Dale Miller:
Logics for Logic Programming: A Tutorial. ICLP 1991: 911 - [c25]Joshua S. Hodas, Dale Miller:
Logic Programming in a Fragment of Intuitionistic Linear Logic. LICS 1991: 32-42 - [c24]Dale Miller:
Abstract Syntax and Logic Programming. RCLP 1991: 322-337 - 1990
- [j3]Gopalan Nadathur, Dale Miller:
Higher-Order Horn Clauses. J. ACM 37(4): 777-814 (1990) - [c23]Amy P. Felty, Dale Miller:
Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language. CADE 1990: 221-235 - [c22]Amy P. Felty, Elsa L. Gunter, Dale Miller, Frank Pfenning:
Tutorial on Lambda-Prolog. CADE 1990: 682 - [c21]Remo Pareschi, Dale Miller:
Extending Definite Clause Grammars with Scoping Constructs. ICLP 1990: 373-389 - [c20]Joshua S. Hodas, Dale Miller:
Representing Objects in a Logic Programming Langueage with Scoping Constructs. ICLP 1990: 511-526 - [c19]Dale Miller:
Higher-Order Logic Programming. ICLP 1990: 784 - [c18]John Hannan, Dale Miller:
From Operational Semantics to Abstract Machines: Preliminary Results. LISP and Functional Programming 1990: 323-332
1980 – 1989
- 1989
- [j2]Dale Miller:
A Logical Analysis of Modules in Logic Programming. J. Log. Program. 6(1&2): 79-108 (1989) - [c17]Dale Miller:
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification. ELP 1989: 253-281 - [c16]Dale Miller:
Lexical Scoping as Universal Quantification. ICLP 1989: 268-283 - [c15]John Hannan, Dale Miller:
Deriving Mixed Evaluation from Standard Evaluation for a Simple Functional Language. MPC 1989: 239-255 - 1988
- [c14]Amy P. Felty, Dale Miller:
Specifying Theorem Provers in a Higher-Order Logic Programming Language. CADE 1988: 61-80 - [c13]Amy P. Felty, Elsa L. Gunter, John Hannan, Dale Miller, Gopalan Nadathur, Andre Scedrov:
Lambda-Prolog: An Extended Logic Programming Language. CADE 1988: 754-755 - [c12]Gopalan Nadathur, Dale Miller:
An Overview of Lambda-PROLOG. ICLP/SLP 1988: 810-827 - [c11]John Hannan, Dale Miller:
Uses of Higher-Order Unification for Implementing Program Transformers. ICLP/SLP 1988: 942-959 - [c10]John Hannan, Dale Miller:
A Meta-Logic for Functional Programming. META 1988: 453-476 - 1987
- [j1]Dale A. Miller:
A compact representation of proofs. Stud Logica 46(4): 347-370 (1987) - [c9]Dale Miller, Gopalan Nadathur, Andre Scedrov:
Hereditary Harrop Formulas and Uniform Proof Systems. LICS 1987: 98-105 - [c8]Dale Miller, Gopalan Nadathur:
A Logic Programming Approach to Manipulating Formulas and Programs. SLP 1987: 379-388 - 1986
- [c7]Dale Miller, Amy P. Felty:
An Integration of Resolution and Natural Deduction Theorem Proving. AAAI 1986: 198-202 - [c6]Dale Miller, Gopalan Nadathur:
Some Uses of Higher-Order Logic in Computational Linguistics. ACL 1986: 247-256 - [c5]Aravind K. Joshi, Timothy W. Finin, Dale Miller, Lokendra Shastri, Bonnie L. Webber:
Research in Natural Language Processing. HLT 1986 - [c4]Dale Miller, Gopalan Nadathur:
Higher-Order Logic Programming. ICLP 1986: 448-462 - [c3]Dale Miller:
A Theory of Modules for Logic Programming. SLP 1986: 106-114 - 1984
- [c2]Dale Miller:
Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs. CADE 1984: 375-393 - 1982
- [c1]Dale A. Miller, Eve Longini Cohen, Peter B. Andrews:
A Look at TPS. CADE 1982: 50-69
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-01-18 20:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
