Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Dale Miller
Author information
- INRIA Saclay - Île-de-France
Other persons with the same name
2010 – today
- 2013
[j33]Chuck Liang, Dale Miller: Kripke semantics and proof systems for combining intuitionistic logic and classical logic. Ann. Pure Appl. Logic 164(2): 86-111 (2013)- [j32]Dale Miller, Elaine Pimentel: A formal framework for specifying sequent calculus proof systems. Theor. Comput. Sci. 474: 98-116 (2013)
- [c65]Zakaria Chihani, Dale Miller, Fabien Renaud: Foundational Proof Certificates in First-Order Logic. CADE 2013: 162-177
- [c64]Chuck Liang, Dale Miller: Unifying Classical and Intuitionistic Logics for Computational Control. LICS 2013: 283-292
- [i10]Ivan Gazeau, Dale Miller, Catuscia Palamidessi: Preserving differential privacy under finite-precision semantics. CoRR abs/1306.2691 (2013)
- 2012
- [j31]Andrew Gacek, Dale Miller, Gopalan Nadathur: A Two-Level Logic Approach to Reasoning About Computations. J. Autom. Reasoning 49(2): 241-273 (2012)
- [c63]Kaustuv Chaudhuri, Stefan Hetzl, Dale Miller: A Systematic Approach to Canonicity in the Classical Sequent Calculus. CSL 2012: 183-197
- [c62]Ivan Gazeau, Dale Miller, Catuscia Palamidessi: A non-local method for robustness analysis of floating point programs. QAPL 2012: 63-76
- [e3]Bernhard Gramlich, Dale Miller, Uli Sattler (Eds.): 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
- [e2]Chris Hawblitzel, Dale Miller (Eds.): 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
- [e1]Dale Miller, Zoltán Ésik (Eds.): Proceedings 8th Workshop on Fixed Points in Computer Science. EPTCS 77, 2012
- 2011
- [j30]Chuck Liang, Dale Miller: A focused approach to combining logics. Ann. Pure Appl. Logic 162(9): 679-697 (2011)
- [j29]
- [c61]
- 2010
- [j28]Olivier Delande, Dale Miller, Alexis Saurin: Proof and refutation in MALL as a game. Ann. Pure Appl. Logic 161(5): 654-672 (2010)
- [j27]
- [j26]Alwen Tiu, Dale Miller: Proof search specifications of bisimulation and modal logics for the pi-calculus. ACM Trans. Comput. Log. 11(2) (2010)
- [c60]
- [c59]
2000 – 2009
- 2009
- [j25]Andrew Gacek, Dale Miller, Gopalan Nadathur: Reasoning in Abella about Structural Operational Semantics Specifications. Electr. Notes Theor. Comput. Sci. 228: 85-100 (2009)
- [j24]Dale Miller: Formalizing Operational Semantic Specifications in Logic. Electr. Notes Theor. Comput. Sci. 246: 147-165 (2009)
- [j23]Chuck Liang, Dale Miller: Focusing and polarization in linear, intuitionistic, and classical logics. Theor. Comput. Sci. 410(46): 4747-4768 (2009)
- [c58]
- [c57]Vivek Nigam, Dale Miller: Algorithmic specifications in linear logic with subexponentials. PPDP 2009: 129-140
- [i9]
- [i8]Andrew Gacek, Dale Miller, Gopalan Nadathur: A two-level logic approach to reasoning about computations. CoRR abs/0911.2993 (2009)
- 2008
- [j22]Dale Miller: Formalizing Operational Semantic Specifications in Logic. Bulletin of the EATCS 96: 59-79 (2008)
- [c56]
- [c55]Kaustuv Chaudhuri, Dale Miller, Alexis Saurin: Canonical Sequent Proofs via Multi-Focusing. IFIP TCS 2008: 383-396
- [c54]Andrew Gacek, Dale Miller, Gopalan Nadathur: Combining Generic Judgments with Recursive Definitions. LICS 2008: 33-44
- [c53]Olivier Delande, Dale Miller: A Neutral Approach to Proof and Refutation in MALL. LICS 2008: 498-508
- [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
- [c52]David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu: The Bedwyr System for Model Checking over Syntactic Expressions. CADE 2007: 391-397
- [c51]Dale Miller, Alexis Saurin: From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. CSL 2007: 405-419
- [c50]
- [c49]
- [c48]
- [i4]
- [i3]Chuck 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
- [j21]Dale Miller, Alexis Saurin: A Game Semantics for Proof Search: Preliminary Results. Electr. Notes Theor. Comput. Sci. 155: 543-563 (2006)
- [j20]Axelle Ziegler, Dale Miller, Catuscia Palamidessi: A Congruence Format for Name-passing Calculi. Electr. Notes Theor. Comput. Sci. 156(1): 169-189 (2006)
- [j19]Dale Miller: A Proof Theoretic Approach to Operational Semantics. Electr. Notes Theor. Comput. Sci. 162: 243-247 (2006)
- [c47]
- [c46]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
- [c45]
- 2005
- [j18]Alwen Fernanto Tiu, Dale Miller: A Proof Search Specification of the pi-Calculus. Electr. Notes Theor. Comput. Sci. 138(1): 79-101 (2005)
- [j17]Dale Miller, Alwen Tiu: A proof theory for generic judgments. ACM Trans. Comput. Log. 6(4): 749-783 (2005)
- [c44]Dale Miller, Alexis Saurin: A game semantics for proof search: preliminary results. GALOP 2005: 92-106
- [c43]
- 2004
- [c42]Dale Miller: Bindings, Mobility of Bindings, and the "generic judgments"-Quantifier: An Abstract. CSL 2004: 24
- 2003
- [j16]Dale Miller: Encryption as an abstract data type. Electr. Notes Theor. Comput. Sci. 84: 18-29 (2003)
- [j15]Raymond McDowell, Dale Miller, Catuscia Palamidessi: Encoding transition systems in sequent calculus. Theor. Comput. Sci. 294(3): 411-437 (2003)
- [c41]Dale Miller, Alwen Fernanto Tiu: A Proof Theory for Generic Judgments: An extended abstract. LICS 2003: 118-127
- [c40]
- 2002
- [j14]Raymond McDowell, Dale Miller: Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. Comput. Log. 3(1): 80-136 (2002)
- [c39]
- [c38]
- [c37]Dale Miller, Elaine Pimentel: Using Linear Logic to Reason about Sequent Systems. TABLEAUX 2002: 2-23
- 2001
- [j13]Dale Miller: Encoding Generic Judgments: Preliminary results. Electr. Notes Theor. Comput. Sci. 58(1): 59-78 (2001)
- 2000
- [j12]Raymond McDowell, Dale Miller: Cut-elimination for a logic with definitions and induction. Theor. Comput. Sci. 232(1-2): 91-119 (2000)
- [c36]
- [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
- [c35]Raymond McDowell, Dale Miller: A Logic for Reasoning with Higher-Order Abstract Syntax. LICS 1997: 434-445
- 1996
- [j10]
- [j9]Raymond McDowell, Dale Miller, Catuscia Palamidessi: Encoding Transition Systems in Sequent Calculus. Electr. Notes Theor. Comput. Sci. 3: 138-152 (1996)
- [j8]Dale Miller: Forum: A Multiple-Conclusion Specification Logic. Theor. Comput. Sci. 165(1): 201-232 (1996)
- [c34]
- 1995
- [c33]
- 1994
- [j7]Joshua S. Hodas, Dale Miller: Logic Programming in a Fragment of Intuitionistic Linear Logic. Inf. Comput. 110(2): 327-365 (1994)
- [c32]
- [c31]
- [c30]
- 1993
- [c29]
- 1992
- [j6]
- [j5]John Hannan, Dale Miller: From Operational Semantics for Abstract Machines. Mathematical Structures in Computer Science 2(4): 415-459 (1992)
- [c28]
- 1991
- [j4]Dale Miller, Gopalan Nadathur, Frank Pfenning, Andre Scedrov: Uniform Proofs as a Foundation for Logic Programming. Ann. Pure Appl. Logic 51(1-2): 125-157 (1991)
- [j3]Dale Miller: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification. J. Log. Comput. 1(4): 497-536 (1991)
- [c27]
- [c26]
- [c25]Joshua S. Hodas, Dale Miller: Logic Programming in a Fragment of Intuitionistic Linear Logic. LICS 1991: 32-42
- [c24]
- 1990
- [j2]
- [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]
- [c18]John Hannan, Dale Miller: From Operational Semantics to Abstract Machines: Preliminary Results. LISP and Functional Programming 1990: 323-332
1980 – 1989
- 1989
- [j1]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]
- [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]
- [c11]John Hannan, Dale Miller: Uses of Higher-Order Unification for Implementing Program Transformers. ICLP/SLP 1988: 942-959
- [c10]
- 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]
- [c3]
- 1984
- [c2]Dale Miller: Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs. CADE 1984: 375-393
- 1982
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:57 CEST by the dblp team