Computing Publications

Publications Home » Implementing X

Implementing X

Steffen van Bakel, Jayshan Raghunandan

Conference or Workshop Paper
2nd International Workshop on Term Graph Rewriting (TermGraph'04), Rome, Italy
October, 2004
Electronic Notes in Theoretical Computer Science
Volume 127
Issues 5–171
p.195
Elsevier
DOI 10.1016/j.entcs.2005.03.025
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.

PDF of full publication (187 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.