A compiler for a class of conditional term rewriting systems
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.
Unable to display preview. Download preview PDF.
- [Bidoit, Choppy 85]M. Bidoit, C. Choppy: ASSPEGIQUE: An integrated environment for algebraic specifications. Proc. TAPSOFT 85 Conf., Springer LNCS 186, pp. 246–260 (1986)Google Scholar
- [Futatsugi et al. 85]K. Futatsugi, J. A. Goguen, J.-P. Jouannaud, J. Meseguer: Principles of OBJ2, Proc. 12th ACM POPL Symposium, New Orleans, Louisiana (1985)Google Scholar
- [Geser, Hussmann 86]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
- [Kaplan 87]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
- [Klaeren, Indermark 87]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
- [Wirsing et al. 83]