Syntax vs Semantics: Comparing Consistency Proofs for Minimal Propositional Logics

Consistency is a key property of any logical system. However, proofs of consistency usually rely on heavy proof theory notions like admissibility of cut. A more semantics-based approach to consistency proofs explores the correspondence between a logic and its relationship with the evaluation in a λ-calculus, known as Curry-Howard isomorphism. In this work, we present a comparison between two formalizations of consistency for minimal propositional logic: one using a semantic-based approach and another following the (traditional) syntactic, proof-theoretical approach in both Coq proof assistant and Agda programming language. We conclude by discussing the lessons learned during the cerfication of these results in both languages.

[1]  Philip Wadler,et al.  Programming Language Foundations in Agda , 2018, SBMF.

[2]  Massimo Bartoletti,et al.  Journal of Logical and Algebraic Methods in Programming , 2015 .

[3]  M. Sørensen,et al.  Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics) , 2006 .

[4]  Floris van Doorn.  Propositional Calculus in Coq , 2015, ArXiv.

[5]  Nada Amin,et al.  Type soundness proofs with definitional interpreters , 2017, POPL.

[6]  Per Martin-Löf,et al.  An intuitionistic theory of types , 1972 .

[7]  Tobias Nipkow,et al.  Propositional Proof Systems , 2017, Arch. Formal Proofs.

[8]  Tobias Nipkow,et al.  Formal Verification of Algorithm W: The Monomorphic Case , 1996, TPHOLs.

[9]  M. Sørensen,et al.  Lectures on the Curry-Howard Isomorphism , 2013 .

[10]  de Ng Dick Bruijn,et al.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[11]  Yves Bertot,et al.  Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .

[12]  Rodrigo Geraldo Ribeiro,et al.  Certified Bit-Coded Regular Expression Parsing , 2017, SBLP.

[13]  Philip Wadler,et al.  Programming language foundations in Agda , 2020, Sci. Comput. Program..

[14]  Vivek Nigam,et al.  Mechanizing Focused Linear Logic in Coq , 2017, LSFA.

[15]  Christian Doczkal,et al.  A Constructive Theory of Regular Languages in Coq , 2013, CPP.

[16]  Assia Mahboubi,et al.  An introduction to small scale reflection in Coq , 2010, J. Formaliz. Reason..

[17]  Tobias Nipkow,et al.  Type Inference Verified: Algorithm W in Isabelle/HOL , 2004, Journal of Automated Reasoning.

[18]  Sara Negri,et al.  Structural proof theory , 2001 .

[19]  Jacques Garrigue.  A Certified Implementation of ML with Structural Polymorphism , 2010, APLAS.

[20]  Derek Dreyer,et al.  How to make ad hoc proof automation less ad hoc , 2011, ICFP '11.

[21]  Adam Chlipala,et al.  Certified Programming with Dependent Types - A Pragmatic Introduction to the Coq Proof Assistant , 2013 .

[22]  Tom Ridge,et al.  Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars , 2011, CPP.

[23]  Tarmo Uustalu,et al.  Certified CYK parsing of context-free languages , 2014, J. Log. Algebraic Methods Program..

[24]  Adam Chlipala.  Parametric higher-order abstract syntax for mechanized semantics , 2008, ICFP.

[25]  Leslie G. Valiant,et al.  General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[26]  G. Gentzen.  Die Widerspruchsfreiheit der reinen Zahlentheorie , 1936 .

[27]  Catherine Dubois,et al.  Certification of a Type Inference Tool for ML: Damas–Milner within Coq , 1999, Journal of Automated Reasoning.

[28]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[29]  Guillaume Allais.  Typing with Leftovers - A mechanization of Intuitionistic Multiplicative-Additive Linear Logic , 2017, TYPES.

[30]  Morten Heine Sørensen,et al.  Chapter 4 - The Curry-Howard isomorphism , 2006 .

[31]  Jacques Garrigue.  A certified implementation of ML with structural polymorphism and recursive types , 2015, Math. Struct. Comput. Sci..

[32]  Arthur Charguéraud,et al.  The Locally Nameless Representation , 2012, Journal of Automated Reasoning.

[33]  Patrik Jansson,et al.  Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda , 2016, Log. Methods Comput. Sci..