The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Links: Web Programming Without Tiers
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
Lecture Notes in Computer Science 1867
Baldwin, J., Martin, T., & Tzanavari, A. (2000) · Cited by 1,643
Principal type-schemes for functional programs
Damas, L., & Milner, R. (1982) · Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82 · doi:10.1145/582153.582176 · Cited by 1,097
Ajax: A New Approach to Web Applications
Garrett, J. J. (2007) · Cited by 1,029
Concurrent Programming in Erlang
Armstrong, J., Williams, M., & Virding, R. (1993) · Cited by 742
Definitional interpreters for higher-order programming languages
Reynolds, J. C. (1972) · Proceedings of the ACM annual conference on - ACM '72 · doi:10.1145/800194.805852 · Cited by 669
An Overview of the Scala Programming Language
Odersky, M., Altherr, P., Cremet, V., Emir, B., Maneth, S., Micheloud, S., Mihaylov, N., Schinz, M., Stenman, E., & Zenger, M. (2004) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 518
The principle type-scheme of an object in combinatory logic
Hindley, R. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0253905-6 · Cited by 448
Precise analysis of string expressions
Christensen, A. S., Møller, A., & Schwartzbach, M. I. (n.d.) · Cited by 408
Cited by
(2011) · doi:10.1145/1966445.1966473 · Cited by 1,870
Liberating 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
Self-citationCONVENT, L., LINDLEY, S., MCBRIDE, C., & MCLAUGHLIN, C. (2020) · Journal of Functional Programming · doi:10.1017/s0956796820000039 · Cited by 39
Self-citation
Metadata
- Authors
- Cooper, E., Lindley, S., Wadler, P., & Yallop, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007
- Pages
- 266-296
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2136327713
- Cited by
- 309
- References
- 22
- FWCI
- 17.21
- 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: Links: Web Programming Without Tiers. https://app.cochat.ai/papers/10.1007/978-3-540-74792-5_12
- The paper
- Cooper, E., Lindley, S., Wadler, P., & Yallop, J. (2007). Links: Web Programming Without Tiers. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-74792-5_12
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.