Theoretical Computer Science
The geometry of interaction machine
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof-nets and the Hilbert space
Proceedings of the workshop on Advances in linear logic
Geometry of interaction III: accommodating the additives
Proceedings of the workshop on Advances in linear logic
A parallel implementation for optimal lambda-calculus reduction
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Geometry of interaction 2: deadlock-free algorithms
COLOG '88 Proceedings of the International Conference on Computer Logic
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Scheduling vs Communication in PELCR
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
PELCR: Parallel environment for optimal lambda-calculus reduction
ACM Transactions on Computational Logic (TOCL)
Context semantics, linear logic, and computational complexity
ACM Transactions on Computational Logic (TOCL)
Supporting Function Calls within PELCR
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
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.