Is the optimal implementation inefficient? elementarily not
S Guerrini, M Solieri - … on Formal Structures for Computation and …, 2017 - inria.hal.science
Sharing graphs are a local and asynchronous implementation of lambda-calculus beta-
reduction (or linear logic proof-net cut-elimination) that avoids useless duplications …
reduction (or linear logic proof-net cut-elimination) that avoids useless duplications …