Relative normalization in orthogonal expression reduction systems

  • John Glauert
  • Zurab Khasidashvili
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 968)


We study reductions in orthogonal (left-linear and non-ambiguous) Expression Reduction Systems, a formalism for Term Rewriting Systems with bound variables and substitutions. To generalise the normalization theory of Huet and Lévy, we introduce the notion of neededness with respect to a set of reductions π or a set of terms \(\mathcal{S}\) so that each existing notion of neededness can be given by specifying π or \(\mathcal{S}\). We imposed natural conditions on \(\mathcal{S}\), called stability, that are sufficient and necessary for each term not in \(\mathcal{S}\)-normal form (i.e., not in \(\mathcal{S}\)) to have at least one \(\mathcal{S}\)-needed redex, and repeated contraction of \(\mathcal{S}\)-needed redexes in a term t to lead to an \(\mathcal{S}\)-normal form of t whenever there is one. Our relative neededness notion is based on tracing (open) components, which are occurrences of contexts not containing any bound variable, rather than tracing redexes or subterms.


Normal Form Parallel Move Lambda Calculus Free Occurrence Normalization Theorem 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Acz78]
    Aczel P. A general Church-Rosser theorem. Preprint, University of Manchester, 1978.Google Scholar
  2. [AEH94]
    Antoy S., Echahed R., Hanus M. A needed narrowing strategy. In: Proc. of the 21st ACM Symposium on Principles of Programming Languages, POPL'94, Portland, Oregon, 1994.Google Scholar
  3. [AsLa93]
    Asperti A., Laneve C. Interaction Systems I: The theory of optimal reductions. Mathematical Structures in Computer Science, vol. 11, Cambridge University Press, 1993, p. 1–48.Google Scholar
  4. [Bar84]
    Barendregt H. P. The Lambda Calculus, its Syntax and Semantics. North-Holland, 1984.Google Scholar
  5. [BKKS87]
    Barendregt H. P., Kennaway J. R., Klop J. W., Sleep M. R. Needed Reduction and spine strategies for the lambda calculus. Information and Computation, v. 75, no. 3, 1987, p. 191–231.CrossRefGoogle Scholar
  6. [DeJo90]
    Dershowitz N., Jouannaud J.-P. Rewrite Systems. In: J. van Leeuwen ed. Handbook of Theoretical Computer Science, Chapter 6, vol. B, 1990, p. 243–320.Google Scholar
  7. [Gar94]
    Gardner P. Discovering needed reductions using type theory. In: Proc. of the 2nd International Symposium on Theoretical Aspects of Computer Software, TACS'94, Springer LNCS, v. 789, M. Hagiya, J. C. Mitchell, eds. Sendai, 1994, p. 555–574.Google Scholar
  8. [HuLé91]
    Huet G., Lévy J.-J. Computations in Orthogonal Rewriting Systems. In: Computational Logic, Essays in Honor of Alan Robinson, J.-L. Lassez and G. Plotkin, eds. MIT Press, 1991.Google Scholar
  9. [Ken94]
    Kennaway J. R. A conflict between call-by-need computation and parallelism. Workshop on conditional (and typed) term rewriting systems, Jerusalem, 1994.Google Scholar
  10. [KeSl89]
    Kennaway J. R., Sleep M. R. Neededness is hypernormalizing in regular combinatory reduction systems. Preprint, School of Information Systems, University of East Anglia, Norwich, 1989.Google Scholar
  11. [Kha88]
    Khasidashvili Z. Β-reductions and Β-developments of λ-terms with the least number of steps. In: Proc. of the International Conference on Computer Logic COLOG'88, Tallinn 1988, Springer LNCS, v. 417, P. Martin-Löf and G. Mints, eds. 1990, p. 105–111.Google Scholar
  12. [Kha90]
    Khasidashvili Z. Expression Reduction Systems. Proceedings of I. Vekua Institute of Applied Mathematics of Tbilisi State University, vol. 36, 1990, p. 200–220.Google Scholar
  13. [Kha92]
    Khasidashvili Z. The Church-Rosser theorem in Orthogonal Combinatory Reduction Systems. Report 1825, INRIA Rocquencourt, 1992.Google Scholar
  14. [Kha93]
    Khasidashvili Z. Optimal normalization in orthogonal term rewriting systems. In: Proc. of the 5th International Conference on Rewriting Techniques and Applications, RTA'93, Springer LNCS, vol. 690, C. Kirchner, ed. Montreal, 1993, p. 243–258.Google Scholar
  15. [Kha94]
    Khasidashvili Z. On higher order recursive program schemes. In: Proc. of the 19th International Colloquium on Trees in Algebra and Programming, CAAP'94, Springer LNCS, vol. 787, S. Tison, ed. Edinburgh, 1994, p. 172–186.Google Scholar
  16. [Klo80O]
    Klop J. W. Combinatory Reduction Systems. Mathematical Centre Tracts n. 127, CWI, Amsterdam, 1980.Google Scholar
  17. [Klo92]
    Klop J. W. Term Rewriting Systems. In: S. Abramsky, D. Gabbay, and T. Maibaum eds. Handbook of Logic in Computer Science, vol. II, Oxford University Press, 1992, p. 1–116.Google Scholar
  18. [KOR93]
    Klop J. W., van Oostrom V., van Raamsdonk F. Combinatory reduction systems: introduction and survey. In: To Corrado Böhm, J. of Theoretical Computer Science 121, 1993, p. 279–308.CrossRefGoogle Scholar
  19. [Lév78]
    Lévy J.-J. Réductions correctes et optimales dans le lambda-calcul, Thèse de l'Université de Paris VII, 1978.Google Scholar
  20. [Lév80]
    Lévy J.-J. Optimal reductions in the Lambda-calculus. In: To H. B. Curry: Essays on Combinatory Logic, Lambda-calculus and Formalism, Hindley J. R., Seldin J. P. eds, Academic Press, 1980, p. 159–192.Google Scholar
  21. [Mar92]
    Maranget L. La stratégie paresseuse. Thèse de l'Université de Paris VII, 1992.Google Scholar
  22. [Nip93]
    Nipkow T. Orthogonal higher-order rewrite systems are confluent. In: Proc. of the 1st International Conference on Typed Lambda Calculus and Applications, TLCA'93, Springer LNCS, vol. 664, Bazem M., Groote J.F., eds. Utrecht, 1993, p. 306–317.Google Scholar
  23. [Nök94]
    Nöcker E. Efficient Functional Programming. Compilation and Programming Techniques. Ph. D. Thesis, Katholic University of Nijmegen, 1994.Google Scholar
  24. [Oos94]
    Van Oostrom V. Confluence for Abstract and Higher-Order Rewriting. Ph. D. Thesis, Free University of Amsterdam, 1994.Google Scholar
  25. [OR94]
    Van Oostrom V., van Raamsdonk F. Weak orthogonality implies confluence: the higher-order case. In: Proc. of the 3rd International Conference on Logical Foundations of Computer Science, ‘Logic at St. Petersburg', LFCS'94, Springer LNCS, vol. 813, Narode A., Matiyasevich Yu. V. eds. St. Petersburg, 1994. p. 379–392.Google Scholar
  26. [Pkh77]
    Pkhakadze Sh. Some problems of the Notation Theory (in Russian). Proceedings of I. Vekua Institute of Applied Mathematics of Tbilisi State University, Tbilisi, 1977.Google Scholar
  27. [Wol93]
    Wolfram D.A. The Clausal Theory of Types. Cambridge Tracts in Theoretical Computer Science, vol. 21, Cambridge University Press, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • John Glauert
    • 1
  • Zurab Khasidashvili
    • 1
  1. 1.School of Information SystemsUEANorwichEngland

Personalised recommendations