The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Notions of Computation Determine Monads
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
Categories for the Working Mathematician
Lane, S. M. (1971) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-9839-7 · Cited by 8,817
Notions of computation and monads
Moggi, E. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90052-4 · Cited by 1,688
Basic concepts of enriched category theory
Kelly, G. M. (1982) · Cited by 1,229
Computational lambda-calculus and monads
Moggi, E. (2003) · [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science · doi:10.1109/lics.1989.39155 · Cited by 842
Plotkin, G. D. (1976) · SIAM Journal on Computing · doi:10.1137/0205035 · Cited by 649
Self-citationA probabilistic powerdomain of evaluations
Jones, C., & Plotkin, G. D. (2003) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1989.39173 · Cited by 356
Self-citationJones, C. (1992) · ERA · Cited by 279
Levy, P. B. (2003) · Springer eBooks · doi:10.1007/978-94-007-0954-6 · Cited by 192
Adequacy for Algebraic Effects
Plotkin, G. D., & Power, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45315-6_1 · Cited by 165
Self-citationCall-by-Push-Value: A Subsuming Paradigm
Levy, P. B. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48959-2_17 · Cited by 105
Cited by
Algebraic Operations and Generic Effects
Plotkin, G., & Power, J. (2003) · Applied Categorical Structures · doi:10.1023/a:1023064908962 · Cited by 250
Self-citationPlotkin, G., & Pretnar, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00590-9_7 · Cited by 225
Self-citationHandle with care: relational interpretation of algebraic effects and handlers
Biernacki, D., Piróg, M., Polesiuk, P., & Sieczkowski, F. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158096 · Cited by 45
CONVENT, L., LINDLEY, S., MCBRIDE, C., & MCLAUGHLIN, C. (2020) · Journal of Functional Programming · doi:10.1017/s0956796820000039 · Cited by 39
Metadata
- Authors
- Plotkin, G., & Power, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 342-356
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1521014576
- Cited by
- 280
- References
- 15
- FWCI
- 4.35
- Type
- conference paper
- Language
- en
- Open access
- green
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: Notions of Computation Determine Monads. https://app.cochat.ai/papers/10.1007/3-540-45931-6_24
- The paper
- Plotkin, G., & Power, J. (2002). Notions of Computation Determine Monads. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-45931-6_24
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.
