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 machines which can be directly implemented. These machines address all the important implementation issues such as the choice of an inter-thread communication model, and allow to incorporate specific strategies for dividing the computation of the execution path into smaller tasks.Fundação Para a Ciência e a Tecnologia - PRAXIS XXI - BD/11261/97
In this preliminary report for LOLA 2014, we present a prototype implementation of the memoryful GoI...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
This paper revisits the Interaction Abstract Machine (IAM), a machine based on Girard's Geometry of ...
The lambda calculus has frequently been used as an intermediate representation for programming langu...
The parallel processes modelling in the scientific researches automation has been investigated in th...
We introduce a calculus for concurrent and communicating processes, which is a direct and simple ext...
reasoning, trace semantics. Parallel computers have not yet had the expected impact on mainstream co...
This thesis presents a mechanism that will provide a semantic and syntactic environment for expressi...
This thesis aims to develop efficient implementation techniques for functional programming languages...
Gödel’s System T is the simply typed lambda calculus extended with numbers and an iterator. The high...
AbstractIn [M. Pedicini and F. Quaglia. A parallel implementation for optimal lambda-calculus reduct...
Any parallel programming language provides a model of parallelism, which is accepted implicitly when...
Manifold is a new programming language designed to control multiple concurrent activities by managin...
In this paper we present a parallel implementation of Lévy's optimal reduction for the λ-calculus [1...
The algorithms and execution policies specified by the Parallelism TS are designed to permit impleme...
In this preliminary report for LOLA 2014, we present a prototype implementation of the memoryful GoI...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
This paper revisits the Interaction Abstract Machine (IAM), a machine based on Girard's Geometry of ...
The lambda calculus has frequently been used as an intermediate representation for programming langu...
The parallel processes modelling in the scientific researches automation has been investigated in th...
We introduce a calculus for concurrent and communicating processes, which is a direct and simple ext...
reasoning, trace semantics. Parallel computers have not yet had the expected impact on mainstream co...
This thesis presents a mechanism that will provide a semantic and syntactic environment for expressi...
This thesis aims to develop efficient implementation techniques for functional programming languages...
Gödel’s System T is the simply typed lambda calculus extended with numbers and an iterator. The high...
AbstractIn [M. Pedicini and F. Quaglia. A parallel implementation for optimal lambda-calculus reduct...
Any parallel programming language provides a model of parallelism, which is accepted implicitly when...
Manifold is a new programming language designed to control multiple concurrent activities by managin...
In this paper we present a parallel implementation of Lévy's optimal reduction for the λ-calculus [1...
The algorithms and execution policies specified by the Parallelism TS are designed to permit impleme...
In this preliminary report for LOLA 2014, we present a prototype implementation of the memoryful GoI...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
This paper revisits the Interaction Abstract Machine (IAM), a machine based on Girard's Geometry of ...