Sharing Implementations of Graph Rewriting Systems

Authors:
Stefano Guerrini
Affiliations:
Università Roma La Sapienza, Dipartimento di Informatica, Via Salaria, 113, 00198 Roma, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 13
Cited 0

An algorithm for optimal lambda calculus reduction

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interaction nets

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of optimal lambda reduction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interaction systems II: the practice of optimal reductions

Theoretical Computer Science
Light linear logic

Information and Computation
A general theory of sharing graphs

Theoretical Computer Science - Special issue on linear logic, 1
The optimal implementation of functional programming languages

The optimal implementation of functional programming languages
Proof nets, garbage, and computations

Theoretical Computer Science - Special issues on models and paradigms for concurrency
Parallel beta reduction is not elementary recursive

Information and Computation
Coherence for sharing proof-nets

Theoretical Computer Science - Linear logic
Linear Logic With Boxes

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Linear Logic, Comonads And Optimal Reductions

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sharing graphs are a brilliant solution to the implementation of Levy optimal reductions of @l-calculus. Sharing graphs are interesting on their own and optimal sharing reductions are just a particular reduction strategy of a more general sharing reduction system. The paper is a gentle introduction to sharing graphs and tries to confute some of the common myths on the difficulty of sharing implementations.