Token-passing nets for functional languages

• Author(s): Almeida, José Bacelar ; Pinto, Jorge Sousa ; Vilaça, Miguel
• Date: 2008
• Persistent ID: http://hdl.handle.net/1822/14921
• Origin: RepositóriUM - Universidade do Minho
• Subject(s): Interaction nets; Reduction strategies; λ-calculus; Recursion
• Document Type: Article
• Language: English

Description

Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007) 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.