ARM abstract rewriting machine
Jasper F.T Kamperman, H. R. J. Walters · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1993
Rewriting Machine J.F.Th.Kamperman ([email protected]) H.R. Walters ([email protected]) CWI, P.O. Box 4079, 1009 AB Amsterdam, The Netherlands Abstract Term rewriting is frequently used as implementation technique for algebraic specifications. In this paper we present the abstract term rewriting machine (ARM), which has an extremely compact instruction set and imposes no restrictions on the implemented TRSs. Apart from standard conditional term rewriting, associative lists are supported. ARM code is translated to (ANSI) C; the resulting execution speeds are good (on a sun4, an average of 80000 rewriting steps per second and a maximum of 416000 r/s were measured). Several benchmarks are shown, and related work is discussed in depth. 1991 CR Categories: D.3.4 [Programming languages]: Processors -- Code generation, Compilers, Interpreters, Optimization, D.1.1 [Programming Techniques]: Applicative (Functional) Programming, D.1.6: Logic Programming. 1991 Mathematics Subject Classifica...