Token-passing Nets for Functional Languages | Zendy

José Bacelar Almeida | Zendy; Jorge Sousa Pinto | Zendy; Miguel Vilaça | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Token-passing Nets for Functional Languages

Author(s) -

José Bacelar Almeida,

Jorge Sousa Pinto,

Miguel Vilaça

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.03.061

Subject(s) - computer science , security token , recursion (computer science) , operational semantics , programming language , semantics (computer science) , token passing , message passing , functional programming , theoretical computer science , encoding (memory) , cover (algebra) , parallelism (grammar) , distributed computing , parallel computing , artificial intelligence , computer network , mechanical engineering , engineering

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research