skip to main content
10.1145/3414080.3414091acmotherconferencesArticle/Chapter ViewAbstractPublication PagesppdpConference Proceedingsconference-collections
research-article

Rewrites as Terms through Justification Logic

Published: 21 September 2020 Publication History

Abstract

Justification Logic is a refinement of modal logic where the modality is annotated with a reason s for “knowing” A and written . The expression s is a proof of A that may be encoded as a lambda calculus term of type A, according to the propositions-as-types interpretation. Our starting point is the observation that terms of type are reductions between lambda calculus terms. Reductions are usually encoded as rewrites essential tools in analyzing the reduction behavior of lambda calculus and term rewriting systems, such as when studying standardization, needed strategies, Lévy permutation equivalence, etc. We explore a new propositions-as-types interpretation for Justification Logic, based on the principle that terms of type are proof terms encoding reductions (with source s). Note that this provides a logical language to reason about rewrites.

References

[1]
Sergei Artemov. 1995. Operational Modal Logic. Technical Report MSI 95-29. Cornell University.
[2]
Sergei Artemov. 2001. Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7, 1 (2001), 1–36.
[3]
Sergei Artemov and Melvin Fitting. 2019. Justification Logic: Reasoning with Reasons. Cambridge University Press. https://books.google.com/books?id=MFy8vQEACAAJ
[4]
Sergei N. Artëmov. 2008. The Logic of Justification. Rev. Symb. Log. 1, 4 (2008), 477–513. https://doi.org/10.1017/S1755020308090060
[5]
Sergei N. Artëmov and Eduardo Bonelli. 2007. The Intensional Lambda Calculus. In Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings(Lecture Notes in Computer Science), Sergei N. Artëmov and Anil Nerode (Eds.), Vol. 4514. Springer, 12–25. https://doi.org/10.1007/978-3-540-72734-7_2
[6]
Henk P. Barendregt. 1993. Lambda Calculi with Types. Oxford University Press, Inc., USA, 117–309.
[7]
Francisco Bavera and Eduardo Bonelli. 2018. Justification logic and audited computation. J. Log. Comput. 28, 5 (2018), 909–934. https://doi.org/10.1093/logcom/exv037
[8]
Gavin M. Bierman and Valeria de Paiva. 2000. On an Intuitionistic Modal Logic. Studia Logica 65, 3 (2000), 383–416. https://doi.org/10.1023/A:1005291931660
[9]
Eduardo Bonelli and Federico Feller. 2012. Justification Logic as a foundation for certifying mobile computation. Ann. Pure Appl. Log. 163, 7 (2012), 935–950. https://doi.org/10.1016/j.apal.2011.09.007
[10]
Eduardo Bonelli and Gabriela Steren. 2014. Hypothetical Logic of Proofs. Logica Universalis 8, 1 (2014), 103–140. https://doi.org/10.1007/s11787-014-0098-0
[11]
Vladimir Brezhnev and Roman Kuznets. 2006. Making knowledge explicit: How hard it is. Theor. Comput. Sci. 357, 1-3 (2006), 23–34. https://doi.org/10.1016/j.tcs.2006.03.010
[12]
Sander Bruggink. 2003. Residuals in Higher-Order Rewriting. In Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings(Lecture Notes in Computer Science), Robert Nieuwenhuis (Ed.), Vol. 2706. Springer, 123–137. https://doi.org/10.1007/3-540-44881-0_10
[13]
Sander Bruggink. 2008. Equivalence of reductions in higher-order rewriting. Ph.D. Dissertation. Utrecht University. http://www.ti.inf.uni-due.de/publications/bruggink/thesis.pdf.
[14]
Rowan Davies and Frank Pfenning. 2001. A modal analysis of staged computation. J. ACM 48, 3 (2001), 555–604. https://doi.org/10.1145/382780.382785
[15]
Valeria de Paiva, Rajeev Goré, and Michael Mendler. 2004. Editorial. J. Log. Comput. 14, 4 (2004), 439–446. https://doi.org/10.1093/logcom/14.4.439
[16]
Melvin Fitting. 2019. What Are Justification Logics?Fundam. Inform. 165, 3-4 (2019), 193–203. https://doi.org/10.3233/FI-2019-1782
[17]
Barney P. Hilken. 1996. Towards a Proof Theory of Rewriting: The Simply Typed 2λ-Calculus. Theor. Comput. Sci. 170, 1-2 (1996), 407–444. https://doi.org/10.1016/S0304-3975(96)80713-4
[18]
G. Alex Kavvos. 2016. The Many Worlds of Modal λ-calculi: I. Curry-Howard for Necessity, Possibility and Time. arxiv:1605.08106 [cs.LO]
[19]
Roman Kuznets and Thomas Studer. 2019. Logics of Proofs and Justifications. College Publications. https://books.google.com/books?id=IgKVxAEACAAJ
[20]
Jean-Jacques Lévy. 1978. Réductions correctes et optimales dans le lambda-calcul. Ph.D. Dissertation. Paris 7. Thèse d’Etat.
[21]
Carlos Lombardi, Alejandro Ríos, and Roel de Vrijer. 2014. Proof Terms for Infinitary Rewriting. In Rewriting and Typed Lambda Calculi - Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings(Lecture Notes in Computer Science), Gilles Dowek (Ed.), Vol. 8560. Springer, 303–318. https://doi.org/10.1007/978-3-319-08918-8_21
[22]
Carlos Lombardi, Alejandro Ríos, and Roel de Vrijer. 2019. Projections for infinitary rewriting (extended version). Theor. Comput. Sci. 781(2019), 92–110. https://doi.org/10.1016/j.tcs.2019.02.017
[23]
José Meseguer. 1992. Conditioned Rewriting Logic as a United Model of Concurrency. Theor. Comput. Sci. 96, 1 (1992), 73–155. https://doi.org/10.1016/0304-3975(92)90182-F
[24]
Rob Nederpelt and Herman Geuvers. 2014. Type Theory and Formal Proof: An Introduction (1st ed.). Cambridge University Press, USA.
[25]
Frank Pfenning and Conal Elliott. 1988. Higher-Order Abstract Syntax. In Proceedings of the ACM SIGPLAN’88 Conference on Programming Language Design and Implementation (PLDI), Atlanta, Georgia, USA, June 22-24, 1988, Richard L. Wexelblat(Ed.). ACM, 199–208. https://doi.org/10.1145/53990.54010
[26]
Konstantinos Pouliasis. 2016. A Curry-Howard View of Basic Justification Logic. In Logic, Language, Information, and Computation - 23rd International Workshop, WoLLIC 2016, Puebla, Mexico, August 16-19th, 2016. Proceedings(Lecture Notes in Computer Science), Jouko A. Väänänen, Åsa Hirvonen, and Ruy J. G. B. de Queiroz (Eds.), Vol. 9803. Springer, 316–337. https://doi.org/10.1007/978-3-662-52921-8_20
[27]
Konstantinos Pouliasis. 2018. Relating Justification Logic Modality and Type Theory in Curry–Howard Fashion. Ph.D. Dissertation. The Graduate Center, City University of New York. https://academicworks.cuny.edu/cgi/viewcontent.cgi?article=3496&context=gc_etds.
[28]
Konstantinos Pouliasis and Giuseppe Primiero. 2014. J-Calc: A Typed Lambda Calculus for Intuitionistic Justification Logic. Electron. Notes Theor. Comput. Sci. 300 (2014), 71–87. https://doi.org/10.1016/j.entcs.2013.12.012
[29]
Gabriela Steren and Eduardo Bonelli. 2017. The first-order hypothetical logic of proofs. J. Log. Comput. 27, 4 (2017), 1023–1066. https://doi.org/10.1093/logcom/exv090
[30]
Terese. 2003. Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, Vol. 55. Cambridge University Press.
[31]
Vincent van Oostrom and Roel C. de Vrijer. 2002. Four equivalent equivalences of reductions. Electron. Notes Theor. Comput. Sci. 70, 6 (2002), 21–61. https://doi.org/10.1016/S1571-0661(04)80599-1

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
PPDP '20: Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming
September 2020
179 pages
ISBN:9781450388214
DOI:10.1145/3414080
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 September 2020

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Curry-Howard
  2. Lambda calculus
  3. modal logic
  4. term rewriting
  5. type systems

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

PPDP '20

Acceptance Rates

Overall Acceptance Rate 230 of 486 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 46
    Total Downloads
  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media