Encoding an Object Calculus into Interaction Nets

Authors:
Fabien Fleutot
Affiliations:
Dept. of Computer Science, King's College London and Université de Paris VII
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 5
Cited 0

Linear logic

Theoretical Computer Science
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
YALE: yet another lambda evaluator based on interaction nets

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
A Theory of Objects

A Theory of Objects

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose an encoding of an object calculus into interaction nets in two stages. First, we make the calculus fully explicit, i.e. with explicit substitutions, duplications and erasures. Then, we use this explicit calculus to produce an interaction net encoding of objects.