The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Computational interpretations of linear logic
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Milner, R. (1989) · Cited by 6,877
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Penczek, W. (1990) · Science of Computer Programming · doi:10.1016/0167-6423(90)90076-p · Cited by 3,954
The Lambda Calculus - Its Syntax and Semantics
(1984) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/c2009-0-14341-6 · Cited by 2,787
Grätzer, G. (1968) · Cited by 2,320
Communicating sequential processes
Boyle, R. (1985) · Data Processing · doi:10.1016/0011-684x(85)90108-x · Cited by 2,034
Fiftieth volume of theoretical computer science
Maurice Nivat, B. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90001-1 · Cited by 1,319
Call-by-name, call-by-value and the λ-calculus
Plotkin, G. D. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90017-1 · Cited by 1,154
Principal type-schemes for functional programs
Damas, L., & Milner, R. (1982) · Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82 · doi:10.1145/582153.582176 · Cited by 1,097
Cited by
Imperative functional programming
Peyton Jones, S. L., & Wadler, P. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158524 · Cited by 1,234
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
Self-citationBounded linear logic: a modular approach to polynomial-time computability
Girard, J.-Y., Scedrov, A., & Scott, P. J. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90386-t · Cited by 231
Quantitative program reasoning with graded modal types
Orchard, D., Liepelt, V.-B., & Eades III, H. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3341714 · Cited by 85
Metadata
- Authors
- Abramsky, S.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 1993-04
- Volume
- 111
- Issue
- 1-2
- Pages
- 3-57
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2012968289
- Cited by
- 409
- References
- 32
- FWCI
- 32.59
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Computational interpretations of linear logic. https://app.cochat.ai/papers/10.1016/0304-3975(93)90181-r
- The paper
- Abramsky, S. (1993). Computational interpretations of linear logic. Theoretical Computer Science. https://doi.org/10.1016/0304-3975(93)90181-r
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.