University of Sussex
Browse

File(s) not publicly available

Encoding strategies in the lambda calculus with interaction nets

presentation
posted on 2023-06-08, 09:49 authored by Ian MackieIan Mackie
Interaction nets are a graphical paradigm of computation based on graph rewriting. They have proven to be both useful and enlightening in the encoding of linear logic and the ?-calculus. This paper offers new techniques for the theory of interaction nets, with applications to the encoding of specific strategies in the ?-calculus. In particular we show how to recover the usual call-by-value and call-by-name reduction strategies from general encodings.

History

Publication status

  • Published

Publisher

Springer

Page range

19-36

Pages

17.0

Presentation Type

  • paper

Event name

Lecture Notes in Computer Science

Event type

conference

Event date

2006

ISBN

3-540-69174-X

Department affiliated with

  • Informatics Publications

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