Equational logic as a programming language
Equational logic as a programming language
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Automatic generation of fast optimizing code generators
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
The ACT-system: experiences and future enhancements
Lecture notes in Computer Science on Recent trends in data type specification
1st international workshop on Conditional Term Rewriting Systems
Realistic compiler generation
Implementations of term rewriting systems
The Computer Journal - Special issue on term rewriting
Prolog in practical compiler writing
The Computer Journal - Special issue on term rewriting
The equational specification of efficient compiler code generation
Computer Languages
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient tree pattern matching (extended abstract): an aid to code generation
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
High-quality code generation via bottom-up tree pattern matching
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Denotational Description of Programming Languages: An Introduction
The Denotational Description of Programming Languages: An Introduction
A machine independent algorithm for code generation and its use in retargetable compilers.
A machine independent algorithm for code generation and its use in retargetable compilers.
| Hi-index | 0.01 |
Industrial strength compilers need not only be robust and efficient but also understandable, maintainable, and extensible. To make compilers more manageable there has been a strong trend towards the high-level specification of the different phases of the compilation process. However, the high-level specification of one phase - the semantic analysis - has not been very successful in terms of production quality standards. In this paper we propose the use of a language based on equations for the specification of the semantic analysis phase of compilers.