- A Logic for Reasoning with Higher-Order Abstract Syntax Raymond McDowell and Dale Miller
- Electronic Notes in Theoretical Computer Science 3 (1996) URL: http://www.elsevier.nl/locate/entcs/volume3.html 15 pages
- The Bedwyr system for model checking over syntactic expressions
- Proof Search Specifications of Bisimulation and Modal Logics for the -calculus
- A Survey of Linear Logic Programming Dale Miller
- An Overview of Linear Logic Programming Dale Miller
- A META LANGUAGE FOR TYPE CHECKING AND INFERENCE
- On the specification of sequent systems Elaine Pimentel1
- FCS'03 Preliminary Version Encryption as an abstract data-type
- A Proof Theory for Generic Judgments: An extended abstract
- Focused Inductive Theorem Proving David Baelde1
- J. Symbolic Computation (1992) 11, 1?? Unification Under a Mixed Prefix
- A Logic for Reasoning with HigherOrder Abstract Syntax Raymond McDowell and Dale Miller
- Foundational Aspects of Syntax 1 Dale Miller and Catuscia Palamidessi
- A Unified Sequent Calculus for Focused Proofs Chuck Liang
- A LOGIC PROGRAMMING APPROACH TO MANIPULATING FORMULAS AND PROGRAMS
- Representing Objects in a Logic Programming Language with
- Reasoning in Abella about Structural Operational Semantics Specifications
- UNIFORM PROOFS AS A FOUNDATION FOR LOGIC PROGRAMMING
- Mixing Finite Success and Finite Failure in an Automated Prover
- Unification of Simply Typed Lambda-Terms as Logic Programming
- Department of Computer & Information Science Technical Reports (CIS)
- Specifications metalogic
- Least and greatest fixed points in linear logic Extended Version
- The -calculus as a theory in linear logic: Preliminary results
- FCS'03 Preliminary Version Encryption as an abstract data-type
- An Errata for McDowell and Miller's Cut-Elimination Andrew Gacek and Gopalan Nadathur
- A game semantics for proof search: Preliminary results 1
- Proof and refutation in MALL as a game Dale Miller
- Noname manuscript No. (will be inserted by the editor)
- Focusing and Polarization in Linear, Intuitionistic, and Classical Logics
- CSL07, 14 September 2007 1/19 Focusing and Polarization in Intuitionistic Logic
- Dale Miller Computer Science Department
- A LOGIC PROGRAMMING LANGUAGE WITH LAMBDA-ABSTRACTION, FUNCTION VARIABLES,
- A Proof Theory for Generic Judgments Dale Miller
- Higher-order quantification and proof search Dale Miller
- Logic and Logic Programming: a personal account
- Some Uses of HigherOrder Logic in Computational Linguistics
- Observations about using logic as a specification language
- AN OVERVIEW OF PROLOG GOPALAN NADATHUR
- Collection Analysis for Horn Clause Programs [Extended Abstract]
- A Kripke Semantics and Sequent Calculus for Combining Classical and Intuitionistic Logics
- Definite Clause Grammars with Scoping Constructs
- 1: Introduction Section 1: Introduction
- A Survey of Linear Logic Programming Dale Miller
- Towards a broad spectrum proof certificate Dale Miller
- Fixed points and proof theory Dale Miller
- A Focused Approach to Combining Logics Chuck Lianga
- CSL04, 22 September 2004 1/27 Bindings, mobility of bindings, and the
- Encoding Generic Judgments Dale Miller1
- Introducing Definitions
- incorporate introducing
- Encoding Generic Judgments ? Dale Miller
- A MultipleConclusion MetaLogic Dale Miller
- Reversing a list in Prolog Move one item from top of one list to the top of the other list.
- A Proof Theory for Generic Judgments Dale Miller
- A Logical Analysis of Modules in Logic Programming
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Proof search when equality is a logical connective
- A Multiple-Conclusion Meta-Logic Dale Miller
- CutElimination for a Logic with Definitions and Induction Raymond McDowell
- LEXICAL SCOPING AS UNIVERSAL QUANTIFICATION
- A MultipleConclusion Specification Logic
- A Proposal for Modules in Prolog ? Dale Miller
- An Extension to ML to Handle Bound Variables in Data Structures
- LINEAR LOGIC AS A FRAMEWORK FOR SPECIFYING SEQUENT DALE MILLER AND ELAINE PIMENTEL
- Encoding Transition Systems in Sequent Calculus Raymond McDowell
- Higher-Order Logic Programming Gopalan Nadathur
- ABSTRACTIONS IN LOGIC PROGRAMS Dale Miller
- Abstract Syntax and Logic Programming September 1991
- A Focused Approach to Combining Logics Chuck Lianga
- GIL: A Generalization of Intuitionistic Logic Chuck Liang1
- AN OVERVIEW OF PROLOG GOPALAN NADATHUR
- Algorithmic Specifications in Linear Logic with Subexponentials Vivek Nigam Dale Miller
- Encoding Generic Judgments ? Dale Miller1 and Alwen Tiu2
- An Extension to ML to Handle Bound Variables in Data Structures
- UNIFORM PROOFS AS A FOUNDATION FOR LOGIC PROGRAMMING
- Representing and reasoning with operational semantics
- Abstract syntax for variable binders: An overview
- ERRATUM FOR UNIFORM PROOFS AS A FOUNDATION FOR
- J. Symbolic Computation (1992) 11, 1-?? Unification Under a Mixed Prefix
- Observations in Pure Mathematics Dale A. Miller
- The ss-calculus as a theory in linear logic: Preliminary results *
- A Proof Theory for Generic Judgments: An extended abstract
- A Proof Theory for Generic Judgments: An extended abstract
- Proof and refutation in MALL as a game Olivier Delande, Dale Miller, and Alexis Saurin
- Finding Unity in Computational Logic Dale Miller
- Logic Programming in a Fragment of Intuitionistic Linear Logic \Lambda
- A Logic Programming Language with LambdaAbstraction, Function Variables, and Simple Unification
- Abstract syntax for variable binders: An overview
- computation Computational
- 1: Introduction Section 1: Introduction
- PEPS Relations, 15 December 2008 1/27 their uses in programming and
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- Logic Programming in a Fragment of Intuitionistic Linear Logic *
- AN OVERVIEW OF ~PROLOG GOPALAN NADATHUR
- ABSTRACTIONS IN LOGIC PROGRAMS Dale Miller
- Abstract Syntax and Logic Programming September 1991
- Foundational Aspects of Syntax 1 Dale Miller and Catuscia Palamidessi
- 1: Introduct* Section 1: Introduction
- Definite Clause Grammars with Scoping Constructs
- Encoding Transition Systems in Sequent Calculus Raymond McDowell
- October 1990 A short article for the
- LINEAR LOGIC AS A FRAMEWORK FOR SPECIFYING SEQUENT CALCULUS
- FCS'03 Preliminary Version Encryption as an abstract data-type
- Unification of Simply Typed Lambda-Terms as Logic Programming
- Some Uses of Higher-Order Logic 1. Introduction in Computational Linguistics The representation of meaning, and*
- Representing Ob jects in a Logic Programming Language with
- Combining generic judgments with recursive definitions Andrew Gacek
- arXiv:0911.2993v2[cs.LO]1Sep2010 Noname manuscript No.
- Reasoning about Computations Using Two-Levels of Logic
- Visions of CS, 14 April 2010 1/24 Finding Unity in Computational Logic
- Proof and refutation in MALL as a game Olivier Delandea
- Journees du projet PEPS-Relations 15 et 16 decembre 2008
- A Proof-Theoretic Approach to the Static Analysis of Logic Programs
- Focusing in linear meta-logic Vivek Nigam and Dale Miller
- SOS08, 6 July 2008 1/23 Formalizing SOS specifications in logic
- A neutral approach to proof and refutation in MALL Olivier Delande and Dale Miller
- Focusing and Polarization in Intuitionistic Logic Chuck Liang1
- On focusing and polarities in linear logic and intuitionistic logic Chuck Liang
- Incorporating tables into proofs Dale Miller and Vivek Nigam
- Representing and reasoning with operational Dale Miller
- Collection Analysis for Horn Clause Programs [Extended Abstract]
- A Proof Theoretic Approach to Operational Dale Miller 1,2
- LINEAR LOGIC AS A FRAMEWORK FOR SPECIFYING SEQUENT DALE MILLER AND ELAINE PIMENTEL
- September 2003 1/30 Reasoning about proof search specifications
- July 2003 1/51 Proof Search Foundations for Logic Programming
- Encoding Transition Systems in Sequent Calculus Raymond McDowell
- Electronic Notes in Theoretical Computer Science 3 (1996) URL: http://www.elsevier.nl/locate/entcs/volume3.html 15 pages
- Cut-Elimination for a Logic with Definitions and Induction Raymond McDowell
- Foundational Aspects of Syntax 1 Dale Miller and Catuscia Palamidessi
- Sequent Calculus Specification of Computation
- Linear Logic as Logic Programming: An Abstract?
- A Multiple-Conclusion Specification Logic
- Logic Programming in a Fragment of Intuitionistic Linear Logic
- A Proposal for Modules in Prolog? Dale Miller
- October 1990 A short article for the
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- ERRATUM FOR UNIFORM PROOFS AS A FOUNDATION FOR
- From Operational Semantics to Abstract Machines John Hannan
- An Extension to ML to Handle Bound Variables in Data Structures
- HIGHER-ORDER HORN CLAUSES GOPALAN NADATHUR
- LEXICAL SCOPING AS UNIVERSAL QUANTIFICATION
- A LOGIC PROGRAMMING APPROACH TO MANIPULATING FORMULAS AND PROGRAMS
- Some Uses of Higher-Order Logic in Computational Linguistics
- A Theory of Modules for Logic Programming Dale Miller
- PROOFS IN HIGHER-ORDER LOGIC Dale A. Miller
- Observations in Pure Mathematics Dale A. Miller
- An Overview of Linear Logic Programming Dale Miller
- From proofs to focused proofs: a modular proof of Focalization in Linear Logic
- Abstract syntax for variable binders: An overview
- 1 An Overview of Linear Logic Programming
- From Operational Semantics to Abstract Machines John Hannan
- A Proof Theory for Generic Judgments Dale Miller
- Higher-Order Logic Programmingy Gopalan Nadathur z
- HIGHER-ORDER HORN CLAUSES GOPALAN NADATHUR
- September|2003| 1/3* || Reasoning about proof search specifications |
- LEXICAL SCOPING AS UNIVERSAL QUANTIFICATION
- Forum: A Multiple-Conclusion
- A Survey of Linear Logic Programming Dale Miller
- A Multiple-Conclusion Meta-Logic Dale Miller
- Cut-Elimination for a Logic with Definitions and Induction Raymond McDowell
- Electronic Notes in Theoretical Computer Science 3 (1996) URL: http://www.elsevier.nl/locate/entcs/volume3.html 15 pages
- A Logical Analysis of Modules in Logic Programming
- Logic and Logic Programming: a personal account
- S&D, July 2005 1/25 A game semantics for proof search
- A proposal for broad spectrum proof certificates Dale Miller
- Department of Computer & Information Science Technical Reports (CIS)
- Sequent Calculus: overview and recent developments (Part 1)
- Programming with higher-order c Dale Miller and Gopalan Nadathur
- Sequent Calculus: overview and recent developments (Part 2)
- Communicating and trusting proofs: The case for broad spectrum proof certificates
- A formal framework for specifying sequent calculus proof systems
- Logic Programming in a Fragment of Intuitionistic Linear Logic
- A Panel on Proof Certificates Dale Miller (moderator),
- Towards a broad spectrum proof certificate Dale Miller
- A proposal for broad spectrum proof certificates Dale Miller
- Proof Certificates What is a certificate ?
- A Systematic Approach to Canonicity in the Classical Sequent Calculus
