Building Interpreters with Rewriting Strategies

Building Interpreters with Rewriting Strategies (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Eelco Dolstra , Eelco Visser

Venue:	Workshop on Language Descriptions, Tools and Applications (LDTA’02), volume 65/3 of Electronic Notes in Theoretical Computer Science
Citations:	11 - 7 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Building Interpreters with Rewriting Strategies	user correction - Legacy Corrections
AUTHOR NAME	Eelco Dolstra	user correction - Legacy Corrections
AUTHOR AFFIL	Institute of Information and Computing Sciences, Universiteit Utrecht	user correction - Legacy Corrections
AUTHOR ADDR	P.O. Box; 80089, 3508 TB Utrecht, The Netherlands.	user correction - Legacy Corrections
AUTHOR NAME	Eelco Visser	user correction - Legacy Corrections
AUTHOR AFFIL	Institute of Information and Computing Sciences, Universiteit Utrecht	user correction - Legacy Corrections
AUTHOR ADDR	P.O. Box; 80089, 3508 TB Utrecht, The Netherlands.	user correction - Legacy Corrections
ABSTRACT	Programming language semantics based on pure rewrite rules suers from the gap between the rewriting strategy implemented in rewriting engines and the intended evaluation strategy. This paper shows how programmable rewriting strategies can be used to implement interpreters for programming languages based on rewrite rules. The advantage of this approach is that reduction rules are rst class entities that can be reused in dierent strategies, even in other kinds of program transformations such as optimizers. The approach is illustrated with several interpreters for the lambda calculus based on implicit and explicit (parallel) substitution, dierent strategies including normalization, eager evaluation, lazy evaluation, and lazy evaluation with updates. An extension with pattern matching and choice shows that such interpreters can easily be extended.	user correction - Legacy Corrections
YEAR	2002	INFERENCE
VENUE	Workshop on Language Descriptions, Tools and Applications (LDTA’02), volume 65/3 of Electronic Notes in Theoretical Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	57--76	INFERENCE
TECH	Tech. Rep. UU-CS-2002-022	INFERENCE
CITATIONS	18 found	ParsCit 1.0