A Syntactic Approach to Type Soundness
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
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
The Lambda Calculus - Its Syntax and Semantics
(1984) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/c2009-0-14341-6 · Cited by 2,787
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 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
Call-by-name, call-by-value and the λ-calculus
Plotkin, G. D. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90017-1 · Cited by 1,154
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
Scott, D. (2006) · Springer eBooks · doi:10.1007/bfb0079432 · Cited by 737
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
The revised report on the syntactic theories of sequential control and state
Felleisen, M., & Hieb, R. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90014-7 · Cited by 523
Self-citationRevised 3 report on the algorithmic language scheme
Rees, J., & Clinger, W. (1986) · ACM SIGPLAN Notices · doi:10.1145/15042.15043 · Cited by 509
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
Cited by
Ownership types for safe programming: preventing data races and deadlocks
Boyapati, C., Lee, R., & Rinard, M. (2002) · Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02 · doi:10.1145/582419.582440 · Cited by 570
Bringing the web up to speed with WebAssembly
Haas, A., Rossberg, A., Schuff, D. L., Titzer, B. L., Holman, M., Gohman, D., Wagner, L., Zakai, A., & Bastien, J. (2017) · Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3062341.3062363 · Cited by 537
Flatt, M., Krishnamurthi, S., & Felleisen, M. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268961 · Cited by 487
Self-citationAn overview of the K semantic framework
Roșu, G., & Șerbănută, T. F. (2010) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2010.03.012 · Cited by 408
RustBelt: securing the foundations of the Rust programming language
Jung, R., Jourdan, J.-H., Krebbers, R., & Dreyer, D. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158154 · Cited by 368
Advanced Topics in Types and Programming Languages
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/1104.001.0001 · Cited by 348
Multi-stage programming with explicit annotations
Taha, W., & Sheard, T. (1997) · Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation · doi:10.1145/258993.259019 · Cited by 342
Revised 5 report on the algorithmic language scheme
Adams, N. I., Bartley, D. H., Brooks, G., Dybvig, R. K., Friedman, D. P., Halstead, R., Hanson, C., Haynes, C. T., Kohlbecker, E., Oxley, D., et al. (1998) · ACM SIGPLAN Notices · doi:10.1145/290229.290234 · Cited by 317
Mechanized Metatheory for the Masses: The PoplMark Challenge
Aydemir, B. E., Bohannon, A., Fairbairn, M., Foster, J. N., Pierce, B. C., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., & Zdancewic, S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11541868_4 · Cited by 303
Flanagan, C. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111059 · Cited by 265
Information flow inference for ML
Pottier, F., & Simonet, V. (2003) · ACM Transactions on Programming Languages and Systems · doi:10.1145/596980.596983 · Cited by 262
Foster, J. S., Fähndrich, M., & Aiken, A. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301665 · Cited by 261
Typed 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
York, B. N., Loeb, S., & Doss, C. (2019) · Journal of Human Resources · doi:10.3368/jhr.54.3.0517-8756r · Cited by 223
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
Abstraction-safe effect handlers via tunneling
Zhang, Y., & Myers, A. C. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3290318 · Cited by 45
Stateful Contracts for Affine Types
Tov, J. A., & Pucella, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11957-6_29 · Cited by 43
Perceus: garbage free reference counting with reuse
Reinking, A., Xie, N., de Moura, L., & Leijen, D. (2021) · Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation · doi:10.1145/3453483.3454032 · Cited by 32
Semmelroth, M., & Sabry, A. (1999) · Proceedings of the fourth ACM SIGPLAN international conference on Functional programming · doi:10.1145/317636.317777 · Cited by 28
Catala: Moving towards the future of legal expert systems
Huttner, L., & Merigoux, D. (2022) · Artificial Intelligence and Law · doi:10.1007/s10506-022-09328-5 · Cited by 18
“More particularly, it has a formal semantics [32], comprised of three complementary items: a description of the syntax of C ATALA programs, a typing judgment that rules out ill-formed programs, and an operational semantics describing how valid programs execute.”
BackgroundFirst-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
Handling Polymorphic Algebraic Effects
Sekiyama, T., & Igarashi, A. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-17184-1_13 · Cited by 9
First class dynamic effect handlers: or, polymorphic heaps with dynamic effect handlers
Leijen, D. (2018) · Proceedings of the 3rd ACM SIGPLAN International Workshop on Type-Driven Development · doi:10.1145/3240719.3241789 · Cited by 3
Metadata
- Authors
- Wright, A. K., & Felleisen, M.
- Venue
- Information and Computation
- Publisher
- Elsevier BV
- Published
- 1994-11
- Volume
- 115
- Issue
- 1
- Pages
- 38-94
- ISSN
- 0890-5401 (ISSN-L)
- OpenAlex
- W1980939032
- Cited by
- 1,136
- References
- 17
- FWCI
- 18.33
- 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
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.