Skip to main content

Reduction Rules for Intuitionistic \({{\lambda}{\rho}}\)-calculus

Abstract

The third author gave a natural deduction style proof system called the \({{\lambda}{\rho}}\)-calculus for implicational fragment of classical logic in (Komori, Tsukuba J Math 37:307–320, 2013). In (Matsuda, Intuitionistic fragment of the \({{\lambda}{\mu}}\)-calculus, 2015, Post-proceedings of the RIMS Workshop “Proof Theory, Computability Theory and Related Issues”, to appear), the fourth author gave a natural subsystem “intuitionistic \({{\lambda}{\rho}}\)-calculus” of the \({{\lambda}{\rho}}\)-calculus, and showed the system corresponds to intuitionistic logic. The proof is given with tree sequent calculus (Kripke models), but is complicated. In this paper, we introduce some reduction rules for the \({{\lambda}{\rho}}\)-calculus, and give a simple and purely syntactical proof to the theorem by use of the reduction. In addition, we show that we can give a computation model with rich expressive power with our system.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    Andou, Y., A system of \({{\lambda}{\mu}}\)-calculus proper to the implicational fragment of classical natural deduction with one conclusion, in RIMS Kokyuroku 976, 1997.

  2. 2.

    Cirstea H. F., Germain K. C.: A \({{\rho}}\)-calculus of explicit constraint application, Electronic Notes in Theoretical Computer Science 117, 51–67 (2005)

    Article  Google Scholar 

  3. 3.

    Griffin, T. G., A formulae-as-type notion of control, in Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages 1989, 47–58.

  4. 4.

    Hindley, J. R., and J. P. Seldin, Lambda-Calculus and Combinators: An Introduction, Cambridge University Press, Cambridge, 2008.

  5. 5.

    Howard, W. A., The formulae-as-types notion of construction, in To H. B. Curry: Essays on Combinatory Logic, Lambda-Calculus, and Formalism 1980, 479–490.

  6. 6.

    Kobayashi S.: Monad as modality, Theoretical Computer Science 175, 29–74 (1997)

    Article  Google Scholar 

  7. 7.

    Komori Y., Matsuda N., Yamakawa F.: A Simplified Proof of the Church–Rosser Theorem, Studia Logica 102, 175–183 (2014)

    Article  Google Scholar 

  8. 8.

    Komori Y.: \({{\lambda}{\rho}}\)-calculus II, Tsukuba Journal of Mathematics 37, 307–320 (2013)

    Google Scholar 

  9. 9.

    Miyamoto, K., and A. Igarashi, A modal foundation for secure information flow, in Proceedings of the Workshop on Foundations of Computer Security 2004, 187–203.

  10. 10.

    Matsuda, N., Intuitionistic fragment of the \({{\lambda}{\mu}}\)-calculus, Technical Report, Tokyo Institute of Technology C-282, 2015.

  11. 11.

    Matsuda, N., Intuitionistic tree sequent calculus and intuitionistic lambda-rho-calculus, in Post-proceedings of the RIMS Workshop “Proof Theory, Computability Theory and Related Issues”, to appear.

  12. 12.

    Nakano, H., A \({{\rho}}\)-calculus of explicit constraint application, Logic, Language and Computation 61–72, 1994.

  13. 13.

    Nakano, H., The non-deterministic catch and throw mechanism and its subject reduction property, in Proceedings of Logic, Language and Computation 1992, 82–89.

  14. 14.

    Parigot, M., \({{\lambda}{\mu}}\)-calculus: an algorithmic interpretation of classical natural deduction, in Proceedings of Logic programming and automated reasoning 1992, 190–201.

  15. 15.

    Sørensen M. H., Urzyczyn P.: Lectures on the Curry–Howard Isomorphism, Elsevier, Amsterdam, (2006)

    Google Scholar 

  16. 16.

    Szabo, M. E., The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam, 1969.

  17. 17.

    Yamagata, Y., Strong normalization of second order symmetric lambda-mu calculus, Theoretical Aspects of Computer Software 459–467, 2001.

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Naosuke Matsuda.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Fujita, Ke., Kashima, R., Komori, Y. et al. Reduction Rules for Intuitionistic \({{\lambda}{\rho}}\)-calculus. Stud Logica 103, 1225–1244 (2015). https://doi.org/10.1007/s11225-015-9616-1

Download citation

Keywords

  • \({{\lambda}{\rho}}\)-calculus
  • Curry–Howard isomorphism
  • Intuitionistic logic
  • Proof theory