A Survey of the Proof-Theoretic Foundations of Logic Programming. | 0 | 0.34 | 2022 |
The undecidability of proof search when equality is a logical connective | 0 | 0.34 | 2022 |
Functions-as-constructors higher-order unification: extended pattern unification | 0 | 0.34 | 2022 |
From axioms to synthetic inference rules via focusing | 0 | 0.34 | 2022 |
Andre and the Early Days of Penn's Logic and Computation Group. | 0 | 0.34 | 2020 |
EATCS Distinguished Dissertation Award 2020 - Call for Nominations. | 0 | 0.34 | 2020 |
A proof-theoretic approach to certifying skolemization. | 0 | 0.34 | 2019 |
Mechanized Metatheory Revisited | 0 | 0.34 | 2019 |
A Proof Theory for Model Checking | 1 | 0.35 | 2019 |
Functional programming with λ-tree syntax | 0 | 0.34 | 2019 |
EATCS Distinguished Dissertation Award 2018 - Call for Nominations. | 0 | 0.34 | 2018 |
Translating Between Implicit and Explicit Versions of Proof. | 1 | 0.35 | 2017 |
Proof checking and logic programming. | 3 | 0.38 | 2017 |
A Proof Theory For Model Checking: An Extended Abstract | 0 | 0.34 | 2017 |
Separating Functional Computation from Relations. | 0 | 0.34 | 2017 |
Functions-as-Constructors Higher-Order Unification. | 0 | 0.34 | 2016 |
A multi-focused proof system isomorphic to expansion proofs | 1 | 0.35 | 2016 |
Proof Certificates for Equality Reasoning. | 4 | 0.38 | 2016 |
Well-Typed Languages are Sound. | 0 | 0.34 | 2016 |
Mechanized Metatheory Revisited: An Extended Abstract (Invited Paper). | 0 | 0.34 | 2016 |
Defining the meaning of TPTP formatted proofs. | 0 | 0.34 | 2015 |
On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control. | 0 | 0.34 | 2015 |
A Framework For Proof Certificates In Finite State Exploration | 4 | 0.39 | 2015 |
Proof Outlines As Proof Certificates: A System Description | 3 | 0.37 | 2015 |
A Lightweight Formalization of the Metatheory of Bisimulation-Up-To | 2 | 0.39 | 2015 |
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, 2014 | 0 | 0.34 | 2014 |
Abella: A System For Reasoning About Relational Specifications | 10 | 0.64 | 2014 |
Preserving differential privacy under finite-precision semantics. | 8 | 0.55 | 2013 |
Foundational proof certificates in first-order logic | 9 | 0.66 | 2013 |
Unifying Classical and Intuitionistic Logics for Computational Control | 3 | 0.66 | 2013 |
A formal framework for specifying sequent calculus proof systems | 17 | 0.80 | 2013 |
Checking Foundational Proof Certificates for First-Order Logic (Extended Abstract). | 4 | 0.47 | 2013 |
Extracting Proofs From Tabled Proof Search | 1 | 0.35 | 2013 |
Kripke semantics and proof systems for combining intuitionistic logic and classical logic. | 5 | 0.48 | 2013 |
Foundational proof certificates: making proof universal and permanent | 3 | 0.39 | 2013 |
A Systematic Approach to Canonicity in the Classical Sequent Calculus. | 5 | 0.50 | 2012 |
A focused approach to combining logics | 8 | 0.60 | 2011 |
A proposal for broad spectrum proof certificates | 5 | 0.52 | 2011 |
A Framework for Proof Systems | 8 | 0.56 | 2010 |
Fixed Points and Proof Theory: An Extended Abstract. | 0 | 0.34 | 2010 |
Reasoning about computations using two-levels of logic | 1 | 0.36 | 2010 |
Algorithmic specifications in linear logic with subexponentials | 29 | 1.06 | 2009 |
A Unified Sequent Calculus for Focused Proofs | 6 | 0.53 | 2009 |
Formalizing Operational Semantic Specifications in Logic | 2 | 0.36 | 2009 |
Focusing and polarization in linear, intuitionistic, and classical logics | 72 | 2.81 | 2009 |
A Neutral Approach to Proof and Refutation in MALL | 8 | 0.66 | 2008 |
Focusing in Linear Meta-logic | 5 | 0.51 | 2008 |
Combining Generic Judgments with Recursive Definitions | 27 | 0.99 | 2008 |
From proofs to focused proofs: a modular proof of focalization in linear logic | 35 | 1.54 | 2007 |
Focusing and polarization in intuitionistic logic | 31 | 1.68 | 2007 |