Treat - an applicative code generator

Authors:
Jerald S. Schwarz;Dean Rubine
Affiliations:
Bell Laboratories, Murray Hill, New Jersey;Bell Laboratories, Murray Hill, New Jersey
Venue:
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1984

Citing 6
Cited 0

Generation of Compiler Symbol Processing Mechanisms from Specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming with Equations

ACM Transactions on Programming Languages and Systems (TOPLAS)
A portable compiler: theory and practice

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Pattern-Directed Inference Systems

Pattern-Directed Inference Systems
HOPE: An experimental applicative language

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
A lazy evaluator

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Treat is a special purpose language for use in compiler writing. A Treat program translates a graph into c-trees (the intermediate language of the pcc compiler) and uses the back end of the C compiler to generate code. Treat has been developed specifically for use in an AdaTM compiler. A Treat program consists of applicative transformation rules. Treat's distinctive aspects include triggering transformations during pattern matching, a context mechanism for dynamic binding and assignment in a language with lazy evaluation.