Abstract
Recently several researchers have investigated βη-equality for the simply typed λ-calculus with exponentials, products and unit types. In these works, η-conversion was interpreted as an expansion with syntactic restrictions imposed to prevent the expansion of introduction terms or terms which form the major premise of elimination rules. The resulting rewrite relation was shown confluent and strongly normalising to the long βη-normal forms. Thus reduction to normal form provides a decision procedure for βη-equality.
This paper extends these methods to sum types. Although this extension was originally thought to be straight forward, the proposed η-rule for the sum is substantially more complex than that for the exponent or product and contains features not present in the previous systems. Not only is there a facility for expanding terms of sum type analogous to that for product and exponential, but also the ability to permute the order in which different subterms of sum type are eliminated.
These different aspects of η-conversion for the sum type is reflected in our analysis. The rewrite relation is decomposed into two parts, a strongly normalising and confluent fragment resembling that found in the calculus without coproducts and a relation which generalises the ‘commuting conversions’ appearing in the literature. This second fragment is proved decidable by constructing for each term its (finite) set of quasi-normal forms and, by embedding the whole relation into this conversion relation, decidability, confluence and quasi-normal forms for the full relation are derived.
Preview
Unable to display preview. Download preview PDF.
References
Y. Akama, On Mints' Reduction for ccc-Calculus, in Typed Lambda Calculi and Applications, 1993.
H.P. Barendregt, The Lambda Calculus Its Syntax and Semantics (Revised Edition) Studies in Logic and the Foundations of Mathematics 103 (North Holland, 1984).
D. Čubrić, On Free CCC, manuscript.
N. Dershowitz, J.P. Jouannaud, Rewrite Systems, in The Handbook of Theoretical Computer Science, Elsevier, 1990.
R. Di Cosmo and D. Kesner, A confluent reduction for the extensional typed λ-calculus, in Proceedings ICALP '93
D. Dougherty, Some λ-calculi with categorical sums and products, in Rewriting Techniques and Applications LNCS 690, 137–151.
J-Y. Girard, P. Taylor and Y. Lafont, Proofs and Types, Cambridge Tracts in Theoretical Computer Science (Cambridge University Press, 1989).
J.W. Gray, Formal category theory: adjointness for 2-categories, Lecture Notes in Mathematics 391 (Springer-Verlag, 1974).
G. Huet, Résolution d'équations dans des langages d'ordre 1, 2, ⋯, ω. Thèse d'Etat, Université de Paris VII, 1976.
G. Huet, Abstract Properties and Applications of Term Rewriting Systems, in JACM, Vol. 27, No 4, pp. 797–821, 1980.
C.B. Jay, Local adjunctions, J. Pure and Appl. Alg. 53 (1988) 227–238.
C.B. Jay, Modelling reduction in confluent categories, in: Proceedings of the Durham Symposium on Applications of Categories in Computer Science, Lecture Note Series 177 (London Mathematics Society, 1992) 143–162.
C.B. Jay and N. Ghani, The Virtues of Eta-expansion, to appear in Journal of Functional Programming.
J. Lambek and P. Scott, Introduction to higher order categorical logic, Cambridge Studies in Advanced Mathematics 7 (Cambridge Univ. Press, 1986).
G.E. Mints, Teorija categorii i teoria dokazatelstv.I., in: Aktualnye problemy logiki i metodologii nauky, Kiev, 1979 252–278.
D. Prawitz, Ideas and results in proof theory, in: J.E. Fenstad (ed) Proc. 2nd Scandinavian Logic Symp. (North-Holland, 1971) 235–307.
D.E. Rydeheard & J.G. Stell, Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms, in: Pitt et al, (eds), Category Theory and Computer Science, Lecture Notes in Computer Science 283 (Springer, 1987) 114–139.
R.A.G. Seely, Modelling computations: a 2-categorical framework, in: Proceedings of the Second Annual Symposium on Logic in Computer Science (1987).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghani, N. (1995). βη-Equality for coproducts. In: Dezani-Ciancaglini, M., Plotkin, G. (eds) Typed Lambda Calculi and Applications. TLCA 1995. Lecture Notes in Computer Science, vol 902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014052
Download citation
DOI: https://doi.org/10.1007/BFb0014052
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59048-4
Online ISBN: 978-3-540-49178-1
eBook Packages: Springer Book Archive