Token-passing Nets for Functional Languages

Authors:
José Bacelar Almeida;Jorge Sousa Pinto;Miguel Vilaça
Affiliations:
CCTC / Departamento de Informática, Universidade do Minho, 4710-057 Braga, Portugal;CCTC / Departamento de Informática, Universidade do Minho, 4710-057 Braga, Portugal;CCTC / Departamento de Informática, Universidade do Minho, 4710-057 Braga, Portugal
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 12
Cited 1

Natural semantics

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Linear logic

Theoretical Computer Science
Interaction nets

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The formal semantics of programming languages: an introduction

The formal semantics of programming languages: an introduction
Combinatory reduction systems: introduction and survey

Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
YALE: yet another lambda evaluator based on interaction nets

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
The optimal implementation of functional programming languages

The optimal implementation of functional programming languages
Encoding left reduction in the λ-calculus with interaction nets

Mathematical Structures in Computer Science
Closed reduction: explicit substitutions without $\alpha$-conversion

Mathematical Structures in Computer Science
Call-by-need in token-passing nets

Mathematical Structures in Computer Science
Token-Passing Nets: Call-by-Need for Free

Electronic Notes in Theoretical Computer Science (ENTCS)
Call-by-name and call-by-value as token-passing interaction nets

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Recursive Functions with Pattern Matching in Interaction Nets

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.