Dale Miller

Publications173
h-index28
Citations3,622
Highly Influential Citations205
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • Dale A. Miller
  • 96 Publications • 5,684 Citations
  • G. Nadathur
  • 109 Publications • 3,314 Citations
  • F. Pfenning
  • 384 Publications • 14,315 Citations
  • A. Tiu
  • 111 Publications • 2,170 Citations
  • Publications
  • Influence
A Logical Analysis of Modules in Logic Programming
  • Dale Miller
  • Computer Science
    J. Log. Program.
  • 3 January 1989
View via Publisher
Logic Programming in a Fragment of Intuitionistic Linear Logic
The intuitionistic notion of context is refined by using a fragment of J.-Y. Girard's (Theor. Comput. Sci., vol.50, p.1-102, 1987) linear logic that includes additive and multiplicative conjunction,…
View PDF
Logic programming in a fragment of intuitionistic linear logic
The intuitionistic notion of context is refined by using a fragment of J.-Y. Girard's (Theor. Comput. Sci., vol.50, p.1-102, 1987) linear logic that includes additive and multiplicative conjunction,…
View on IEEE
Focusing and polarization in linear, intuitionistic, and classical logics
View via Publisher
A proof theory for generic judgments
TLDR
A sequent calculus is presented that provides this local notion of proof-level abstraction via generic judgment and a new quantifier, ∇, which explicitly manipulates such local scope.
View on ACM
Least and Greatest Fixed Points in Linear Logic
TLDR
This work designs a focused proof system that proves complete with respect to the initial system, and establishes weak normalization for it, and shows how these foundations can be applied to intuitionistic logic.
View on ACM
Deep Inference and Symmetry in Classical Proofs
In this thesis we see deductive systems for classical propositional and predicate logic which use deep inference, i.e. inference rules apply arbitrarily deep inside formulas, and a certain symmetry,…
Algorithmic specifications in linear logic with subexponentials
TLDR
This work shows that focused proof search can be precisely linked to a simple algorithmic specification language that contains while-loops, conditionals, and insertion into and deletion from multisets and proposes a new logical connective that allows for the creation of new subexponentials, thereby further augmenting the algorithmic expressiveness of logic.
View on ACM
A Congruence Format for Name-passing Calculi
View via Publisher
Abella: A System for Reasoning about Relational Specifications
TLDR
This tutorial exposes Abella incrementally, starting with its capabilities at a first-order logic level and gradually presenting more sophisticated features, ending with the support it offers to the two-level logic approach to meta-theoretic reasoning.
View via Publisher
...
...