Skip to main content
SpringerLink
Log in

On Mints' reduction for ccc-calculus

  • Conference paper
  • First Online:
Typed Lambda Calculi and Applications (TLCA 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 664))

Included in the following conference series:

Abstract

In this paper, we present a divide- and-conquer lemma to infer the SN+CR (Strongly Normalization and Church-Rosser) property of a reduction system from that property of its subsystems. Then we apply the lemma to show the property of Mints' reduction for ccc-calculus with restricted η-expansion and restricted π-expansion. In the course of the proof, we obtain some relations of the two restricted expansions against traditional reductions. Among others, we get a simple characterization of the restricted η-expansion in terms of traditional β- and η-reductions, and a similar characterization for the restricted π-expansion.

Supported by JSPS Fellowship for Japanese Junior Scientists

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. North Holland, second edition, 1984.

    Google Scholar 

  2. P.-L. Curien and R. Di Cosmo. A confluent reduction for the λ-calculus with surjective pairing and terminal object. In Proceedings ICALP '91, Madrid, pages 291–302. Springer-Verlag, 1991.

    Google Scholar 

  3. D.Čubrić. On free CCC. manuscript, March 12, 1992.

    Google Scholar 

  4. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Theoretical Computer Science. Cambridge University Press, 1989.

    Google Scholar 

  5. M. Hgiya. Personal communication, Aug. 1991.

    Google Scholar 

  6. M. agiya. From programming-by-example to proving-by-example. In T. Ito and A.R. Meyer, editors, Theoretical Aspects of Computer Software. Proceedings, pages 387–419. Springer-Verlag, 1991. Lecture Notes in Computer Science, 526.

    Google Scholar 

  7. G.P. Huet. A unification algorithm for typed lambda-calculus. Theoretical Computer Science, 1:27–57, 1975.

    Google Scholar 

  8. C. Barry Jay. Long βη normal forms and confluence(revised). LFCS, Department of Computer Science, University of Edinburgh, February 1992.

    Google Scholar 

  9. J. Lambek and P.J. Scott. Introduction to higher order categorical logic, volume 7 of Cambridge studies in advanced mathematics. Cambridge University Press, 1986.

    Google Scholar 

  10. G.E. Mints. Theory of categories and theory of proofs. i. In Urgent Questions of Logic and the Methodology of Science, 1979. [in Russian], Kiev.

    Google Scholar 

  11. D. Pawitz. Ideas and results in proof theory. In J.E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 235–307. North-Holland, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, Tokyo Institute of Technology, 152, Tokyo, Japan

    Yohji Akama

Authors
  1. Yohji Akama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marc Bezem Jan Friso Groote

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akama, Y. (1993). On Mints' reduction for ccc-calculus. In: Bezem, M., Groote, J.F. (eds) Typed Lambda Calculi and Applications. TLCA 1993. Lecture Notes in Computer Science, vol 664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037094

Download citation

  • DOI: https://doi.org/10.1007/BFb0037094

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56517-8

  • Online ISBN: 978-3-540-47586-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation