Encoding strategies in the lambda calculus with interaction nets

Mackie, Ian (2005) Encoding strategies in the lambda calculus with interaction nets. In: Lecture Notes in Computer Science, 2006.

Full text not available from this repository.

Abstract

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.

Item Type: Conference or Workshop Item (Paper)
Schools and Departments: School of Engineering and Informatics > Informatics
Depositing User: Ian Mackie
Date Deposited: 06 Feb 2012 21:22
Last Modified: 14 Jun 2012 10:54
URI: http://sro.sussex.ac.uk/id/eprint/30997
📧 Request an update