Skip to main content
SpringerLink
Log in

Expression Reduction Systems with Patterns

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We introduce a new higher-order rewriting formalism, called expression reduction systems with patterns (ERSP), where abstraction is allowed not only on variables but also on nested patterns with metavariables. These patterns are built by combining standard algebraic patterns with choice constructors denoting cases. In other words, the nondeterministic choice between different rewrite rules which is inherent to classical rewriting formalisms can be lifted here to the level of patterns. We show that confluence holds for a reasonable class of systems and terms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baader, F., Nipkow, T.: Term Rewriting and all that. Cambridge University Press (1998)

  2. Barendregt, H.: The lambda calculus: its syntax and semantics, vol. 103. Studies in Logic and the Foundations of Mathematics. North-Holland. Revised Edition (1984)

  3. Blanqui, F., Jouannaud, J.-P., Okada, M.: Inductive-data-type systems. Theoretical Comput. Sci. 277, 41–68 (2002)

    Article  MathSciNet  Google Scholar 

  4. Bonelli, E., Kesner, D., Ríos, A.: A de Bruijn notation for higher-order rewriting. In: L. Bachmair (ed.) 11th International Conference on Rewriting Techniques and Applications, vol. 1833 of Lecture Notes in Computer Science. pp. 62–79, Springer (2000)

  5. Cerrito, S., Kesner, D.: Pattern matching as cut elimination. In: Longo, G. (ed.) 14th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 98–108. IEEE Computer Society Press (1999)

  6. Cerrito, S., Kesner, D.: Pattern matching as cut elimination. Theoretical Comput. Sci. 323, 71–127 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cirstea, H., Kirchner, C.: ρ-Calculus, the rewriting calculus. In: 5th International Workshop on Constraints in Computational Logics (1998)

  8. Forest, J.: A weak calculus with explicit operators for pattern matching and substitution. In: Tison, S. (ed.) 13th International Conference on Rewriting Techniques and Applications, vol. 2378 of Lecture Notes in Computer Science. pp. 174–191, Springer (2002)

  9. Forest, J., Kesner, D.: Expression reduction systems with patterns. In: Nieuwenhuis, R. (ed.) 14th International Conference on Rewriting Techniques and Applications, vol. 2706 of Lecture Notes in Computer Science. pp. 107–122, Springer (2003)

  10. Goguen, J., Thatcher, J., Wagner, E.: An initial algebra approach to the specification, correctness and implementation of abstract data types. In: Current Trends in Programming Methodology, vol. 4. Prentice Hall, pp. 80–149 (1978)

  11. Huet, G., Oppen, D.: Equations and rewrite rules: a survey. In: Book, R.V. (ed.) Formal Language Theory: Perspectives and Open Problems. Academic, pp. 349–405 (1980)

  12. Jay, C.B., Kesner, D.: Pure pattern calculus. In: Sestoft, P. (ed.) Proceedings of the European Symposium on Programming (ESOP). LNCS, vol. 3924, pp. 100–114, Vienna, Austria, March–April 2006

  13. Jouannaud, J.-P., Rubio, A.: The higher-order recursive path ordering. In: Longo, G. (ed.) 14th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 402–411. IEEE Computer Society Press (1999)

  14. Kahl, W.: Basic pattern matching calculi: syntax, reduction, confluence, and normalisation. Technical Report 16, Software Quality Research Laboratory, McMaster University (2003)

  15. Kesner, D., Puel, L., Tannen, V.: A typed pattern calculus. Inf. Comput. 124(1), 32–61 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  16. Khasidashvili, Z.: Expression reduction systems. In: Proceedings of IN Vekua Institute of Applied Mathematics, vol. 36. Tbilisi (1990)

  17. Klop, J.-W.: Combinatory reduction systems, vol. 127 of Mathematical Centre Tracts. Amsterdam, Mathematisch Centrum. Ph.D. thesis (1980)

  18. Klop, J.-W.: Term rewriting systems, vol. 2. Oxford University Press (1992)

  19. Klop, J.-W., van Oostrom, V., van Raamsdonk, F.: Combinatory reduction systems: introduction and survey. Theoretical Computer Science 121, 279–308 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  20. Nipkow, T.: Higher-order critical pairs. In: 6th Annual IEEE Symposium on Logic in Computer Science (LICS). pp. 342–349 (1991)

  21. Takahashi, M.: Parallel reductions in Lambda-Calculus. J. Symbolic Comput. 2(7), 113–123 (1989)

    Article  Google Scholar 

  22. van Oostrom, V.: Lambda calculus with patterns. Technical Report IR-228, Vrije Universiteit, Amsterdam (1990)

  23. van Oostrom, V., van Raamsdonk, F.: Weak orthogonality implies confluence: the higher-order case. In: Nerode, A., Matiyasevich, Y. (eds.) Proceedings of the 3rd International Symposium on Logical Foundations of Computer Science, vol. 813 of Lecture Notes in Computer Science. pp. 379–392, Springer-Verlag (1994)

  24. van Raamsdonk, F.: On termination of higher-order rewriting. In: Middeldorp, A. (ed.) 12th International Conference on Rewriting Techniques and Applications, vol. 2051 of Lecture Notes in Computer Science. pp. 261–275, Springer (2001)

  25. Wolfram, D.: The Clausal Theory of Types, vol. 21 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (1993)

Download references

Author information

Authors and Affiliations

  1. INRIA Sophia-Antipolis, Sophia-Antipolis, France

    Julien Forest

  2. PPS (CNRS UMR 7126), Université Paris 7, Paris, France

    Delia Kesner

Authors
  1. Julien Forest
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Delia Kesner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julien Forest.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Forest, J., Kesner, D. Expression Reduction Systems with Patterns. J Autom Reasoning 39, 513–541 (2007). https://doi.org/10.1007/s10817-007-9083-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-007-9083-0

Keywords

Search

Navigation