| 2009 |
|---|
| 87 | EE | Andrew Gacek,
Dale Miller,
Gopalan Nadathur:
Reasoning in Abella about Structural Operational Semantics Specifications.
Electr. Notes Theor. Comput. Sci. 228: 85-100 (2009) |
| 2008 |
|---|
| 86 | EE | Kaustuv Chaudhuri,
Dale Miller,
Alexis Saurin:
Canonical Sequent Proofs via Multi-Focusing.
IFIP TCS 2008: 383-396 |
| 85 | EE | Vivek Nigam,
Dale Miller:
Focusing in Linear Meta-logic.
IJCAR 2008: 507-522 |
| 84 | EE | Andrew Gacek,
Dale Miller,
Gopalan Nadathur:
Combining Generic Judgments with Recursive Definitions.
LICS 2008: 33-44 |
| 83 | EE | Olivier Delande,
Dale Miller:
A Neutral Approach to Proof and Refutation in MALL.
LICS 2008: 498-508 |
| 82 | EE | Andrew Gacek,
Dale Miller,
Gopalan Nadathur:
Combining generic judgments with recursive definitions
CoRR abs/0802.0865: (2008) |
| 81 | EE | Andrew Gacek,
Dale Miller,
Gopalan Nadathur:
Reasoning in Abella about Structural Operational Semantics Specifications
CoRR abs/0804.3914: (2008) |
| 80 | EE | Alwen Tiu,
Dale Miller:
Proof Search Specifications for Bisimulation and Modal Logics for the pi-Calculus
CoRR abs/0805.2785: (2008) |
| 2007 |
|---|
| 79 | EE | David Baelde,
Andrew Gacek,
Dale Miller,
Gopalan Nadathur,
Alwen Tiu:
The Bedwyr System for Model Checking over Syntactic Expressions.
CADE 2007: 391-397 |
| 78 | EE | Dale Miller,
Alexis Saurin:
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic.
CSL 2007: 405-419 |
| 77 | EE | Chuck Liang,
Dale Miller:
Focusing and Polarization in Intuitionistic Logic.
CSL 2007: 451-465 |
| 76 | EE | Dale Miller,
Vivek Nigam:
Incorporating Tables into Proofs.
CSL 2007: 466-480 |
| 75 | EE | David Baelde,
Dale Miller:
Least and Greatest Fixed Points in Linear Logic.
LPAR 2007: 92-106 |
| 74 | EE | Dale Miller:
Collection analysis for Horn clause programs
CoRR abs/0708.2230: (2007) |
| 73 | EE | Chuck Liang,
Dale Miller:
Focusing and Polarization in Intuitionistic Logic
CoRR abs/0708.2252: (2007) |
| 72 | EE | 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 |
|---|
| 71 | EE | 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 |
| 70 | EE | Dale Miller:
Representing and Reasoning with Operational Semantics.
IJCAR 2006: 4-20 |
| 69 | EE | Dale Miller:
Collection analysis for Horn clause programs.
PPDP 2006: 179-188 |
| 68 | EE | Dale Miller,
Alexis Saurin:
A Game Semantics for Proof Search: Preliminary Results.
Electr. Notes Theor. Comput. Sci. 155: 543-563 (2006) |
| 67 | EE | Axelle Ziegler,
Dale Miller,
Catuscia Palamidessi:
A Congruence Format for Name-passing Calculi.
Electr. Notes Theor. Comput. Sci. 156(1): 169-189 (2006) |
| 66 | EE | Dale Miller:
A Proof Theoretic Approach to Operational Semantics.
Electr. Notes Theor. Comput. Sci. 162: 243-247 (2006) |
| 2005 |
|---|
| 65 | | Dale Miller,
Alexis Saurin:
A game semantics for proof search: preliminary results.
GALOP 2005: 92-106 |
| 64 | EE | Elaine Pimentel,
Dale Miller:
On the Specification of Sequent Systems.
LPAR 2005: 352-366 |
| 63 | EE | Dale Miller,
Alwen Tiu:
A proof theory for generic judgments.
ACM Trans. Comput. Log. 6(4): 749-783 (2005) |
| 62 | EE | Alwen Fernanto Tiu,
Dale Miller:
A Proof Search Specification of the pi-Calculus.
Electr. Notes Theor. Comput. Sci. 138(1): 79-101 (2005) |
| 2004 |
|---|
| 61 | EE | Dale Miller:
Bindings, Mobility of Bindings, and the "generic judgments"-Quantifier: An Abstract.
CSL 2004: 24 |
| 2003 |
|---|
| 60 | EE | Dale Miller,
Alwen Fernanto Tiu:
A Proof Theory for Generic Judgments: An extended abstract.
LICS 2003: 118-127 |
| 59 | EE | Dale Miller:
Reasoning about Proof Search Specifications: An Abstract.
TPHOLs 2003: 204 |
| 58 | EE | Dale Miller:
Encryption as an abstract data type.
Electr. Notes Theor. Comput. Sci. 84: (2003) |
| 57 | | Raymond McDowell,
Dale Miller,
Catuscia Palamidessi:
Encoding transition systems in sequent calculus.
Theor. Comput. Sci. 294(3): 411-437 (2003) |
| 2002 |
|---|
| 56 | EE | Dale Miller:
Higher-Order Quantification and Proof Search.
AMAST 2002: 60-74 |
| 55 | EE | Dale Miller,
Alwen Fernanto Tiu:
Encoding Generic Judgments.
FSTTCS 2002: 18-32 |
| 54 | EE | Dale Miller,
Elaine Pimentel:
Using Linear Logic to Reason about Sequent Systems.
TABLEAUX 2002: 2-23 |
| 53 | EE | Raymond McDowell,
Dale Miller:
Reasoning with higher-order abstract syntax in a logical framework.
ACM Trans. Comput. Log. 3(1): 80-136 (2002) |
| 2001 |
|---|
| 52 | EE | Dale Miller:
Encoding Generic Judgments: Preliminary results.
Electr. Notes Theor. Comput. Sci. 58(1): (2001) |
| 2000 |
|---|
| 51 | EE | Dale Miller:
Abstract Syntax for Variable Binders: An Overview.
Computational Logic 2000: 239-253 |
| 50 | EE | Raymond McDowell,
Dale Miller:
Reasoning with Higher-Order Abstract Syntax in a Logical Framework
CoRR cs.LO/0003062: (2000) |
| 49 | EE | Raymond McDowell,
Dale Miller:
Cut-elimination for a logic with definitions and induction.
Theor. Comput. Sci. 232(1-2): 91-119 (2000) |
| 1999 |
|---|
| 48 | EE | Dale Miller,
Catuscia Palamidessi:
Foundational Aspects of Syntax.
ACM Comput. Surv. 31(3es): 11 (1999) |
| 1997 |
|---|
| 47 | EE | Raymond McDowell,
Dale Miller:
A Logic for Reasoning with Higher-Order Abstract Syntax.
LICS 1997: 434-445 |
| 1996 |
|---|
| 46 | EE | Dale Miller:
Linear Logic as Logic Programming: An Abstract.
LACL 1996: 63-67 |
| 45 | | Dale Miller:
Logical Foundations for Open System Design.
ACM Comput. Surv. 28(4es): 48 (1996) |
| 44 | EE | Raymond McDowell,
Dale Miller,
Catuscia Palamidessi:
Encoding Transition Systems in Sequent Calculus.
Electr. Notes Theor. Comput. Sci. 3: (1996) |
| 43 | EE | Dale Miller:
Forum: A Multiple-Conclusion Specification Logic.
Theor. Comput. Sci. 165(1): 201-232 (1996) |
| 1995 |
|---|
| 42 | | Dale Miller:
Observations about Using Logic as a Specification Language.
GULP-PRODE 1995: 61-70 |
| 1994 |
|---|
| 41 | | Dale Miller:
Specifications Using Multiple-Conclusion Logic Programs.
ALP 1994: 3-4 |
| 40 | | Dale Miller:
A Multiple-Conclusion Meta-Logic
LICS 1994: 272-281 |
| 39 | | Dale Miller:
Specifications Using Multiple-Conclusion Logic Programs.
PLILP 1994: 3-4 |
| 38 | | Joshua S. Hodas,
Dale Miller:
Logic Programming in a Fragment of Intuitionistic Linear Logic
Inf. Comput. 110(2): 327-365 (1994) |
| 1993 |
|---|
| 37 | | Dale Miller:
A Proposal for Modules in Lambda-Prolog.
ELP 1993: 206-221 |
| 36 | | Brian Soderberg,
Dale Miller:
Image Generation Design for Ground-based Network Training Environments.
VR 1993: 318-329 |
| 35 | | James M. Calvin,
Alan Dickens,
Bob Gaines,
Paul Metzger,
Dale Miller,
Dan Owen:
The Simnet Virtual World Architecture.
VR 1993: 450-455 |
| 1992 |
|---|
| 34 | EE | 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 |
| 33 | | Dale Miller:
The pi-Calculus as a Theory in Linear Logic: Preliminary Results.
ELP 1992: 242-264 |
| 32 | | Dale Miller:
Unification Under a Mixed Prefix.
J. Symb. Comput. 14(4): 321-358 (1992) |
| 31 | | John Hannan,
Dale Miller:
From Operational Semantics for Abstract Machines.
Mathematical Structures in Computer Science 2(4): 415-459 (1992) |
| 1991 |
|---|
| 30 | | Dale Miller:
Unification of Simply Typed Lamda-Terms as Logic Programming.
ICLP 1991: 255-269 |
| 29 | | Dale Miller:
Logics for Logic Programming: A Tutorial.
ICLP 1991: 911 |
| 28 | | Joshua S. Hodas,
Dale Miller:
Logic Programming in a Fragment of Intuitionistic Linear Logic
LICS 1991: 32-42 |
| 27 | | Dale Miller:
Abstract Syntax and Logic Programming.
RCLP 1991: 322-337 |
| 26 | | 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) |
| 25 | | Dale Miller:
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification.
J. Log. Comput. 1(4): 497-536 (1991) |
| 1990 |
|---|
| 24 | | Amy P. Felty,
Dale Miller:
Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language.
CADE 1990: 221-235 |
| 23 | | Amy P. Felty,
Elsa L. Gunter,
Dale Miller,
Frank Pfenning:
Tutorial on Lambda-Prolog.
CADE 1990: 682 |
| 22 | | Remo Pareschi,
Dale Miller:
Extending Definite Clause Grammars with Scoping Constructs.
ICLP 1990: 373-389 |
| 21 | | Joshua S. Hodas,
Dale Miller:
Representing Objects in a Logic Programming Langueage with Scoping Constructs.
ICLP 1990: 511-526 |
| 20 | | Dale Miller:
Higher-Order Logic Programming.
ICLP 1990: 784 |
| 19 | EE | John Hannan,
Dale Miller:
From Operational Semantics to Abstract Machines: Preliminary Results.
LISP and Functional Programming 1990: 323-332 |
| 18 | EE | Gopalan Nadathur,
Dale Miller:
Higher-Order Horn Clauses
J. ACM 37(4): 777-814 (1990) |
| 1989 |
|---|
| 17 | | Dale Miller:
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification.
ELP 1989: 253-281 |
| 16 | | Dale Miller:
Lexical Scoping as Universal Quantification.
ICLP 1989: 268-283 |
| 15 | | John Hannan,
Dale Miller:
Deriving Mixed Evaluation from Standard Evaluation for a Simple Functional Language.
MPC 1989: 239-255 |
| 14 | | Dale Miller:
A Logical Analysis of Modules in Logic Programming.
J. Log. Program. 6(1&2): 79-108 (1989) |
| 1988 |
|---|
| 13 | | Amy P. Felty,
Dale Miller:
Specifying Theorem Provers in a Higher-Order Logic Programming Language.
CADE 1988: 61-80 |
| 12 | | 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 |
| 11 | | Gopalan Nadathur,
Dale Miller:
An Overview of Lambda-PROLOG.
ICLP/SLP 1988: 810-827 |
| 10 | | John Hannan,
Dale Miller:
Uses of Higher-Order Unification for Implementing Program Transformers.
ICLP/SLP 1988: 942-959 |
| 9 | | John Hannan,
Dale Miller:
A Meta-Logic for Functional Programming.
META 1988: 453-476 |
| 1987 |
|---|
| 8 | | Dale Miller,
Gopalan Nadathur,
Andre Scedrov:
Hereditary Harrop Formulas and Uniform Proof Systems
LICS 1987: 98-105 |
| 7 | | Dale Miller,
Gopalan Nadathur:
A Logic Programming Approach to Manipulating Formulas and Programs.
SLP 1987: 379-388 |
| 1986 |
|---|
| 6 | | Dale Miller,
Amy P. Felty:
An Integration of Resolution and Natural Deduction Theorem Proving.
AAAI 1986: 198-202 |
| 5 | EE | Aravind K. Joshi,
Timothy W. Finin,
Dale Miller,
Lokendra Shastri,
Bonnie L. Webber:
Research in Natural Language Processing.
HLT 1986 |
| 4 | | Dale Miller,
Gopalan Nadathur:
Higher-Order Logic Programming.
ICLP 1986: 448-462 |
| 3 | | Dale Miller:
A Theory of Modules for Logic Programming.
SLP 1986: 106-114 |
| 1984 |
|---|
| 2 | | Dale Miller:
Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs.
CADE 1984: 375-393 |
| 1982 |
|---|
| 1 | | Dale Miller,
Eve Longini Cohen,
Peter B. Andrews:
A Look at TPS.
CADE 1982: 50-69 |
