Certified undecidability of intuitionistic linear logic via binary stack machines and Minsky machines

We formally prove the undecidability of entailment in intuitionistic linear logic in Coq. We reduce the Post correspondence problem (PCP) via binary stack machines and Minsky machines to intuitionistic linear logic. The reductions rely on several technically involved formalisations, amongst them a binary stack machine simulator for PCP, a verified low-level compiler for instruction-based languages and a soundness proof for intuitionistic linear logic with respect to trivial phase semantics. We exploit the computability of all functions definable in constructive type theory and thus do not have to rely on a concrete model of computation, enabling the reduction proofs to focus on correctness properties.

[1]  Gert Smolka,et al.  Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq , 2017, ITP.

[2]  Max I. Kanovich.  The direct simulation of Minsky machines in linear logic , 1995 .

[3]  Katalin Bimbó,et al.  The decidability of the intensional fragment of classical linear logic , 2015, Theor. Comput. Sci..

[4]  Vincent Zammit,et al.  A Proof of the S-m-n theorem in Coq , 1997 .

[5]  Mariano M. Moscato,et al.  Formalization of the Undecidability of the Halting Problem for a Functional Language , 2018, WoLLIC.

[6]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[7]  Xavier Leroy,et al.  Formal certification of a compiler back-end or: programming a compiler with a proof assistant , 2006, POPL '06.

[8]  Dominique Larchey-Wendling,et al.  Nondeterministic Phase Semantics and the Undecidability of Boolean BI , 2011, TOCL.

[9]  Thorsten Altenkirch,et al.  Hereditary substitutions for simple types, formalized , 2010, MSFP '10.

[10]  Damien Pous,et al.  An Efficient Coq Tactic for Deciding Kleene Algebras , 2010, ITP.

[11]  Max I. Kanovich,et al.  Linear Logic as a Logic of Computations , 1994, Ann. Pure Appl. Log..

[12]  Amy P. Felty,et al.  Formalizing Abstract Computability: Turing Categories in Coq , 2018, LSFA.

[13]  Ursula Dresdner,et al.  Computation Finite And Infinite Machines , 2016 .

[14]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[15]  Y. Forster,et al.  Verified Extraction from Coq to a Lambda-Calculus , 2016 .

[16]  Dominique Larchey-Wendling.  Typing Total Recursive Functions in Coq , 2017, ITP.

[17]  Michael Norrish.  Mechanised Computability Theory , 2011, ITP.

[18]  Jian Xu,et al.  Mechanising Turing Machines and Computability Theory in Isabelle/HOL , 2013, ITP.

[19]  Dominique Larchey-Wendling.  Constructive Decision via Redundancy-Free Proof-Search , 2018, IJCAR.

[20]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[21]  Christian Doczkal,et al.  Completeness and decidability of converse PDL in the constructive type theory of Coq , 2018, CPP.

[22]  Alberto Ciaffaglione,et al.  Towards Turing computability via coinduction , 2016, Sci. Comput. Program..

[23]  Gert Smolka,et al.  Completeness and Decidability of de Bruijn Substitution Algebra in Coq , 2015, CPP.

[24]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[25]  James P. Jones,et al.  Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets , 1984, J. Symb. Log..

[26]  Gert Smolka,et al.  Verification of PCP-Related Computational Reductions in Coq , 2018, ITP.

[27]  J. Girard,et al.  Advances in Linear Logic , 1995 .

[28]  Andrea Asperti,et al.  A formalization of multi-tape Turing machines , 2015, Theor. Comput. Sci..

[29]  Sylvain Schmitz,et al.  The complexity of reachability in vector addition systems , 2016, SIGL.

[30]  Adam Chlipala,et al.  A verified compiler for an impure functional language , 2010, POPL '10.

[31]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[32]  Gert Smolka,et al.  On synthetic undecidability in Coq, with an application to the Entscheidungsproblem , 2019, CPP.

[33]  Yannick Forster.  Towards a library of formalised undecidable problems in Coq: The undecidability of intuitionistic linear logic , 2018 .

[34]  Christian Doczkal,et al.  Completeness and Decidability Results for CTL in Constructive Type Theory , 2016, Journal of Automated Reasoning.

[35]  Neil D. Jones,et al.  Computability and complexity - from a programming perspective , 1997, Foundations of computing series.

[36]  Grégoire Sutre,et al.  Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One , 2017, ICALP.

[37]  Ramana Kumar,et al.  CakeML: a verified implementation of ML , 2014, POPL.

[38]  Dominique Larchey-Wendling,et al.  The Undecidability of Boolean BI through Phase Semantics , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[39]  Alan Schmitt,et al.  HOCore in Coq , 2015, ITP.

[40]  P. Lincoln.  Deciding provability of linear logic formulas , 1995 .