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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported by JSPS Fellowship for Japanese Junior Scientists
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H.P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. North Holland, second edition, 1984.
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.
D.Čubrić. On free CCC. manuscript, March 12, 1992.
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Theoretical Computer Science. Cambridge University Press, 1989.
M. Hgiya. Personal communication, Aug. 1991.
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.
G.P. Huet. A unification algorithm for typed lambda-calculus. Theoretical Computer Science, 1:27–57, 1975.
C. Barry Jay. Long βη normal forms and confluence(revised). LFCS, Department of Computer Science, University of Edinburgh, February 1992.
J. Lambek and P.J. Scott. Introduction to higher order categorical logic, volume 7 of Cambridge studies in advanced mathematics. Cambridge University Press, 1986.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights 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