Implementing X | Zendy

Steffen van Bakel | Zendy; Jayshan Raghunandan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Implementing X

Author(s) -

Steffen van Bakel,

Jayshan Raghunandan

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.03.025

Subject(s) - sequent calculus , rewriting , computer science , sequent , normalization (sociology) , programming language , calculus (dental) , context (archaeology) , theoretical computer science , discrete mathematics , mathematics , mathematical proof , medicine , paleontology , geometry , dentistry , sociology , anthropology , biology

This paper presents a term graph rewriting system as an implementation for the X-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 X: 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research