Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-28T15:13:59.997Z Has data issue: false hasContentIssue false
  • English
  • Français

The virtues of eta-expansion

Part of: JFP Research Articles

Published online by Cambridge University Press:  07 November 2008

C. Barry Jay  and
Neil Ghani
C. Barry Jay
Affiliation:
School of Computing Sciences, University of Technology, Sydney PO Box 123, Broadway 2007Australia (e-mail: [email protected])
Neil Ghani
Affiliation:
LFCS, Department of Computer Science, University of EdinburghThe King's Buildings, Mayfield Road Edinburgh EH9 3JZ, UK (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Interpreting η-conversion as an expansion rule in the simply-typed λ-calculus maintains the confluence of reduction in a richer type structure. This use of expansions is supported by categorical models of reduction, where β-contraction, as the local counit, and η-expansion, as the local unit, are linked by local triangle laws. The latter form reduction loops, but strong normalization (to the long βη-normal forms) can be recovered by ‘cutting’ the loops.

Type
Articles
Information
Journal of Functional Programming , Volume 5 , Issue 2 , April 1995 , pp. 135 - 154
Copyright
Copyright © Cambridge University Press 1995

References

Akama, Y. (1993) On Mints' Reduction for ccc-Calculus. Lecture Notes in Computer Science Vol. 664. Springer-Verlag, pp. 1–12.Google Scholar
Barendregt, H. P. (1984) The Lambda Calculus Its Syntax and Semantics (Revised Ed.). Studies in Logic and the Foundations of Mathematics 103. North Holland.Google Scholar
Carboni, A., Kelly, G. M. and Wood, R. (1990) A 2-categorical approach to change of base and geometric morphisms I. Sydney Category Seminar Reports 90-1.Google Scholar
Čubrić, D. Embedding of a free CCC into the category of Sets, unpublished manuscript.Google Scholar
Curien, P.-L. and Di Cosmo, R. (1991) A confluent reduction for the λ-calculus with surjective pairing and terminal object. In: Proc. ICALP: Lecture Notes in Computer Science Vol. 510. Springer-Verlag, pp. 291–302. (Also Tech. Rep. LIENS–91-11.)Google Scholar
Di Cosmo, R. and Kesner, D. (1993) A confluent reduction for the extensional typed λ-calculus. In: Proc. ICALP: Lecture Notes in Computer Science Vol. 700. Springer-Verlag.Google Scholar
D., Dougherty D. (1993) Some λ-calculi with categorical sums and products. In: Rewriting Techniques and Applications: Lecture Notes in Computer Science Vol. 690. Springer-Verlag, pp. 137–151.Google Scholar
Girard, J.-Y., Taylor, P. and Lafont, Y. (1989) Proofs and Types. Cambridge University Press.Google Scholar
J.W. Gray J. W., (1974) Formal category theory: Adjointness for 2-categories: Lecture Notes in Mathematics Vol. 391. Springer-Verlag.Google Scholar
Harper, R., Honsell, F. and Plotkin, G. (1991) A framework for defining logics. Tech. Rep. LFCS-91-162.Google Scholar
Hilken, B. P. and Rydeheard, D. E. (1994) Towards a categorical semantics of type classes. Fundamenta Informatica (to appear).Google Scholar
Hoare, C. A. R., Jifeng, H. and Martin, C. E. (1989) Pre-adjunctions in Order Enriched Categories. Oxford University Computing Laboratory.Google Scholar
Huet, G. (1976) Résolution d'équations dans des langages d'ordre 1,2,…,ω. Thèse d'Etat, Université de Paris VII.Google Scholar
Jay, C. B. (1988) Local adjunctions. J. Pure Appl. Alg. 53: 227–238.CrossRefGoogle Scholar
Jay, C. B. (1990) Extending properties to categories of partial maps. Tech. Rep. LFCS-90-107.Google Scholar
Jay, C. B. (1991) Partial functions, ordered categories, limits and cartesian closure. In: G., Birtwistle (ed), IV Higher Order Workshop, Banff, 1990, Workshops in Computing. Springer-Verlag, pp. 151–161.CrossRefGoogle Scholar
Jay, C. B. (1992) Modelling reduction in confluent categories. In: M., Fourman et al. (ed.), Proc. Durham Symposium on Applications of Categories in Computer Science, Workshops in Computing, vol. 177. London Mathematics Society, pp. 143–162.CrossRefGoogle Scholar
Jay, C. B. (1991) Long βη Normal Forms and Confluence. Tech. Rep. LFCS-91-183 (and its revised version).Google Scholar
Kahrs, S. (1991) λ-rewriting. PhD thesis, Universität Bremen (in German).Google Scholar
Kasangian, S., Kelly, G. M. and Rossi, F. (1983) Cofibrations and the realization of non deterministic automata. Cahiers de Topologie et Géometrie Différentielle 24: 23–46.Google Scholar
Lambek, J. and Scott, P. (1986) Introduction to higher order categorical logic. Cambridge University Press.Google Scholar
Mints, G. E. (1979) Teorija categorii i teoria dokazatelstv.I., in: Aktualnye problemy logiki i metodologii nauky, Kiev, pp. 252–278.Google Scholar
Prawitz, D. (1971) Ideas and results in proof theory. In: J. E., Fenstad (ed.), Proc. 2nd Scandinavian Logic Symposium, pp. 235–307. North-Holland.CrossRefGoogle Scholar
Rydeheard, D. E. and Stell, J. G. (1987) 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 Vol. 283. Springer-Verlag, pp. 114–139.CrossRefGoogle Scholar
Seely, R. A. G. (1987) Modelling computations: a 2-categorical framework. In: Proc. Second Annual Symposium on Logic in Computer Science. IEEE.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.