The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
State in Haskell
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
The typechecking of programs with implicit type structure
McCracken, N. (1984) · Lecture Notes in Computer Science · doi:10.1007/3-540-13346-1_15 · Cited by 53
Cited by
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
Scrap your boilerplate: a practical design pattern for generic programming
Lämmel, R., & Jones, S. P. (2003) · Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation · doi:10.1145/604174.604179 · Cited by 351
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268954 · Cited by 282
A history of Haskell: being lazy with class
Hudak, P., Hughes, J., Peyton Jones, S., & Wadler, P. (2007) · Proceedings of the third ACM SIGPLAN conference on History of programming languages · doi:10.1145/1238844.1238856 · Cited by 261
Self-citationTyped memory management in a calculus of capabilities
Crary, K., Walker, D., & Morrisett, G. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292564 · Cited by 252
Koka: Programming with Row Polymorphic Effect Types
Leijen, D. (2014) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.153.8 · Cited by 111
Linear Haskell: practical linearity in a higher-order polymorphic language
Bernardy, J.-P., Boespflug, M., Newton, R. R., Peyton Jones, S., & Spiwack, A. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158093 · Cited by 97
Self-citationTimany, A., Stefanesco, L., Krogh-Jespersen, M., & Birkedal, L. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158152 · Cited by 51
Semmelroth, M., & Sabry, A. (1999) · Proceedings of the fourth ACM SIGPLAN international conference on Functional programming · doi:10.1145/317636.317777 · Cited by 28
First-class names for effect handlers
Xie, N., Cong, Y., Ikemori, K., & Leijen, D. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3563289 · Cited by 11
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
- Launchbury, J., & Peyton Jones, S. L.
- Venue
- LISP and Symbolic Computation
- Published
- 1995-12
- Volume
- 8
- Issue
- 4
- Pages
- 293-341
- ISSN
- 0892-4635 (ISSN-L)
- 1573-0557
- OpenAlex
- W2074674709
- Cited by
- 185
- References
- 1
- FWCI
- 17.71
- Type
- journal article
- Language
- en
- Open access
- closed
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.