Hostname: page-component-8448b6f56d-tj2md Total loading time: 0 Render date: 2024-04-24T16:47:54.671Z Has data issue: false hasContentIssue false
  • English
  • Français

Refining reduction in the lambda calculus†

Part of: JFP Research Articles

Published online by Cambridge University Press:  07 November 2008

Fairouz Kamareddine  and
Rob Nederpelt
Fairouz Kamareddine
Affiliation:
Department of Computing Science, 17 Lilybank Gardens, University of Glasgow, Glasgow G12 8QQ, Scotland (e-mail: verb+fairouz@dcs.glasgow.ac.uk)
Rob Nederpelt
Affiliation:
Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands (e-mail: verb+wsinrpn@win.tue.nl)
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.

We introduce a λ-calculus notation which enables us to detect in a term, more β-redexes than in the usual notation. On this basis, we define an extended β-reduction which is yet a subrelation of conversion. The Church Rosser property holds for this extended reduction. Moreover, we show that we can transform generalised redexes into usual ones by a process called ‘term reshuffling’.

Type
Articles
Information
Journal of Functional Programming , Volume 5 , Issue 4 , October 1995 , pp. 637 - 651
Copyright
Copyright © Cambridge University Press 1995

References

Barendregt, H. P., Kennaway, J. R., Klop, J. W. and Sleep, M. R. (1987) Needed reduction and spine strategies for the λ-calculus. Information and Computation, 75(3):1191–231.CrossRefGoogle Scholar
de Bruijn, N. G. (1993) Algorithmic definition of lambda-typed lambda calculus. In: Huet, G. and Plotkin, G. (eds.), Logical Environments, pp. 131–146. Cambridge University Press.Google Scholar
Kamareddine, F. and Nederpelt, R. P. (1993) On stepwise explicit substitution. International Journal of Foundations of Computer Science. 4(3):197–240.CrossRefGoogle Scholar
Kamareddine, F. and Nederpelt, R. P. (1994) A unified approach to type theory through a refined λ-calculus. Theoretical Computer Science, 136:183–216.CrossRefGoogle Scholar
Kamareddine, F. and Nederpelt, R. P. (1995) The beauty of the λ-calculus. In preparation.Google Scholar
Nederpelt, R. P. (1973) Strong normalisation in a typed lambda calculus with lambda structured types. PhD thesis, Eindhoven University of Technology, Department of Mathematics and Computer Science. (Also in Nederpelt, R. P., Geuvers, J. H. and de Vrijer, R. C., eds. (1994) Selected Papers on Automath. North Holland.)CrossRefGoogle Scholar
Rittri, M. (1991) Using types as search keys in function libraries. Journal of Functional Programming, 1(1):71–90.CrossRefGoogle Scholar
Submit a response

Discussions

No Discussions have been published for this article.