The DOI matches its Crossref record; 73 of the 73 references it cites were found in a registry or an index.
Essentials of programming languages
Abstract
4.4 Type Inference 5 Objects and Classes 5.1 Object-Oriented Programming 5.2 Inheritance 5.3 The Language 5.4 Four implementations 6 Objects and Types 6.1 A Simple Typed Object-Oriented Language 6.2 The Type Checker 6.3 The Translator 7 Continuation-Passing Interpreters 7.1 A Continuation-Passing Interpreter 7.2 Procedural Representation of Continuations 7.3 An Imperative Interpreter 7.4 Exceptions and Control Flow 7.5 Multithreading 7.6 Logic Programming 8 Continuation-Passing Style 8.1 Tail Form 8.2 Converting to Continuation-Passing Style 8.3 Examples of the CPS Transformation 8.4 Implementing the CPS Transformation 8.5 Modeling computational effects A The SLLGEN Parsing System B For Further Reading Bibliography Index OrganizationThe first two chapters provide the foundations for a careful study of programming languages.Chapter 1 emphasizes the connection between inductive data specification and recursive programming and introduces several notions related to the scope of variables.Chapter 2 introduces a data type facility.This leads to a discussion of data abstraction and examples of representational transformations of the sort used in subsequent chapters.Chapter 3 uses these foundations to describe the behavior of programming languages.It introduces interpreters as mechanisms for explaining the run-time behavior of languages and develops an interpreter for a simple, lexically scoped language with first-class procedures, recursion, and assignment to variables.This interpreter is the basis for much of the material in the remainder of the book.The chapter then explores call-by-reference, call-by-need, and call-by-name parameterpassing mechanisms, and culminates with a sketch of an interpreter for an imperative language.Chapter 4 extends the language of chapter 3 with type declarations.First we implement a type checker.Next we show how to use the types to enforce abstraction boundaries.Finally we show how the types in program can be deduced by a unification-based type inference algorithm.Chapter 5 presents the basic concepts of object-oriented languages, centered on classes (but ignoring types, which are deferred to chapter 6).We develop an efficient run-time architecture, which is used as the basis for the material in chapter 6.Chapter 6 combines the ideas of the type checker of chapter 4 with those of the object-oriented language of chapter 5, leading to a conventional typed object-oriented language.This requires introducing new concepts including abstract classes, abstract methods, and casting.Chapter 7 rewrites our basic interpreter in continuation-passing style.The control structure that is needed to run the interpreter thereby shifts from recursion to iteration.This exposes the control mechanisms of the interpreted language, and strengthens one's intuition for control issues in general.It also provides the means for extending the interpreter with exception-handling and multithreading mechanisms.Finally, we use continuation-passing style to present logic programming.Chapter 8 is the companion to the previous chapter.There we show how to transform our familiar interpreter into continuation-passing style; here we show how to accomplish this for a much larger class of programs.Continuation-passing style is a powerful programming tool, for it allows any sequential control mechanism to be implemented in almost any language.The algorithm is also a fine example of an abstractly specified source-to-source program transformation.The dependencies of the various chapters are shown in the figure below.Finally, appendix A describes our SLLGEN parsing system. UsageThis material has been used in both undergraduate and graduate courses.In addition, it has been used in continuing education courses for professional programmers.We assume background in data structures and experience both in a procedural language such as C, C++, or Java, and in Scheme.Exercises are a vital part of the text and are scattered throughout.They range in difficulty from being trivial if related material is understood [ ], to requiring many hours of thought and programming work [ ].A great deal of material of applied, historical, and theoretical interest resides within them.We recommend that each exercise be read and some thought be given as to how to solve it.Although we write our program interpretation and transformation systems in Scheme, any language that supports both first-class procedures and assignment (ML, Common Lisp, etc.) is adequate for working the exercises.We are indebted to countless colleagues and students who used and critiqued the first edition of this book and provided invaluable assistance in the long gestation of this second edition.We are especially grateful for the contributions of the following individuals, to whom we offer a special word of thanks.Matthias Felleisen's keen analysis has improved the design of several chapters.Among these, his work with Amr Sabry on the CPS algorithm led to a far more elegant algorithm tha
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
(1994) · Cited by 21,711
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
The Java Language Specification
Gosling, J., Joy, B., & Steele, G. L. (1996) · Cited by 3,924
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
Smalltalk-80: The Language and its Implementation
Goldberg, A., & Robson, D. J. (1983) · HAL · Cited by 3,866
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
Clocksin, W. F., & Mellish, C. (1984) · Springer eBooks · doi:10.1007/978-3-642-55481-0 · Cited by 2,047
Semantics of context-free languages
Knuth, D. E. (1968) · Mathematical Systems Theory · doi:10.1007/bf01692511 · Cited by 1,948
Godel, Escher, Bach: An Eternal Golden Braid.
Lieberson, J., & Hofstadter, D. R. (1980) · The Journal of Philosophy · doi:10.2307/2025598 · Cited by 1,914
Principles of Program Analysis
Nielson, F., Nielson, H. R., & Hankin, C. (1999) · Springer eBooks · doi:10.1007/978-3-662-03811-6 · Cited by 1,836
Notions of computation and monads
Moggi, E. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90052-4 · Cited by 1,688
Structure and Interpretation of Computer Programs
Abelson, H., Sussman, G. J., & Sussman, J. (1985) · Cited by 1,435
Recursive 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
Imperative functional programming
Peyton Jones, S. L., & Wadler, P. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158524 · Cited by 1,234
The calculi of lambda-conversion
Rosser, B. (1941) · Medical Entomology and Zoology · Cited by 1,168
Steele, G. L. (1984) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,162
Viewing control structures as patterns of passing messages
Hewitt, C. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90033-9 · Cited by 1,161
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
First draft of a report on the EDVAC
von Neumann, J. (1993) · IEEE Annals of the History of Computing · doi:10.1109/85.238389 · Cited by 1,112
LCF considered as a programming language
Plotkin, G. D. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90044-5 · Cited by 1,083
The implementation of functional programming languages
(1987) · Microprocessors and Microsystems · doi:10.1016/0141-9331(87)90510-2 · Cited by 1,076
de Bruijn, N. G. (1972) · Indagationes Mathematicae (Proceedings) · doi:10.1016/1385-7258(72)90034-0 · Cited by 1,049
The art of the metaobject protocol
(1992) · Choice Reviews Online · doi:10.5860/choice.29-3938 · Cited by 1,009
Abadi, M., & Cardelli, L. (1996) · Monographs in Computer Science · doi:10.1007/978-1-4419-8598-9 · Cited by 1,001
Igarashi, A., Pierce, B. C., & Wadler, P. L. (2001) · ACM Transactions on Programming Languages and Systems · doi:10.1145/503502.503505 · Cited by 986
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
The Annotated C++ Reference Manual
Ellis, M. A., & Stroustrup, B. (1990) · CERN Document Server (European Organization for Nuclear Research) · Cited by 811
A technique for software module specification with examples
Parnas, D. L. (1972) · Communications of the ACM · doi:10.1145/355602.361309 · Cited by 726
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
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
Purely Functional Data Structures
Okasaki, C. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511530104 · Cited by 625
Paulson, L. C. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511811326 · Cited by 593
Hodes, H., & Barendregt, H. P. (1988) · The Philosophical Review · doi:10.2307/2185110 · Cited by 564
McCarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., & Levin, M. I. (1962) · doi:10.21236/ad0406138 · Cited by 555
“Memo” Functions and Machine Learning
MICHIE, D. (1968) · Nature · doi:10.1038/218019a0 · Cited by 551
The essence of compiling with continuations
Flanagan, C., Sabry, A., Duba, B. F., & Felleisen, M. (1993) · Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation · doi:10.1145/155090.155113 · Cited by 534
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
Towards a Mathematical Science of Computation
McCarthy, J. (1993) · Studies in Cognitive Systems · doi:10.1007/978-94-011-1793-7_2 · Cited by 525
Revised 3 report on the algorithmic language scheme
Rees, J., & Clinger, W. (1986) · ACM SIGPLAN Notices · doi:10.1145/15042.15043 · Cited by 509
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
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
Reflection and semantics in LISP
Smith, B. C. (1984) · Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84 · doi:10.1145/800017.800513 · Cited by 444
Revised5 Report on the Algorithmic Language Scheme
Abelson, H., Dybvig, R. K., Haynes, C. T., Rozas, G. J., Adams, N. I., Friedman, D. P., Kohlbecker, E., Steele, G. L., Bartley, D. H., Halstead, R., et al. (1998) · Higher-Order and Symbolic Computation · doi:10.1023/a:1010051815785 · Cited by 414
Encyclopedia of Computer Science and Technology
Belzer, J. (2018) · Routledge eBooks · doi:10.1201/9780203757673 · Cited by 368
Structure and interpretation of computer programs
(1997) · Choice Reviews Online · doi:10.5860/choice.34-3352 · Cited by 368
Representing Control: a Study of the CPS Transformation
Danvy, O., & Filinski, A. (1992) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500001535 · Cited by 352
Birtwhistle, G. M., Dahl, O., Myhrhaug, B., et al. (1979) · Cited by 335
Lambda-calculus models of programming languages.
Morris, J. H. (1969) · Defense Technical Information Center (DTIC) · Cited by 331
Proving Properties of Programs by Structural Induction
Burstall, R. M. (1969) · The Computer Journal · doi:10.1093/comjnl/12.1.41 · Cited by 324
Computer Programming and Formal Systems
(1963) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)x7102-2 · Cited by 324
The Principal Type-Scheme of an Object in Combinatory Logic
Hindley, R. (1969) · Transactions of the American Mathematical Society · doi:10.2307/1995158 · Cited by 319
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
Fundamental Concepts in Programming Languages
Strachey, C. (2000) · Higher-Order and Symbolic Computation · doi:10.1023/a:1010000313106 · Cited by 278
History of Programming Languages
(1981) · Elsevier eBooks · doi:10.1016/c2013-0-11690-x · Cited by 269
CONS Should Not Evaluate its Arguments.
Friedman, D. P., & Wise, D. S. (1976) · International Colloquium on Automata, Languages and Programming · Cited by 267
Manifest types, modules, and separate compilation
Leroy, X. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.176926 · Cited by 257
Computer Programming and Formal Systems.
Shepherdson, J. C., Braffort, P., & Hirschberg, D. (1965) · The Philosophical Quarterly · doi:10.2307/2218270 · Cited by 237
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Automation of Reasoning · doi:10.1007/978-3-642-81952-0_26 · Cited by 234
Definitional Interpreters for Higher-Order Programming Languages
Reynolds, J. C. (1998) · Higher-Order and Symbolic Computation · doi:10.1023/a:1010027404223 · Cited by 217
Structure and Interpretation of Computer Programs
Fry, C., Abelson, H., Sussman, G., & Sussman, J. (1985) · Computer Music Journal · doi:10.2307/3679579 · Cited by 199
The FORTRAN automatic coding system
Backus, J. W., Stern, H., Ziller, I., Hughes, R. A., Nutt, R., Beeber, R. J., Best, S., Goldberg, R., Haibt, L. M., Herrick, H. L., et al. (1957) · Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability on - IRE-AIEE-ACM '57 (Western) · doi:10.1145/1455567.1455599 · Cited by 190
Revised report on the algorithmic language ALGOL 60
Backus, J. (1963) · The Computer Journal · doi:10.1093/comjnl/5.4.349 · Cited by 148
Continuations: A Mathematical Semantics for Handling Full Jumps
Strachey, C., & Wadsworth, C. P. (2000) · LISP and Symbolic Computation · doi:10.1023/a:1010026413531 · Cited by 139
Sabry, A., & Wadler, P. L. (1997) · ACM Transactions on Programming Languages and Systems · doi:10.1145/267959.269968 · Cited by 125
Krishnamurthi, S., Findler, R. B., Felleisen, M., & Flatt, M. (2001) · Cited by 117
Programming Language Pragmatics
', S. (2006) · Cited by 81
Knuth, D. E., & Pardo, L. T. (1980) · Elsevier eBooks · doi:10.1016/b978-0-12-491650-0.50019-8 · Cited by 77
Hucka, M., Finney, A., Sauro, H. M., Bolouri, H., & Bergmann, F. (2004) · Cited by 69
A first-order one-pass CPS transformation
Danvy, O., & Nielsen, L. R. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00733-8 · Cited by 57
The Scheme Programming Language, ANSI Scheme
Dybvig, R. K. (1996) · Medical Entomology and Zoology · Cited by 28
History of Programming Languages
O’Regan, G. (2021) · Springer eBooks · doi:10.1007/978-3-030-66599-9_15 · Cited by 5
Cited by
Tutorial notes on partial evaluation
Consel, C., & Danvy, O. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158707 · Cited by 316
Delta execution for efficient state-space exploration of object-oriented programs
d'Amorim, M., Lauterburg, S., & Marinov, D. (2007) · Proceedings of the 2007 international symposium on Software testing and analysis · doi:10.1145/1273463.1273472 · Cited by 26
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 2008-11-01
- Volume
- 46
- Issue
- 03
- Pages
- 46-1527-46-1527
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W1583092647
- Cited by
- 316
- References
- 73
- Type
- book review
- 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.