Advertisement

Reduction Under Substitution

  • Jörg Endrullis
  • Roel de Vrijer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5117)

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.

Keywords

Normal Form Reduction Rule Combinatory Logic Bottom Element Strong Normalization 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bar72]
    Barendregt, H.P.: Non-definability of δ (unpublished manuscript)(1972)Google Scholar
  2. [Bar74]
    Barendregt, H.P.: Pairing without conventional restraints. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 20, 289–306 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  3. [Bar84]
    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)zbMATHGoogle Scholar
  4. [Ber78]
    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)Google Scholar
  5. [Ber79]
    Berry, G.: Modèles complètement adéquats et stables des λ-calculs typés. PhD thesis, Université de Paris 7 (1979)Google Scholar
  6. [BKOV99]
    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)Google Scholar
  7. [BKV00]
    Bethke, I., Klop, J.W., de Vrijer, R.C.: Descendants and origins in term rewriting. Information and Computation 159, 59–124 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  8. [BS99]
    Barendregt, H.P., Statman, R.: Applications of Plotkin-terms: partitions and morphisms for closed terms. J. Funct. Prog. 9, 565–575 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  9. [Daa80]
    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)Google Scholar
  10. [GK94]
    Glauert, J.R.W., Khasidashvili, Z.: Relative normalization in orthogonal expression reduction systems. In: Conditional Term Rewriting Systems, pp. 144–165 (1994)Google Scholar
  11. [Lév75]
    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)CrossRefGoogle Scholar
  12. [Mel97]
    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)CrossRefGoogle Scholar
  13. [Mel98]
    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)Google Scholar
  14. [NGV94]
    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)zbMATHGoogle Scholar
  15. [Oos97]
    van Oostrom, V.: Finite family developments. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 308–322. Springer, Heidelberg (1997)Google Scholar
  16. [Ter03]
    Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)Google Scholar
  17. [Vri87]
    de Vrijer, R.C.: Surjective Pairing and Strong Normalization: Two Themes in Lambda Calculus. PhD thesis, Universiteit van Amsterdam (January 1987)Google Scholar
  18. [Vri07]
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jörg Endrullis
    • 1
  • Roel de Vrijer
    • 1
  1. 1.VU Vrije Universiteit Amsterdam 

Personalised recommendations