The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Revised 5 report on the algorithmic language scheme
Open accessAbstract
The report gives a defining description of the programming language Scheme.Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman.It was designed to have an exceptionally clear and simple semantics and few different ways to form expressions.A wide variety of programming paradigms, including imperative, functional, and message passing styles, find convenient expression in Scheme.The introduction offers a brief history of the language and of the report.The first three chapters present the fundamental ideas of the language and describe the notational conventions used for describing the language and for writing programs in the language. Chapters 4 and 5 describe the syntax and semantics of expressions, programs, and definitions.Chapter 6 describes Scheme's built-in procedures, which include all of the language's data manipulation and input/output primitives.Chapter 7 provides a formal syntax for Scheme written in extended BNF, along with a formal denotational semantics.An example of the use of the language follows the formal syntax and semantics.The report concludes with a list of references and an alphabetic index. Following the report is a short list of clarifications and corrections (
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
Key words for use in RFCs to Indicate Requirement Levels
Bradner, S. (1997) · doi:10.17487/rfc2119 · Cited by 2,997
Structure and Interpretation of Computer Programs
Abelson, H., Sussman, G. J., & Sussman, J. (1985) · Cited by 1,435
Self-citationRecursive functions of symbolic expressions and their computation by machine, Part I
McCarthy, J. (1960) · Communications of the ACM · doi:10.1145/367177.367199 · Cited by 1,387
IEEE Standard for Floating-Point Arithmetic
(2008) · doi:10.1109/ieeestd.2008.4610935 · Cited by 1,328
Steele, G. L. (1984) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,162
Self-citationA Syntactic Approach to Type Soundness
Wright, A. K., & Felleisen, M. (1994) · Information and Computation · doi:10.1006/inco.1994.1093 · Cited by 1,136
Revised report on the algorithmic language ALGOL 60
Backus, J. W., Bauer, F. L., Green, J., Katz, C., McCarthy, J., Perlis, A. J., Rutishauser, H., Samelson, K., Vauquois, B., Wegstein, J. H., et al. (1963) · Communications of the ACM · doi:10.1145/366193.366201 · Cited by 900
IEEE Standard for Binary Floating Point Arithmetic
Ieee, A. (1985) · Medical Entomology and Zoology · Cited by 886
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
Recursive Functions of Symbolic Expressions and Their Computation by Machine (1960)
McCarthy, J. (2021) · Ideas That Created the Future · doi:10.7551/mitpress/12274.003.0023 · Cited by 532
Revised 3 report on the algorithmic language scheme
Rees, J., & Clinger, W. (1986) · ACM SIGPLAN Notices · doi:10.1145/15042.15043 · Cited by 509
Kohlbecker, E., Friedman, D. P., Felleisen, M., & Duba, B. (1986) · Proceedings of the 1986 ACM conference on LISP and functional programming - LFP '86 · doi:10.1145/319838.319859 · Cited by 311
Self-citationFilinski, 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
Friedman, D. P., & Wand, M. (1984) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/800055.802051 · Cited by 108
Self-citationThe mystery of the tower revealed
Wand, M., & Friedman, D. P. (1986) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/319838.319871 · Cited by 64
Self-citationObject-oriented programming in scheme
Adams, N., & Rees, J. (1988) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/62678.62720 · Cited by 33
Self-citationAn operational semantics for Scheme
Ramsdell, J. D. (1992) · ACM SIGPLAN Lisp Pointers · doi:10.1145/1039991.1039992 · Cited by 18
Haynes, C. T. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8_117 · Cited by 14
Self-citation
Cited by
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
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
Conception, evolution, and application of functional programming languages
Hudak, P. (1989) · ACM Computing Surveys · doi:10.1145/72551.72554 · Cited by 409
Verification and change-impact analysis of access-control policies
Fisler, K., Krishnamurthi, S., Meyerovich, L. A., & Tschantz, M. C. (2005) · Proceedings of the 27th international conference on Software engineering - ICSE '05 · doi:10.1145/1062455.1062502 · Cited by 390
Essentials of programming languages
(2008) · Choice Reviews Online · doi:10.5860/choice.46-1527 · Cited by 316
Metadata
- Authors
- 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., Pitman, K. M., Rozas, G. J., Steele, G. L., Sussman, G. J., Wand, M., & Abelson, H.
- Venue
- ACM SIGPLAN Notices
- Published
- 1998-09
- Volume
- 33
- Issue
- 9
- Pages
- 26-76
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2002301065
- Cited by
- 317
- References
- 18
- FWCI
- 13.13
- 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.