The DOI matches its Crossref record.
Notions of computation and monads
Open accessAbstract
Abstract The λ-calculus is considered a useful mathematical tool in the study of programming languages, since programs can be identified with λ-terms. However, if one goes further and uses βη-conversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with total functions from values to values ) that may jeopardise the applicability of theoretical results. In this paper we introduce calculi, based on a categorical semantics for computations , that provide a correct basis for proving equivalence of programs for a wide range of notions of computation .
Overview
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
Cited by
A judgmental reconstruction of modal logic
PFENNING, F., & DAVIES, R. (2001) · Mathematical Structures in Computer Science · doi:10.1017/s0960129501003322 · Cited by 342
Notions of Computation Determine Monads
Plotkin, G., & Power, J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45931-6_24 · Cited by 280
Principles of programming with complex objects and collection types
Buneman, P., Naqvi, S., Tannen, V., & Wong, L. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(95)00024-q · Cited by 256
Algebraic Operations and Generic Effects
Plotkin, G., & Power, J. (2003) · Applied Categorical Structures · doi:10.1023/a:1023064908962 · Cited by 250
Plotkin, G., & Pretnar, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00590-9_7 · Cited by 225
Metadata
- Authors
- Moggi, E.
- Venue
- Information and Computation
- Publisher
- Elsevier BV
- Published
- 1991-07
- Volume
- 93
- Issue
- 1
- Pages
- 55-92
- ISSN
- 0890-5401 (ISSN-L)
- OpenAlex
- W1997143185
- Cited by
- 1,688
- References
- 0
- FWCI
- 15.48
- 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: Notions of computation and monads. https://app.cochat.ai/papers/10.1016/0890-5401(91)90052-4
- The paper
- Moggi, E. (1991). Notions of computation and monads. Information and Computation. https://doi.org/10.1016/0890-5401(91)90052-4
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.
