EPIC: An equational language Abstract machine and supporting tools

Walters, H. R. J.; Kamperman, Jasper F.T

doi:10.1007/3-540-61464-8_72

Cited by 2 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Term rewriting [42] is a model of computation used in various areas of computer science, including symbolic computation, automated theorem proving and execution of algebraic specifications. Abstract machines for term rewriting systems include the abstract rewriting machine ARM [72], µARM [129] and TRAM [99].…”

Section: Special-purpose Abstract Machinesmentioning

confidence: 99%

Abstract machines for programming language implementation

Diehl¹,

Hartel²,

Sestoft³

2000

Future Generation Computer Systems

View full text Add to dashboard Cite

We present an extensive, annotated bibliography of the abstract machines designed for each of the main programming paradigms (imperative, object oriented, functional, logic and concurrent). We conclude that whilst a large number of efficient abstract machines have been designed for particular language implementations, relatively little work has been done to design abstract machines in a systematic fashion.

show abstract

Section: Special-purpose Abstract Machinesmentioning

confidence: 99%

Abstract machines for programming language implementation

Diehl¹,

Hartel²,

Sestoft³

2000

Future Generation Computer Systems

View full text Add to dashboard Cite

show abstract

“…Kamperman and Walters apply simulation to transform a left-linear rewrite system into a form which is more suitable for compilation, as a first step in the implementation of their equational programming language EPIC [20,21]. Kamperman and Walters state, for example in the title of [8], that if a simulation is sound and complete and preserves termination, then it constitutes a correct transformation of rewrite systems.…”

Section: Introductionmentioning

confidence: 99%

Simulation as a correct transformation of rewrite systems

Fokkink

Pol

1997

Mathematical Foundations of Computer Science 1997

View full text Add to dashboard Cite

Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in the original rewrite system. In this paper it is shown that if such a simulation is sound and complete and preserves termination, then the transformation of the original into the simulating rewrite system constitutes a correct step in the compilation of the original rewrite system. That is, the normal forms of a term in the original rewrite system can then be obtained by computing the normal forms of a related term in the simulating rewrite system.

show abstract

EPIC: An equational language Abstract machine and supporting tools

Cited by 2 publications

References 3 publications

Abstract machines for programming language implementation

Abstract machines for programming language implementation

Simulation as a correct transformation of rewrite systems

Contact Info

Product

Resources

About