Computing Publications

Publications Home » Explicit Alpha Conversion and Gar...

Explicit Alpha Conversion and Garbage Collection for X

Steffen van Bakel, Jayshan Raghunandan

Conference or Workshop Paper
International Workshop on Term Graph Rewriting (TermGraph'06), Vienna, Austria
April, 2006
Abstract

In this paper we study the calculus of circuits $X$, as first presented in cite{Lengrand'03} and studied in detail in cite{vBLL'05}. We will present improvements on the implementation for $X$ using term graph rewriting techniques that was presented in cite{vBR-TermGraph'04}, which result in a far more efficient running of the reduction engine. We show that alpha conversion can be dealt with `on the fly', by implementing the avoidance of capture by modifying the rewrite rules. We then study two different approaches to garbage collection, and compare the various implementations by presenting benchmarks.

PDF of full publication (238 kilobytes)
(need help viewing PDF files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.