Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

More Church-Rosser Proofs in BELUGA (2404.14921v1)

Published 23 Apr 2024 in cs.LO and cs.PL

Abstract: We report on yet another formalization of the Church-Rosser property in lambda-calculi, carried out with the proof environment Beluga. After the well-known proofs of confluence for beta-reduction in the untyped settings, with and without Takahashi's complete developments method, we concentrate on eta-reduction and obtain the result for beta-eta modularly. We further extend the analysis to typed-calculi, in particular System F. Finally, we investigate the idea of pursuing the encoding directly in Beluga's meta-logic, as well as the use of Beluga's logic programming engine to search for counterexamples.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. J. Funct. Program. 29, p. e19, 10.1017/S0956796819000170.
  2. Beniamino Accattoli (2012): Proof Pearl: Abella Formalization of λ𝜆\lambdaitalic_λ-Calculus Cube Property. In Chris Hawblitzel & Dale Miller, editors: Certified Programs and Proofs - Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings, Lecture Notes in Computer Science 7679, Springer, pp. 173–187, 10.1007/978-3-642-35308-6_15.
  3. J. Autom. Reason. 49(2), pp. 141–159, 10.1007/s10817-011-9219-0.
  4. Roberto Blanco, Dale Miller & Alberto Momigliano (2019): Property-Based Testing via Proof Reconstruction. In Ekaterina Komendantskaya, editor: Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, PPDP 2019, Porto, Portugal, October 7-9, 2019, ACM, pp. 5:1–5:13, 10.1145/3354166.3354170.
  5. Arthur Charguéraud: Locally nameless representation with cofinite quantification. https://www.chargueraud.org/softs/ln. Accessed: November 2023.
  6. Ernesto Copello, Nora Szasz & Álvaro Tasistro (2021): Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention. Math. Struct. Comput. Sci. 31(3), pp. 341–360, 10.1017/S0960129521000335.
  7. Amy P. Felty, Alberto Momigliano & Brigitte Pientka (2015): The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations - Part 2 - A Survey. J. Autom. Reason. 55(4), pp. 307–372, 10.1007/s10817-015-9327-3.
  8. Amy P. Felty, Alberto Momigliano & Brigitte Pientka (2018): Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions. Math. Struct. Comput. Sci. 28(9), pp. 1507–1540, 10.1017/S0960129517000093.
  9. Jonathan M. Ford & Ian A. Mason (2001): Operational Techniques in PVS - A Preliminary Evaluation. In Colin J. Fidge, editor: Computing: The Australasian Theory Symposium, CATS 2001, Gold Coast, Australia, January 29-30, 2001, Electronic Notes in Theoretical Computer Science 42, Elsevier, pp. 124–142, 10.1016/S1571-0661(04)80882-X.
  10. Gérard P. Huet (1994): Residual Theory in lambda-Calculus: A Formal Development. J. Funct. Program. 4(3), pp. 371–394, 10.1017/S0956796800001106.
  11. In Dale Miller, editor: 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK, LIPIcs 84, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 21:1–21:19, 10.4230/LIPIcs.FSCD.2017.21.
  12. Leonidas Lampropoulos & Benjamin C. Pierce (2023): QuickChick: Property-Based Testing in Coq. https://softwarefoundations.cis.upenn.edu/qc-current. Accessed: November 2023.
  13. Dan Licata (2008): Church-Rosser theorem for β𝛽\betaitalic_β-reduction via complete development in Twelf. http://twelf.org/wiki/Church-Rosser_via_complete_development. Accessed: November 2023.
  14. James McKinna & Robert Pollack (1993): Pure Type Systems Formalized. In Marc Bezem & Jan Friso Groote, editors: Typed Lambda Calculi and Applications, International Conference on Typed Lambda Calculi and Applications, TLCA ’93, Utrecht, The Netherlands, March 16-18, 1993, Proceedings, Lecture Notes in Computer Science 664, Springer, pp. 289–305, 10.1007/BFb0037113.
  15. Alberto Momigliano (2000): Elimination of Negation in a Logical Framework. In Peter Clote & Helmut Schwichtenberg, editors: Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings, Lecture Notes in Computer Science 1862, Springer, pp. 411–426, 10.1007/3-540-44622-2_28.
  16. Julian Nagele, Vincent van Oostrom & Christian Sternagel (2016): A Short Mechanized Proof of the Church-Rosser Theorem by the Z-property for the λ𝜆\lambdaitalic_λβ𝛽\betaitalic_β-calculus in Nominal Isabelle. CoRR abs/1609.03139. Available at http://arxiv.org/abs/1609.03139.
  17. Tobias Nipkow (2001): More Church-Rosser Proofs. J. Autom. Reason. 26(1), pp. 51–66, 10.1023/A:1006496715975.
  18. Frank Pfenning (1992): A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework. Technical Report, Carnegie Mellon University. Tech. Rep. CMU-CS-92-186.
  19. Brigitte Pientka: Adaptation to Beluga of Pfenning’s proof of the Church-Rosser theorem for β𝛽\betaitalic_β-reduction. https://github.com/Beluga-lang/Beluga/tree/master/examples/church-rosser. Accessed: November 2023.
  20. Brigitte Pientka & Andrew Cave (2015): Inductive Beluga: Programming Proofs. In Amy P. Felty & Aart Middeldorp, editors: Automated Deduction - CADE-25 - 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings, Lecture Notes in Computer Science 9195, Springer, pp. 272–281, 10.1007/978-3-319-21401-6_18.
  21. In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019, IEEE, pp. 1–13, 10.1109/LICS.2019.8785683.
  22. Barry K. Rosen (1973): Tree-Manipulating Systems and Church-Rosser Theorems. J. ACM 20(1), pp. 160–187, 10.1145/321738.321750.
  23. Steven Schäfer, Tobias Tebbi & Gert Smolka (2015): Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions. In Christian Urban & Xingyuan Zhang, editors: Interactive Theorem Proving - 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings, Lecture Notes in Computer Science 9236, Springer, pp. 359–374, 10.1007/978-3-319-22102-1_24.
  24. Peter Selinger (2013): Lecture notes on the lambda calculus. arXiv:https://arxiv.org/abs/0804.3434.
  25. Natarajan Shankar (1988): A mechanical proof of the Church-Rosser theorem. J. ACM 35(3), pp. 475–522, 10.1145/44483.44484.
  26. Masako Takahashi (1995): Parallel Reductions in lambda-Calculus. Inf. Comput. 118(1), pp. 120–127, 10.1006/inco.1995.1057.
  27. René Vestergaard & James Brotherston (2001): A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names. In Aart Middeldorp, editor: Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001, Proceedings, Lecture Notes in Computer Science 2051, Springer, pp. 306–321, 10.1007/3-540-45127-7_23.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now