Interaction Combinators

@article{Lafont1997InteractionC,
  title={Interaction Combinators},
  author={Yves Lafont},
  journal={Inf. Comput.},
  year={1997},
  volume={137},
  pages={69-101}
}
  • Y. Lafont
  • Published 1997
  • Computer Science
  • Inf. Comput.
It is shown that a very simple system ofinteraction combinators, with only three symbols and six rules, is a universal model of distributed computation, in a sense that will be made precise. This paper is the continuation of the author's work oninteraction nets, inspired by Girard's proof nets forlinear logic, but no preliminary knowledge of these topics is required for its reading. 
Compiling the -calculus into Interaction Combinators
In this paper we present a case study of the use of Lafont's interaction combinators for the coding of the -calculus. We obtain a very simple, perhaps the simplest, system of rewriting which performsExpand
Compiling the-calculus into Interaction
In this paper we present a case study of the use of Lafont's interaction combinators for the coding of the-calculus. We obtain a very simple, perhaps the simplest, system of rewriting which performsExpand
Edifices and Full Abstraction for the Symmetric Interaction Combinators
TLDR
It is proved that two nets are observationally equivalent iff they have the same edifice, and Edifices may be compared to Bohm trees in infinite η-normal form, or to Nakajima trees, and give a precise topological account of phenomena like infiniteη-expansion. Expand
Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators
TLDR
The problem of full abstraction with respect to one of observational equivalences for symmetric interaction combinators is studied, using a class of very simple denotational models based on pointed sets. Expand
A denotational semantics for the symmetric interaction combinators
  • Damiano Mazza
  • Computer Science, Mathematics
  • Mathematical Structures in Computer Science
  • 2007
TLDR
A denotational semantics is introduced for the symmetric interaction combinators, which is inspired by the relational semantics for linear logic, and an injectivity and full completeness result is proved for it. Expand
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators
  • Damiano Mazza
  • Mathematics, Computer Science
  • Log. Methods Comput. Sci.
  • 2009
TLDR
A full abstraction result is obtained by interpreting nets as certain subsets of the Cantor space, called edifices, which play the same role as Boehm trees in the theory of the lambda-calculus. Expand
Encoding Linear Logic with Interaction Combinators
The purpose of this paper is to demonstrate how Lafont's interaction combinators, a system of three symbols and six interaction rules, can be used to encode linear logic. Specifically, we give aExpand
Bounded Combinatory Logic and lower complexity
TLDR
With the addition of explicit "lazy" products to the player terms and various notions of distributivity, the system characterizes Polynomial Time in a similar way to Soft Linear Logic. Expand
Interaction Nets and Concurrency
Interaction Nets (IN) are a model of distributed computation introduced by Lafont [Laf90], which can be seen as a generalization of Girard’s multiplicative proof-nets [Gir87]. They admit an extremelyExpand
Observational Equivalence for the Interaction Combinators and Internal Separation
  • Damiano Mazza
  • Computer Science, Mathematics
  • Electron. Notes Theor. Comput. Sci.
  • 2007
We define an observational equivalence for Lafont's interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting a deadlock-free normalExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Combinators for Interaction Nets
  • S. Gay
  • Computer Science
  • Theory and Formal Methods
  • 1994
TLDR
A set of combinators which is complete in the sense of being able to encode all possible patterns of interaction in Lafont's Interaction Nets, a graph rewriting system based on classical linear logic. Expand
An algorithm for optimal lambda calculus reduction
We present an algorithm for lambda expression reduction that avoids any copying that could later cause duplication of work. It is optimal in the sense defined by Lévy. The basis of the algorithm is aExpand
The geometry of optimal lambda reduction
TLDR
This paper connects and explains the geometry of interaction and Lamping's graphs, which offer a new understanding of computation, as well as ideas for efficient and correct implementations. Expand
Connection graphs
TLDR
This paper presents connection graph grammars as an abstract model for parallel computation and shows how this model helps to modularize the programming language problem into two pieces. Expand
Geometry of Interaction 1: Interpretation of System F
TLDR
The chapter describes the development of a semantics of computation free from the twin drawbacks of reductionism and subjectivism and that a representative class of algorithms can be modelized by means of standard mathematics. Expand
Linear logic without boxes
TLDR
An implementation of proof nets without boxes is described, which helps in understanding optimal reductions in the lambda -calculus and in the various programming languages inspired by linear logic. Expand
Interaction nets
TLDR
A new kind of programming language, with the following features: a simple graph rewriting semantics, a complete symmetry between constructors and destructors, and a type discipline for deterministic and deadlock-free (microscopic) parallelism. Expand
Linear logic: its syntax and semantics
TLDR
The first objection to that view is that there are in mathematics, in real life, cases where reaction does not exist or can be neglected : think of a lemma which is forever true, or of a Mr. Soros, who has almost an infinite amount of dollars. Expand
Combinators for InteractionNets
  • Proceedings of the Second Imperial College Department of Computing Workshop onTheory and Formal Methods
  • 1995
From Proof-Nets to Inter
  • 1995
...
1
2
...