Name
Affiliation
Papers
DALE MILLER
INRIA-Futurs & ÉÉcole polytechnique
94
Collaborators
Citations 
PageRank 
71
2485
232.26
Referers 
Referees 
References 
1369
758
1347
Search Limit
1001000
Title
Citations
PageRank
Year
A Survey of the Proof-Theoretic Foundations of Logic Programming.00.342022
The undecidability of proof search when equality is a logical connective00.342022
Functions-as-constructors higher-order unification: extended pattern unification00.342022
From axioms to synthetic inference rules via focusing00.342022
Andre and the Early Days of Penn's Logic and Computation Group.00.342020
EATCS Distinguished Dissertation Award 2020 - Call for Nominations.00.342020
A proof-theoretic approach to certifying skolemization.00.342019
Mechanized Metatheory Revisited00.342019
A Proof Theory for Model Checking10.352019
Functional programming with λ-tree syntax00.342019
EATCS Distinguished Dissertation Award 2018 - Call for Nominations.00.342018
Translating Between Implicit and Explicit Versions of Proof.10.352017
Proof checking and logic programming.30.382017
A Proof Theory For Model Checking: An Extended Abstract00.342017
Separating Functional Computation from Relations.00.342017
Functions-as-Constructors Higher-Order Unification.00.342016
A multi-focused proof system isomorphic to expansion proofs10.352016
Proof Certificates for Equality Reasoning.40.382016
Well-Typed Languages are Sound.00.342016
Mechanized Metatheory Revisited: An Extended Abstract (Invited Paper).00.342016
Defining the meaning of TPTP formatted proofs.00.342015
On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control.00.342015
A Framework For Proof Certificates In Finite State Exploration40.392015
Proof Outlines As Proof Certificates: A System Description30.372015
A Lightweight Formalization of the Metatheory of Bisimulation-Up-To20.392015
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, 201400.342014
Abella: A System For Reasoning About Relational Specifications100.642014
Preserving differential privacy under finite-precision semantics.80.552013
Foundational proof certificates in first-order logic90.662013
Unifying Classical and Intuitionistic Logics for Computational Control30.662013
A formal framework for specifying sequent calculus proof systems170.802013
Checking Foundational Proof Certificates for First-Order Logic (Extended Abstract).40.472013
Extracting Proofs From Tabled Proof Search10.352013
Kripke semantics and proof systems for combining intuitionistic logic and classical logic.50.482013
Foundational proof certificates: making proof universal and permanent30.392013
A Systematic Approach to Canonicity in the Classical Sequent Calculus.50.502012
A focused approach to combining logics80.602011
A proposal for broad spectrum proof certificates50.522011
A Framework for Proof Systems80.562010
Fixed Points and Proof Theory: An Extended Abstract.00.342010
Reasoning about computations using two-levels of logic10.362010
Algorithmic specifications in linear logic with subexponentials291.062009
A Unified Sequent Calculus for Focused Proofs60.532009
Formalizing Operational Semantic Specifications in Logic20.362009
Focusing and polarization in linear, intuitionistic, and classical logics722.812009
A Neutral Approach to Proof and Refutation in MALL80.662008
Focusing in Linear Meta-logic50.512008
Combining Generic Judgments with Recursive Definitions270.992008
From proofs to focused proofs: a modular proof of focalization in linear logic351.542007
Focusing and polarization in intuitionistic logic311.682007
  • 1
  • 2