Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423643 | Electronic Notes in Theoretical Computer Science | 2008 | 18 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics