Implementing |
| |
Authors: | Steffen van Bakel Jayshan Raghunandan |
| |
Affiliation: | Department of Computing, Imperial College London, 180 Queen's Gate, London SW7 2BZ, UK |
| |
Abstract: | This paper presents a term graph rewriting system as an implementation for the -calculus, 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 in Stéphane Lengrand. Call-by-value, call-by-name, and strong normalization for the classical sequent calculus. In Bernhard Gramlich and Salvador Lucas, editors, Electronic Notes in Theoretical Computer Science, volume 86. Elsevier, 2003; S. van Bakel, S. Lengrand, and P. Lescanne. The language : circuits, computations and classical logic. Submitted, 2004]. Since the calculus has a notion of binding, in the context of sharing a notion of rebinding is introduced that helps avoid double binding of names. |
| |
Keywords: | term graph rewriting -calculus lambda calculus Curry Howard correspondence |
本文献已被 ScienceDirect 等数据库收录! |
|