The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Monad transformers and modular interpreters
Open accessAbstract
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many commonly known features, including simple expressions, three different function call mechanisms (call-by-name, call-by-value and lazy evaluation), references and assignment, nondeterminism, first-class continuations, and program tracing.
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
Cites
Milner, R., Harper, R., MacQueen, D., & Tofte, M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/2319.001.0001 · Cited by 2,419
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
The essence of functional programming
Wadler, P. (1992) · Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92 · doi:10.1145/143165.143169 · Cited by 679
Wadler, P. (1990) · Proceedings of the 1990 ACM conference on LISP and functional programming · doi:10.1145/91556.91592 · Cited by 576
Filinski, A. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.178047 · Cited by 248
A system of constructor classes: overloading and implicit higher-order polymorphism
Jones, M. P. (1993) · International Conference on Functional Programming Languages and Computer Architecture (FPCA) · doi:10.1145/165180.165190 · Cited by 124
Self-citationExtensible denotational language specifications
Cartwright, R., & Felleisen, M. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57887-0_99 · Cited by 62
Cited by
Building domain-specific embedded languages
Hudak, P. (1996) · ACM Computing Surveys · doi:10.1145/242224.242477 · Cited by 477
Self-citationLiberating effects with rows and handlers
Hillerström, D., & Lindley, S. (2016) · Proceedings of the 1st International Workshop on Type-Driven Development · doi:10.1145/2976022.2976033 · Cited by 68
Binders by day, labels by night: effect instances via lexically scoped handlers
Biernacki, D., Piróg, M., Polesiuk, P., & Sieczkowski, F. (2020) · Proceedings of the ACM on Programming Languages · doi:10.1145/3371116 · Cited by 46
Mokhov, A., Mitchell, N., & Peyton Jones, S. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3236774 · Cited by 38
Effect handlers in Haskell, evidently
Xie, N., & Leijen, D. (2020) · Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell · doi:10.1145/3406088.3409022 · Cited by 8
Metadata
- Authors
- Liang, S., Hudak, P., & Jones, M.
- Venue
- Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 333-343
- OpenAlex
- W2141576692
- Cited by
- 503
- References
- 7
- FWCI
- 10.76
- Type
- conference paper
- 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: Monad transformers and modular interpreters. https://app.cochat.ai/papers/10.1145/199448.199528
- The paper
- Liang, S., Hudak, P., & Jones, M. (1995). Monad transformers and modular interpreters. Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95. https://doi.org/10.1145/199448.199528
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.