The categorical abstract machine
Science of Computer Programming
Theoretical Computer Science
An abstract frame work for environment machines
Theoretical Computer Science
The geometry of interaction machine
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reversible, irreversible and optimal &lgr;-machines
Theoretical Computer Science - Special issue on linear logic, 1
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
Paths, Computations and Labels in the Lambda-Calculus
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
A token machine for full geometry of interaction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine
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
| Hi-index | 0.00 |
Girard's Geometry of Interaction offers a low-level decomposition of the cut-elimination process in linear logic, which can be used as a compilation technique for functional programming languages. It is the basis of the Geometry of Interaction Machine, which performs call-by-name computations in graph representations of functional programs without doing any graph reduction. Computation is given by a graph traversal algorithm: a simple intuition is that of a single token traveling through a fixed graph (the program to be evaluated), unraveling the evaluation. Here we continue this line of research to derive alternative ways of following this execution path which give call-by-value computations.