Abstract

This paper presents a term graph rewriting system as implementation for the calculus X, a substitution free language that can be used to describe the behaviour of functional programming languages at a very low level of granularity, and has first been defined by Lengrand ('03) and van Bakel-Lengrand-Lescanne. X has been designed to give a Curry-Howard-de Bruijn correspondence to the sequent calculus for classical logic.

Appeared as:

@Inproceedings{vBR-TermGraph'04,

Author = "S. van Bakel and J. Raghunandan",
Title = "Implementing ${\cal X}$",
Booktitle = "Electronic Proceedings of Second International Workshop on {\em Term Graph Rewriting 2004} (TermGraph'04), Rome, Italy",
Series = "Electronic Notes in Theoretical Computer Science",
Year = "2005"
}