Encoding left reduction in the λ-calculus with interaction nets

DOI10.1017/S0960129502003754zbMath1022.03006OpenAlexW2035291585MaRDI QIDQ4405695

Sylvain Lippi

Publication date: 23 June 2003

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129502003754

zbMATH Keywords

decoding\(\lambda\)-calculusencodinginteraction net

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (7)

The graphical Krivine machine ⋮ An Interaction Net Encoding of Gödel’s System  $$\mathcal {T}$$ ⋮ An Explicit Framework for Interaction Nets ⋮ A Calculus for Interaction Nets Based on the Linear Chemical Abstract Machine ⋮ Universal Boolean Systems ⋮ Hard combinators ⋮ Token-passing Nets for Functional Languages

This page was built for publication: Encoding left reduction in the λ-calculus with interaction nets