Abstract
The Reduction-under-Substitution Lemma (RuS) , due to van Daalen [Daa80] , provides an answer to the following question concerning the lambda calculus: given a reduction \(M[{x}:={L}] \twoheadrightarrow N\), what can we say about the contribution of the substitution to the result N. It is related to a not very well-known lemma that was conjectured by Barendregt in the early 70’s, addressing the similar question as to the contribution of the argument M in a reduction \(FM \twoheadrightarrow N\). The origin of Barendregt’s Lemma lies in undefinablity proofs, whereas van Daalen’s interest came from its application to the so-called Square Brackets Lemma, which is used in proofs of strong normalization.
In this paper we compare various forms of RuS. We strengthen RuS to multiple substitution and context filling and show how it can be used to give short and perspicuous proofs of undefinability results. Most of these are known as consequences of Berry’s Sequentiality Theorem, but some fall outside its scope. We show that RuS can also be used to prove the sequentiality theorem itself. To that purpose we give a further adaptation of RuS, now also involving “bottom” reduction rules, sending unsolvable terms to a bottom element and in the limit producing Böhm trees.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barendregt, H.P.: Non-definability of δ (unpublished manuscript)(1972)
Barendregt, H.P.: Pairing without conventional restraints. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 20, 289–306 (1974)
Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics, 2nd revised edn. Studies in Logic and the Foundations of Mathematics, vol. 103. North-Holland, Amsterdam (1984)
Berry, G.: Séquentialité de l’évaluation formelle des λ-expressions. In: Robinet, B. (ed.) Program Transformations, Troisiéme Colloque International sur la Programmation, pp. 65–78. Dunod (1978)
Berry, G.: Modèles complètement adéquats et stables des λ-calculs typés. PhD thesis, Université de Paris 7 (1979)
Byun, S., Kennaway, J.R., van Oostrom, V., de Vries, F.-J.: Separability and translatability of sequential term rewrite systems into the lambda calculus (unpublished) (1999)
Bethke, I., Klop, J.W., de Vrijer, R.C.: Descendants and origins in term rewriting. Information and Computation 159, 59–124 (2000)
Barendregt, H.P., Statman, R.: Applications of Plotkin-terms: partitions and morphisms for closed terms. J. Funct. Prog. 9, 565–575 (1999)
van Daalen, D.T.: The Language Theory of Automath. PhD thesis, Technische Universiteit Eindhoven. Large parts of this thesis, including the treatment of RuS, have been reproduced. In: [NGdV94] (1980)
Glauert, J.R.W., Khasidashvili, Z.: Relative normalization in orthogonal expression reduction systems. In: Conditional Term Rewriting Systems, pp. 144–165 (1994)
Lévy, J.-J.: An algebraic interpretation of the λβ K-calculus and a labelled λ-calculus. In: Böhm, C. (ed.) Lambda-Calculus and Computer Science Theory. LNCS, vol. 37, pp. 147–165. Springer, Heidelberg (1975)
Melliès, P.-A.: Axiomatic rewriting theory III: A factorisation theorem in rewriting theory. In: Moggi, E., Rosolini, G. (eds.) CTCS 1997. LNCS, vol. 1290, pp. 46–68. Springer, Heidelberg (1997)
Melliès, P.-A.: Axiomatic rewriting theory IV: A stability theorem in rewriting theory. In: Proc. of the 14th Annual Symposium on Logic in Computer Science, LICS 1998, pp. 287–298. IEEE Computer Society Press, Los Alamitos (1998)
Nederpelt, R.P., Geuvers, J.H., de Vrijer, R.C.: Selected Papers on Automath. Studies in Logic and the Foundations of Mathematics, vol. 133. North-Holland, Amsterdam (1994)
van Oostrom, V.: Finite family developments. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 308–322. Springer, Heidelberg (1997)
Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)
de Vrijer, R.C.: Surjective Pairing and Strong Normalization: Two Themes in Lambda Calculus. PhD thesis, Universiteit van Amsterdam (January 1987)
de Vrijer, R.C.: Barendregt’s lemma. In: Barendsen, Geuvers, Capretta, Niqui (eds.) Reflections on Type Theory, Lambda Calculus, and the Mind, pp. 275–284. Radboud University Nijmegen (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Endrullis, J., de Vrijer, R. (2008). Reduction Under Substitution. In: Voronkov, A. (eds) Rewriting Techniques and Applications. RTA 2008. Lecture Notes in Computer Science, vol 5117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70590-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-70590-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70588-8
Online ISBN: 978-3-540-70590-1
eBook Packages: Computer ScienceComputer Science (R0)