Token-passing Nets for Functional Languages
- Citation:
- Almeida JB, Pinto JS, Vilaça M. 2008. Token-passing Nets for Functional Languages. Electronic Notes in Theoretical Computer Science. 204:181-198.
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.
Citation Key:
DBLP:journals/entcs/AlmeidaPV08DOI:
10.1016/j.entcs.2008.03.061
Tags
- Coq (2)
- formalization (1)
- language closure (1)
- MEE-CBC (1)
- Pumping Lemma (2)
- s2n library (1)
- timing attacks (1)
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.