On the correspondence between two classes of reduction systems
Information Processing Letters
Miranda: a non-strict functional language with polymorphic types
Proc. of a conference on Functional programming languages and computer architecture
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
Revised report on the algorithmic language scheme
ACM SIGPLAN Notices
The categorical abstract machine
Science of Computer Programming
The G-machine as a representation of stack semantics
Proc. of a conference on Functional programming languages and computer architecture
Algebraic specification
The Computer Journal - Special issue on Lazy functional programming
Non-strict languages-programming and implementation
The Computer Journal - Special issue on Lazy functional programming
The syntax definition formalism SDF—reference manual—
ACM SIGPLAN Notices
Term-rewriting systems with rule priorities
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
The definition of Standard ML
Introduction to algorithms
Efficient implementation of an algebraic specification language
Algebraic methods: theory, tools and applications
The spineless tagless G-machine
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Compilation of functional languages by program transformation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of theoretical computer science (vol. B)
Implementing functional languages
Implementing functional languages
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Handbook of logic in computer science (vol. 2)
Journal of the ACM (JACM)
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Communications of the ACM
The next 700 programming languages
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Efficient compilation of lazy evaluation
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
A Metalanguage for interactive proof in LCF
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Advice on structuring compilers and proving them correct
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Language Prototyping: An Algebraic Specification Approach: Vol. V
Language Prototyping: An Algebraic Specification Approach: Vol. V
Simulation as a Correct Transformation of Rewrite Systems
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Minimal Term Rewriting Systems
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Transformation Development: TrafoLa-H Subsystem
Program Development by Specification and Transformation, The PROSPECTRA Methodology, Language Family, and System
Towards a Provably Correct Compiler for OBJ3
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Lazy Rewriting and Eager Machinery
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
EPIC: An Equational Language -Abstract Machine Supporting Tools-
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
A Term Pattern-Match Compiler Inspired by Finite Automata Theory
CC '92 Proceedings of the 4th International Conference on Compiler Construction
Compiling a functional language
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Epic and ARM -- user''s guide --
Epic and ARM -- user''s guide --
Epic 1.0 (unconditional) an equational programming language
Epic 1.0 (unconditional) an equational programming language
Lazy rewriting on eager machinery
ACM Transactions on Programming Languages and Systems (TOPLAS)
A slicing-based approach for locating type errors
ACM Transactions on Software Engineering and Methodology (TOSEM)
Compiling language definitions: the ASF+SDF compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
A new compilation technique for left-linear term-rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM).