%0 Journal Article
%J Electronic Notes in Theoretical Computer Science
%D 2008
%T Token-passing Nets for Functional Languages
%A José Bacelar Almeida
%A Jorge Sousa Pinto
%A Miguel Vilaça
%P 181-198
%V 204
%X <p>Token-passing nets were proposed by Sinot as a simple mechanism for encoding evaluation strategies for the λ-calculus in interaction nets. This work extends token-passing nets to cover a typed functional language equipped with structured types and unrestricted recursion. The resulting interaction system is derived systematically from the chosen big-step operational semantics. Along the way, we actually characterize and discuss several design decisions of token-passing nets and extend them in order to achieve simpler interaction net systems with a higher degree of embedded parallelism.</p>
%> https://haslab.uminho.pt/sites/default/files/jba/files/07tnfp.pdf