Skip to main content

Compiling conditional rewriting systems

  • Part 1 Research Articles
  • Conference paper
  • First Online:
Conditional Term Rewriting Systems (CTRS 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 308))

Included in the following conference series:

Abstract

Among the various theoretical and practical problems related to compilation of conditional rewriting systems, we will point out in this paper the problem of compiling pattern matching by an IF THEN ELSE decision tree. For this purpose, we develop a general formal framework which allows to solve a wide class of problems dealing with choices defined by rules. Thus, we get rid of the specific term pattern matching problem. We also develop other topics, in order to produce functional code for normalization, using a “by value” strategy.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.Bidoit, F.Capy, C.Choppy, N.Choquet, C.Gresse, S.Kaplan, F.Schlienger, F.Voisin: ASSPRO: un environement de programmation interactif et intégré, to appear in T.S.I.

    Google Scholar 

  2. L. Augustsson. Compiling pattern matching. In Functional Programming Languages and Computer Architecture, Nancy, LNCS 201, Springer-Verlag, September 1985

    Google Scholar 

  3. L.Cardelli. Compiling a functional language. In Proc. ACM Conf. Lisp and functional programming, Austin, Texas, August 1984.

    Google Scholar 

  4. H. Comon. Unification et disunification. Théorie et applications. Thèse d'université.

    Google Scholar 

  5. K. Futatsugi, J.A. Goguen, J.P. Jouannaud, J. Meseguer. Principles of OBJ2. In proc. ACM Symp. Principles of programming languages, 1985.

    Google Scholar 

  6. N. Dershowitz, J.P. Jouannaud. Term rewriting systems, Hand book of theoretical computer science. To appear.

    Google Scholar 

  7. S. Kaplan. A compiler for conditional term rewriting systems. In proc. Rewriting Techniques and applications 87, Bordeaux, May 1987.

    Google Scholar 

  8. D. Plaisted. Semantic confluence tests and completion methods. Information and Control 65, 1985.

    Google Scholar 

  9. Ph. Schnoebelen. The compilation of pattern-matching in functional languages. To appear

    Google Scholar 

Download references

Authors

Editor information

S. Kaplan J. -P. Jouannaud

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heuillard, T. (1988). Compiling conditional rewriting systems. In: Kaplan, S., Jouannaud, J.P. (eds) Conditional Term Rewriting Systems. CTRS 1987. Lecture Notes in Computer Science, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19242-5_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-19242-5_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19242-8

  • Online ISBN: 978-3-540-39166-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics