Hostname: page-component-745bb68f8f-v2bm5 Total loading time: 0 Render date: 2025-01-13T14:22:47.422Z Has data issue: false hasContentIssue false
  • English
  • Français

Encoding left reduction in the λ-calculus with interaction nets

Published online by Cambridge University Press:  17 January 2003

SYLVAIN LIPPI
SYLVAIN LIPPI
Affiliation:
Institut de Mathématiques de Luminy, UPR 9016 du CNRS, 163 avenue de Luminy, case 930, 13288 MARSEILLE CEDEX 9, France Email: lippi@iml.univ-mrs.fr
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper presents a simple implementation of the λ-calculus in the interaction net paradigm. It is based on a two-fold translation. λ-terms are coded (for duplication) or decoded (for execution), and reduction is achieved by switching between these two states: decoding corresponds to head reduction and encoding to left reduction.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 12 , Issue 6 , December 2002 , pp. 797 - 822
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)