A token machine for full geometry of interaction

Authors:
Olivier Laurent
Affiliations:
Institut de Mathématiques de Luminy, Marseille Cedex 09, France
Venue:
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Year:
2001

Citing 7
Cited 7

The geometry of optimal lambda reduction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of interaction machine

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Polarized proof-nets and λµ-calculus

Theoretical Computer Science
Full Abstraction for PCF

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Game semantics and abstract machines

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Call-by-Value lambda-Graph Rewriting Without Rewriting

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Proofnets and Context Semantics for the Additives

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
PELCR: Parallel environment for optimal lambda-calculus reduction

ACM Transactions on Computational Logic (TOCL)
Towards a typed geometry of interaction

Mathematical Structures in Computer Science
Towards a geometry of recursion

Theoretical Computer Science
Musings around the geometry of interaction, and coherence

Theoretical Computer Science
Towards a typed geometry of interaction

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an extension of the Interaction Abstract Machine (IAM) [10, 4] to full Linear Logic with Girard's Geometry of Interaction (GoI) [6]. We propose a simplified way to interpret the additives and the interaction between additives and exponentials by means of weights [7]. We describe the interpretation by a token machine which allows us to recover the usual .... case by forgetting all the additive information.