2008
Autores
Almeida, JB; Pinto, JS; Vilaça, M;
Publicação
Electr. Notes Theor. Comput. Sci.
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.
2000
Autores
Pinto, JS;
Publicação
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES
Abstract
This paper is a formal study of how to implement interaction nets, filling an important gap in the work on this graphical rewriting formalism, very promising for the implementation of languages based on the gimel -calculus. We propose the first abstract machine for interaction net reduction, based on a decomposition of interaction rules into more atomic steps, which tackles all the implementation details hidden in the graphical presentation. As a natural extension of this, we then give a concurrent shared-memory abstract machine, and show how to implement it, resulting in the first parallel implementation of interaction nets.
2012
Autores
Kniesel, G; Pinto, JS;
Publicação
Electronic Notes in Theoretical Computer Science
Abstract
2009
Autores
Bove, A; Barbosa, LS; Pardo, A; Pinto, JS;
Publicação
Lecture Notes in Computer Science
Abstract
2011
Autores
Almeida, JB; Frade, MJ; Pinto, JS; Sousa, SMd;
Publicação
Undergraduate Topics in Computer Science
Abstract
2001
Autores
Pinto, JS;
Publicação
TYPED LAMBDA CALCULI AND APPLICATIONS, PROCEEDINGS
Abstract
An examination of Girard's execution formula suggests implementations of the Geometry of Interaction at the syntactic level. In this paper we limit our scope to ground-type terms and study the parallel aspects of such implementations, by introducing a family of abstract machines which can be directly implemented. These machines address all the important implementation issues such as the choice of an interthread communication model, and allow to incorporate specific strategies for dividing the computation of the execution path into smaller tasks.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.