University of Sussex
Browse

File(s) not publicly available

Lambda-Calculus with Director Strings

journal contribution
posted on 2023-06-08, 06:09 authored by Maribel Fernández, Ian MackieIan Mackie, François-Régis Sinot
No description supplied

History

Publication status

  • Published

Journal

Journal of Applicable Algebra in Engineering, Communication and Computing

ISSN

0938-1279

Issue

6

Volume

15

Page range

393-437

Pages

45.0

Department affiliated with

  • Informatics Publications

Notes

Originality: Director strings were developed for combinatory logic as an implementation mechanism. This paper presents for the first time the generalisation of these ideas to the lambda calculus. Rigour: The main properties of the calculus are proved, and abstract machines are derived and implemented to support the theoretical claims. Significance: This work is a crucial element for the current work on optimal reduction. An interaction net implementation of this strategy is used to produce the most efficient lambda evaluator known to date ("Efficient lambda evaluation with interaction nets", RTA'04). The work is also the subject of a research collaboration between the UK, France and Portugal. Impact: This work provided the topic for a successful PhD thesis at one of the top institutions in France (2006). Outlet: Invited submission after RTA 2003.

Full text available

  • No

Peer reviewed?

  • Yes

Legacy Posted Date

2012-02-06

Usage metrics

    University of Sussex (Publications)

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC