Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs

ABSTRACT

Given that (co)inductive types are naturally modelled as fixed points, it is unsurprising that fixed-point logics are of interest in the study of programming languages, via the Curry-Howard (or proofs-as-programs) correspondence. This motivates investigations of the structural proof-theory of fixed-point logics and of their cut-elimination procedures.

Among the various approaches to proofs in fixed-point logics, circular – or cyclic – proofs, are of interest in this regard but suffer from a number of limitations, most notably from a quite restricted use of cuts. Indeed, the validity condition which ensures soundness of non-wellfounded derivations and productivity of their cut-elimination prevents some computationally-relevant patterns of cuts. As a result, traditional circular proofs cannot serve as a basis for a theory of (co)recursive programming by lack of compositionality: there are not enough circular proofs and they compose badly.

The present paper addresses some of these limitations by developing the circular and non-wellfounded proof-theory of multiplicative additive linear logic with fixed points () beyond the scope of the seminal works of Santocanale and Fortier and of Baelde et al. We define bouncing-validity: a new, generalized, validity criterion for , which takes axioms and cuts into account. We show soundness and cut elimination theorems for bouncing-valid non-wellfounded proofs: as a result, even though bouncing-validity proves the same sequents (or judgments) as before, we have many more valid proofs at our disposal. We illustrate the computational relevance of bouncing-validity on a number of examples. Finally, we study the decidability of the criterion in the circular case: we prove that it is undecidable in general but identify a hierarchy of decidable sub-criteria.

References

1. Andreas Abel. 2007. Mixed inductive/coinductive types and strong normalization. In Asian Symposium on Programming Languages and Systems. Springer, 286–301.
2. Andreas Abel. 2016. Compositional Coinduction with Sized Types. (2016). Abstract for the invited talk at the 13th IFIP WG 1.3 International Workshop on Coalgebraic Methods in Computer Science (CMCS 2016), Eindhoven, the Netherlands, 2-3 April 2016.
3. Andreas Abel and Brigitte Pientka. 2016. Well-founded recursion with copatterns and sized types. Journal of Functional Programming 26 (2016), 61. https://doi.org/10.1017/S0956796816000022 ICFP 2013 special issue.
4. Andreas Abel, Brigitte Pientka, David Thibodeau, and Anton Setzer. 2013. Copatterns: programming infinite structures by observations. In The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’13, Rome, Italy - January 23 - 25, 2013, Roberto Giacobazzi and Radhia Cousot (Eds.). ACM, 27–38. https://doi.org/10.1145/2429069.2429075
5. David Baelde. 2012. Least and greatest fixed points in linear logic. ACM Transactions on Computational Logic (TOCL) 13, 1 (2012), 2.
6. David Baelde, Amina Doumane, Denis Kuperberg, and Alexis Saurin. 2022. Bouncing Threads for Circular and Non-wellfounded Proofs (extended version). (June 2022). long version of the present paper, available at https://hal.archives-ouvertes.fr/hal-03682126.
7. David Baelde, Amina Doumane, and Alexis Saurin. 2015. Least and Greatest Fixed Points in Ludics. In 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany(LIPIcs), Stephan Kreutzer (Ed.). Vol. 41. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 549–566. https://doi.org/10.4230/LIPIcs.CSL.2015.549
8. David Baelde, Amina Doumane, and Alexis Saurin. 2016. Infinitary Proof Theory: the Multiplicative Additive Case. In 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France(LIPIcs), Vol. 62. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 42:1–42:17. http://www.dagstuhl.de/dagpub/978-3-95977-022-4
9. C. H. Bennett. 1973. Logical Reversibility of Computation. IBM J. Res. Dev. 17, 6 (Nov. 1973), 525–532.
10. Yves Bertot and Pierre Castéran. 2004. Interactive Theorem Proving and Program Development - Coq’Art: The Calculus of Inductive Constructions. Springer. https://doi.org/10.1007/978-3-662-07964-5
11. James Brotherston and Nikos Gorogiannis. 2014. Cyclic Abduction of Inductively Defined Safety and Termination Preconditions. In Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings(Lecture Notes in Computer Science), Markus Müller-Olmand Helmut Seidl (Eds.). Vol. 8723. Springer, 68–84. https://doi.org/10.1007/978-3-319-10936-7_5
12. James Brotherston and Alex Simpson. 2011. Sequent calculi for induction and infinite descent. Journal of Logic and Computation 21, 6 (Dec. 2011), 1177–1216.
13. Andrew Cave, Francisco Ferreira, Prakash Panangaden, and Brigitte Pientka. 2014. Fair Reactive Programming. In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages(POPL ’14). ACM, New York, NY, USA, 361–372. https://doi.org/10.1145/2535838.2535881
14. Christian Dax, Martin Hofmann, and Martin Lange. 2006. A Proof System for the Linear Time μ-Calculus. In FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings. 273–284. https://doi.org/10.1007/11944836_26
15. Abhishek De, Luc Pellissier, and Alexis Saurin. 2021. Canonical proof-objects for coinductive programming: infinets with infinitely many cuts. In PPDP. ACM, 7:1–7:15.
16. Abhishek De and Alexis Saurin. 2019. Infinets: the parallel syntax for non-wellfounded proof-theory. In Automated Reasoning with Analytic Tableaux and Related Methods – TABLEAUX 2019(Lecture Notes in Computer Science), Serenella Cerrito and Andrei Popescu (Eds.). Vol. 11714. Springer, 297–316. https://doi.org/10.1007/3-540-44904-3_18
17. Amina Doumane. 2017. On the infinitary proof theory of logics with fixed points. (Théorie de la démonstration infinitaire pour les logiques à points fixes). Ph.D. Dissertation. Paris Diderot University, France. https://tel.archives-ouvertes.fr/tel-01676953
18. Amina Doumane, David Baelde, Lucca Hirschi, and Alexis Saurin. 2016. Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’16, New York, NY, USA, July 5-8, 2016, Martin Grohe, Eric Koskinen, and Natarajan Shankar (Eds.). ACM, 377–386. https://doi.org/10.1145/2933575.2933598
19. Jérôme Fortier and Luigi Santocanale. 2013. Cuts for circular proofs: semantics and cut-elimination. In Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy(LIPIcs), Simona Ronchi Della Rocca (Ed.). Vol. 23. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 248–262.
20. Eduardo Giménez. 1998. Structural Recursive Definitions in Type Theory. In Proceedings 25th Int. Coll. on Automata, Languages and Programming, ICALP’98, Aalborg, Denmark, 13–17 July 1998, K. G. Larsen, S. Skyum, and G. Winskel (Eds.). LNCS, Vol. 1443. Springer-Verlag, Berlin, 397–408.
21. Jean-Yves Girard. 1987. Linear Logic. Theoretical Computer Science 50 (1987), 1–102. https://doi.org/10.1016/0304-3975(87)90045-4
22. Jean-Yves Girard. 1989. Towards a Geometry of Interaction. In Categories in Computer Science and Logic(Contemporary Mathematics). AMS, 69–108.
23. Jean-Yves Girard. 2001. Locus Solum: From the rules of logic to the logic of rules. Mathematical Structures in Computer Science 11, 3 (2001), 301–506.
24. Dominic J. D. Hughes and Rob J. van Glabbeek. 2005. Proof nets for unit-free multiplicative-additive linear logic. ACM Trans. Comput. Log. 6, 4 (2005), 784–842. https://doi.org/10.1145/1094622.1094629
25. Pierre Hyvernat. 2014. The Size-Change Termination Principle for Constructor Based Languages. Logical Methods in Computer Science 10, 1 (2014). https://doi.org/10.2168/LMCS-10(1:11)2014
26. David Janin and Igor Walukiewicz. 1995. Automata for the Modal mu-Calculus and related Results. In Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS’95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings(Lecture Notes in Computer Science), Jirí Wiedermann and Petr Hájek (Eds.). Vol. 969. Springer, 552–562. https://doi.org/10.1007/3-540-60246-1_160
27. Roope Kaivola. 1995. Axiomatising Linear Time Mu-calculus. In CONCUR ’95: Concurrency Theory, 6th International Conference, Philadelphia, PA, USA, August 21-24, 1995, Proceedings. 423–437.
28. Dexter Kozen. 1983. Results on the Propositional mu-Calculus. Theoretical Computer Science 27 (1983), 333–354.
29. Ralph Matthes. 1998. Monotone Fixed-Point Types and Strong Normalization. In CSL, Georg Gottlob, Etienne Grandjean, and Katrin Seyr (Eds.). Lecture Notes in Computer Science, Vol. 1584. Berlin, 298–312.
30. N. P. Mendler. 1991. Inductive Types and Type Constraints in the Second Order Lambda Calculus. Annals of Pure and Applied Logic 51, 1 (1991), 159–172.
31. Marvin L. Minsky. 1961. Recursive Unsolvability of Post’s Problem of ”Tag” and other Topics in Theory of Turing Machines. Annals of Mathematics 74, 3 (1961), 437–455. http://www.jstor.org/stable/1970290
32. Grigori E Mints. 1978. Finite investigations of transfinite derivations. Journal of Soviet Mathematics 10, 4 (1978), 548–596.
33. Vaughan R Pratt. 1981. A decidable mu-calculus: Preliminary report. In Foundations of Computer Science, 1981. SFCS’81. 22nd Annual Symposium on. IEEE, 421–427.
34. Davide Sangiorgi. 2009. On the origins of bisimulation and coinduction. ACM Transactions on Programming Languages and Systems (TOPLAS) 31, 4(2009), 15.
35. Luigi Santocanale. 2002. μ-Bicomplete Categories and Parity Games. RAIRO Theor. Informatics Appl. 36, 2 (2002), 195–227. https://doi.org/10.1051/ita:2002010
36. Luigi Santocanale. 2002. A Calculus of Circular Proofs and Its Categorical Semantics. In Foundations of Software Science and Computation Structures(Lecture Notes in Computer Science), Mogens Nielsen and Uffe Engberg (Eds.). Vol. 2303. Springer, 357–371.
37. Luigi Santocanale. 2002. Free μ-lattices. Journal of Pure and Applied Algebra 168, 2–3 (March 2002), 227–264. https://doi.org/10.1016/S0022-4049(01)00098-6
38. Robert S. Streett and E. Allen Emerson. 1989. An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus. Information and Computation 81, 3 (1989), 249–264. https://doi.org/10.1016/0890-5401(89)90031-X
39. Kazushige Terui. 2011. Computational ludics. Theoretical Computer Science 412, 20 (2011), 2048–2071. https://doi.org/10.1016/j.tcs.2010.12.026
40. Igor Walukiewicz. 1993. On Completeness of the mu-calculus. In Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS ’93), Montreal, Canada, June 19-23, 1993. IEEE Computer Society, 136–146. https://doi.org/10.1109/LICS.1993.287593
41. Igor Walukiewicz. 1995. Completeness of Kozen’s Axiomatisation of the Propositional mu-Calculus. In LICS. IEEE Computer Society, 14–24.
42. Igor Walukiewicz. 2000. Completeness of Kozen’s Axiomatisation of the Propositional mu-Calculus. Information and Computation 157, 1-2 (2000), 142–182.