Paper Info
Title
Token-passing Nets for Functional Languages
Abstract
Token-passing nets were proposed by Sinot as a simple mechanism for encoding evaluation strategies for the @l-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.
Year
DOI
Venue
2008
10.1016/j.entcs.2008.03.061
Electr. Notes Theor. Comput. Sci.
Keywords
Field
DocType
λ -calculus,interaction net,functional language,embedded parallelism,big-step operational semantics,higher degree,design decision,functional languages,interaction system,encoding evaluation strategy,token-passing net,token-passing nets,interaction nets,reduction strategies,recursion,simple mechanism,operational semantics
Discrete mathematics,Operational semantics,Token passing,Programming language,Interaction nets,Functional programming,Computer science,Theoretical computer science,Recursion,Encoding (memory)
Journal
Volume
ISSN
Citations 
204,
Electronic Notes in Theoretical Computer Science
4
PageRank 
References 
Authors
0.55
10
3
Name
Order
Citations
PageRank
José Bacelar Almeida11028.34
Jorge Sousa Pinto216023.19
Miguel Vilaça3162.25