The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Interaction nets
Abstract
We propose a new kind of programming language, with the following features:a simple graph rewriting semantics,a complete symmetry between constructors and destructors,a type discipline for deterministic and deadlock-free (microscopic) parallelism.Interaction nets generalize Girard's proof nets of linear logic and illustrate the advantage of an integrated logic approach, as opposed to the external one. In other words, we did not try to design a logic describing the behaviour of some given computational system, but a programming language for which the type discipline is already (almost) a logic.In fact, we shall scarcely refer to logic, because we adopt a naive and pragmatic style. A typical application we have in mind for this language is the design of interactive softwares such as editors or window managers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Geometry of Interaction 1: Interpretation of System F
Girard, J.-Y. (1989) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)70271-4 · Cited by 179
Lafont, Y. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90074-6 · Cited by 132
Self-citationLinear logic and lazy computation
Girard, J.-Y., & Lafont, Y. (2005) · Springer eBooks · doi:10.1007/bfb0014972 · Cited by 128
Self-citationLafont, Y. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90100-4 · Cited by 127
Self-citation
Cited by
Honda, K. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57208-2_35 · Cited by 396
Games and Full Completeness for Multiplicative Linear Logic
Abramsky, S., & Jagadeesan, R. (1994) · Journal of Symbolic Logic · doi:10.2307/2275407 · Cited by 378
The space and motion of communicating agents
(2010) · Choice Reviews Online · doi:10.5860/choice.47-3212 · Cited by 276
Metadata
- Authors
- Lafont, Y.
- Venue
- Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90
- Publisher
- ACM Press
- Published
- 1990
- Pages
- 95-108
- OpenAlex
- W2294530123
- Cited by
- 316
- References
- 5
- FWCI
- 7.55
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Interaction nets. https://app.cochat.ai/papers/10.1145/96709.96718
- The paper
- Lafont, Y. (1990). Interaction nets. Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90. https://doi.org/10.1145/96709.96718
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.