The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Guarded recursive datatype constructors
Abstract
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Smalltalk-80: The Language and its Implementation
Goldberg, A., & Robson, D. J. (1983) · HAL · Cited by 3,866
Milner, R., Harper, R., MacQueen, D., & Tofte, M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/2319.001.0001 · Cited by 2,419
A formulation of the simple theory of types
Church, A. (1940) · Journal of Symbolic Logic · doi:10.2307/2266170 · Cited by 1,903
The Definition of Standard ML (Revised)
Milner, R., Harper, R. W., MacQueen, D. B., & Tofte, M. (1997) · Cited by 985
Dependent types in practical programming
Xi, H., & Pfenning, F. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292560 · Cited by 575
Self-citationMetaML and multi-stage programming with explicit annotations
Taha, W., & Sheard, T. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00053-0 · Cited by 383
Compiling polymorphism using intensional type analysis
Harper, R., & Morrisett, G. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199475 · Cited by 295
A modal analysis of staged computation
Davies, R., & Pfenning, F. (2001) · Journal of the ACM · doi:10.1145/382780.382785 · Cited by 293
Haskell 98 — A Non−strict‚ Purely Functional Language
Hinze, R. T. W. (1999) · Cited by 210
Hayes, P. J. (1973) · Mathematical Foundations of Computer Science · Cited by 115
Crary, K., & Weirich, S. (1999) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/317636.317906 · Cited by 101
Polymorphic type inference and abstract data types
Läufer, K., & Odersky, M. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/186025.186031 · Cited by 99
Pfenning, F. (2020) · Cited by 63
Cited by
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
CARETTE, J., KISELYOV, O., & SHAN, C.-C. (2009) · Journal of Functional Programming · doi:10.1017/s0956796809007205 · Cited by 279
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
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
- Xi, H., Chen, C., & Chen, G.
- Venue
- Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2003-01-15
- Pages
- 224-235
- OpenAlex
- W1984514567
- Cited by
- 325
- References
- 13
- FWCI
- 17.92
- Type
- conference paper
- 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.