A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine

Authors:
Nikolaos Siafakas
Affiliations:
Department of Computer Science, King's College London, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 9
Cited 0

Linear logic

Theoretical Computer Science
The geometry of interaction machine

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Paths, computations and labels in the &lgr;-calculus

RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
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
Interaction nets for linear logic

Theoretical Computer Science
Call-by-Value lambda-Graph Rewriting Without Rewriting

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Closed reduction: explicit substitutions without $\alpha$-conversion

Mathematical Structures in Computer Science
Sharing in the weak lambda-calculus

Processes, Terms and Cycles

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the possibility of performing new reduction strategies with the Geometry of Interaction Machine (GOIm). To this purpose, we appeal to Levy's labelled lambda calculus whose labels describe: a) the path that the GOIm will follow in the graph of a term and b) the operations that the GOIm requires to compute the multiplicative part from the Multiplicative and Exponential Linear Logic encoding that the machine uses. Our goal is to unveil the missing exponential information in the structure of the labels. This will provide us with a tool to talk about strategies for computing paths with the GOIm.