Hostname: page-component-77c89778f8-vpsfw Total loading time: 0 Render date: 2024-07-20T20:09:29.186Z Has data issue: false hasContentIssue false
  • English
  • Français

Z property for the shuffling calculus

Published online by Cambridge University Press:  10 January 2023

Koji Nakazawa Open the ORCID record for Koji Nakazawa [Opens in a new window] ,
Ken-etsu Fujita  and
Yuta Imagawa
Koji Nakazawa*
Affiliation:
Nagoya University, Nagoya, Japan
Ken-etsu Fujita
Affiliation:
Gunma University, Maebashi, Japan
Yuta Imagawa
Affiliation:
Mitsubishi UFJ Research and Consulting Co. Ltd., Tokyo, Japan
*
*Corresponding author. Email: knak@i.nagoya-u.ac.jp
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper gives a new proof of confluence for Carraro and Guerrieri’s call-by-value lambda calculus λ v σ with permutation rules. We adapt the compositional Z theorem to λ v σ .

Keywords

ConfluenceZ theoremcall-by-value lambda calculus
Type
Special Issue: Confluence
Information
Mathematical Structures in Computer Science , Volume 32 , Special Issue 7: Confluence , August 2022 , pp. 1015 - 1027
Check for updates
Copyright
© The Author(s), 2023. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Accattoli, B. and Guerrieri, G. (2016). Open call-by-value. In: Asian Symposium on Programming Languages and Systems (APLAS 2016), Lecture Notes in Computer Science, 10017, 206–226.CrossRefGoogle Scholar
Accattoli, B. and Kesner, D. (2012). The permutative λ-calculus. In: Proceedings of the International Conference on Logic Programming and Automated Reasoning (LPAR 2012), Lecture Notes in Computer Science, 7180, 15–22.CrossRefGoogle Scholar
Ando, Y. (2003). Church-Rosser property of a simple reduction for full first-order classical natural deduction. Annals of Pure and Applied Logic, 119, 225–237.CrossRefGoogle Scholar
Carraro, A. and Guerrieri, G. (2014). A semantical and operational account of call-by-value solvability. Foundations of Software Science and Computation Structures (FoSSaCS 2014), Lecture Notes in Computer Science, 8412, 103–118.CrossRefGoogle Scholar
Dehornoy, P. and van Oostrom, V. 2008. Z, proving confluence by monotonic single-step upperbound functions, Logical Models of Reasoning and Computation (LMRC-08) Google Scholar
Fujita, K. (2020). A formal system of reduction paths for parallel reduction. Theoretical Computer Science, 813 327–340. Google Scholar
Honda, Y., Nakazawa, K. and Fujita, K. (2021). Confluence proofs of lambda-mu-calculi by Z theorem. Studia Logica, 109, 917–936.CrossRefGoogle Scholar
Komori, Y., Matsuda, N. and Yamakawa, F. (2013). A simplified proof of the church-rosser theorem. Studia Logica, 102, 175–183.CrossRefGoogle Scholar
Nakazawa, K. and Fujita, K. (2016). Compositional Z: confluence proofs for permutative conversion. Studia Logica, 104, 1205–1224.CrossRefGoogle Scholar
Nakazawa, K., Fujita, K. and Imagawa, Y. (2017). Z for call-by-value. In: Proceedings of the 6th International Workshop on Confluence, pages 57–61.Google Scholar
Nakazawa, K. and Nagai, T. (2014). Reduction system for extensional lambda-mu calculus. In: 25th International Conference on Rewriting Techniques and Applications joint with the 12th International Conference on Typed Lambda Calculi and Applications (RTA-TLCA 2014), Lecture Notes in Computer Science, 8560, 349–363.CrossRefGoogle Scholar
Plotkin, G. (1975). Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1, 125–159.CrossRefGoogle Scholar
van Oostrom, V. (2021). Z; syntax-free developments. In: 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021), Leibniz International Proceedings in Informatics, 195, 24, 22.Google Scholar