Skip to main content
SpringerLink
Log in

A compiler for a class of conditional term 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

Conditional rewriting serves not only for specification but also for programming, provided that rewriting is done fast. For a sublanguage of conditional term rewriting systems, a compilation into machine code is possible. So from a purely algebraic specification prototypes may be generated which run sufficiently fast e.g. for a system demonstration to customers. This paper contains a general outline of such a compiler and first experiences gained with a prototype.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bidoit, C. Choppy: ASSPEGIQUE: An integrated environment for algebraic specifications. Proc. TAPSOFT 85 Conf., Springer LNCS 186, pp. 246–260 (1986)

    Google Scholar 

  2. K. Futatsugi, J. A. Goguen, J.-P. Jouannaud, J. Meseguer: Principles of OBJ2, Proc. 12th ACM POPL Symposium, New Orleans, Louisiana (1985)

    Google Scholar 

  3. A. Geser, H. Hussmann: Experiences with the RAP system — a specification interpreter combining term rewriting and resolution. In: B. Robinet, R. Wilhelm (eds.): ESOP 86 Conference Proceedings, Springer LNCS 213, pp. 339–350 (1986)

    Google Scholar 

  4. S. Kaplan: A compiler for conditional term rewriting systems. Report ESPRIT Project METEOR, task 11. Also in: RTA 87 Conference Proceesdings, Springer LNCS 256, pp. 24–41 (1987)

    Google Scholar 

  5. H. Klaeren, K. Indermark: A new technique for compiling recursive function definitions. To appear in: Proceedings of the METEOR workshop "Algebraic Methods: Theory, Tools and Applications," Passau 1987.

    Google Scholar 

  6. M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy: On hierarchies of abstract data types. Acta Informatica 20, 1–33 (1983)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik und Informatik, Universität Passau, Postfach 2540, D-8390, Passau

    Alfons Geser, Heinrich Hussmann & Andreas Mück

Authors
  1. Alfons Geser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heinrich Hussmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas Mück
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Geser, A., Hussmann, H., Mück, A. (1988). A compiler for a class of conditional term 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_7

Download citation

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

  • 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

Search

Navigation