The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Full Abstraction for PCF
Open accessOverview
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
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Introduction to Lattices and Order
Davey, B. A., & Priestley, H. A. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809088 · Cited by 4,901
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
Recursively enumerable sets and degrees
Soare, R. I. (1978) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1978-14552-2 · Cited by 1,520
LCF considered as a programming language
Plotkin, G. D. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90044-5 · Cited by 1,083
Abramsky, S., & Jung, A. (1995) · Logic in Computer Science · Cited by 1,036
Self-citationGames and Full Completeness for Multiplicative Linear Logic
Abramsky, S., & Jagadeesan, R. (1994) · Journal of Symbolic Logic · doi:10.2307/2275407 · Cited by 378
Self-citationCrole, R. L. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172707 · Cited by 211
Hereditarily sequential functionals
Nickau, H. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58140-5_25 · Cited by 138
Abramsky, S. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00103-0 · Cited by 132
Self-citation
Cited by
Locus Solum: From the rules of logic to the logic of rules
GIRARD, J.-Y. (2001) · Mathematical Structures in Computer Science · doi:10.1017/s096012950100336x · Cited by 267
(2006) · Cited by 17
Metadata
- Authors
- Abramsky, S., Jagadeesan, R., & Malacaria, P.
- Venue
- Information and Computation
- Publisher
- Elsevier BV
- Published
- 2000-12
- Volume
- 163
- Issue
- 2
- Pages
- 409-470
- ISSN
- 0890-5401 (ISSN-L)
- OpenAlex
- W2002845021
- Cited by
- 470
- References
- 13
- FWCI
- 19.99
- 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
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.