每个书目后的页码为其在原书所引用之处。
Abelson, H., and G. J. Sussman. 1985. Structure and Interpretation of Computer Programs. Cambridge, Mass.: MIT Press. (114)
Adobe Systems Inc. 1990. PostScript Language Reference Manual (second edition). Reading, Mass.: Addison-Wesley. (133)
Aho, A. V., B. W. Kernighan, and P. J. Weinberger. 1988. The AWK Programming Language. Reading, Mass.: Addison-Wesley. (13, 132, 265)
Aho, A. V., R. Sethi, and J. D. Ullman. 1986. Compilers: Principles, Techniques, and Tools. Reading, Mass.: Addison-Wesley. (43)
American National Standards Institute. 1990. American National Standard for Information Systems—Programming Language—C. ANSI X3.159-1989. New York. (12)
Andrews, G. R. 1991. Concurrent Programming: Principles and Practice. Menlo Park, Calif.: Addison-Wesley. (463)
Appel, A. W. 1991. Garbage collection. In P. Lee (ed.), Topics in Advanced Language Implementation Techniques , 89-100. Cambridge, Mass.: MIT Press. (100)
Austin, T. M., S. E. Breach, and G. S. Sohi. 1994. Efficient detection of all pointer and array access errors. Proceedings of the SIGPLAN'94 Conference on Programming Language Design and Implementation, SIGPLAN Notices 29 (7), 290-301. July. (85)
Barrett, D. A., and B. G. Zorn. 1993. Using lifetime predictors to improve allocation performance. Proceedings of the SIGPLAN'93 Conference on Programming Language Design and Implementation, SIGPLAN Notices 28 (6), 187-196. June. (98)
Bentley, J. L. 1982. Writing Efficient Programs. Englewood Cliffs, N.J.: Prentice-Hall. (13)
Boehm, H., R. Atkinson, and M. Plass. 1995. Ropes: An alternative to strings. Software—Practice and Experience 25 (12), 1315-30. December. (294)
Boehm, H., and M. Weiser. 1988. Garbage collection in an uncooperative environment. Software—Practice and Experience 18 (9), 807-20. September. (100)
Briggs, P., and L. Torczon. 1993. An efficient representation for sparse sets. ACM Letters on Programming Languages and Systems 2 (1-4), 59-69. March-December. (213,213)
Brinch-Hansen, P. 1994. Multiple-length division revisited: A tour of the minefield. Software—Practice and Experience 24 (6), 579-601. June. (321)
Budd, T. A. 1991. An Introduction to Object-Oriented Programming. Reading, Mass.: Addison-Wesley. (31)
Char, B. W., K. O. Geddes, G. H. Gonnet, B. L. Leong, M. B. Monagan, and S.M. Watt. 1992. First Leaves: A Tutorial Introduction to Maple V. New York: Springer-Verlag. (354)
Clinger, W. D. 1990. How to read floating-point numbers accurately. Proceedings of the SIGPLAN'90 Conference on Programming Language Design and Implementation, SIGPLAN Notices 25 (6), 92-101. June. (239, 402)
Cohen, J. 1981. Garbage collection of linked data structures. ACM Computing Surveys 13 (3), 341-67. September. (100)
Cormack, G. V. 1988. A micro-kernel for concurrency in C. Software—Practice and Experience 18 (5), 485-91. May. (465)
Ellis, M. A., and B. Stroustrup. 1990. The Annotated C ++ Reference Manual . Reading, Mass.: Addison-Wesley. (31, 63)
Evans, D. 1996. Static detection of dynamic memory errors. Proceedings of the SIGPLAN'96 Conference on Programming Language Design and Implementation, SIGPLAN Notices 31 (5), 44-53. May. (14, 85)
Fraser, C. W., and D. R. Hanson. 1995. A Retargetable C Compiler: Design and Implementation. Menlo Park, Calif.: Addison-Wesley. (xi, xiii, 13, 42, 65, 98, 468)
Geddes, K. O., S. R. Czapor, and G. Labahn. 1992. Algorithms for Computer Algebra. Boston: Kluwer Academic. (355)
Gimpel, J. F. 1974. The minimization of spatially-multiplexed character sets. Communications of the ACM 17 (6), 315-18. June. (213)
Goldberg, D. 1991. What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys 23 (1), 5-48. March. (238, 403)
Gosling, J., D. S. H. Rosenthal, and M. J. Arden. 1989. The NeWS Book. New York: Springer-Verlag. (465)
Griswold, R. E. 1972. The Macro Implementation of SNOBOL4. San Francisco: W. H. Freeman (out of print). (42, 132,293)
——. 1980. Programming techniques using character sets and character mappings in Icon. The Computer Journal 23 (2), 107-14. (264)
Griswold, R. E., and M. T. Griswold. 1986. The Implementation of the Icon Programming Language. Princeton, N.J.: Princeton University Press. (133,158)
——. 1990. The Icon Programming Language (second edition). Englewood Cliffs, N.J.: Prentice-Hall. (xii, 132,158, 169, 180, 264, 266, 293)
Grunwald, D., and B. G. Zorn. 1993. CustoMalloc: Efficient synthesized memory allocators. Software—Practice and Experience 23 (8), 851-69. August. (85)
Hansen, W. J. 1992. Subsequence references: First-class values for substrings. ACM Transactions on Programming Languages and Systems 14 (4), 471-89. October. (294, 295)
Hanson, D. R. 1980. A portable storage management system for the Icon programming language. Software—Practice and Experience 10 (6), 489-500. June. (294, 295)
——. 1987. Printing common words. Communications of the ACM 30 (7), 594-99. July. (13)
——. 1990. Fast allocation and deallocation of memory based on object lifetimes. Software—Practice and Experience 20 (1), 5-12. January. (98)
Harbison, S. P. 1992. Modula-3. Englewood Cliffs, N.J.: Prentice-Hall. (31)
Harbison, S. P., and G. L. Steele Jr. 1995. C: A Reference Manual (fourth edition). Englewood Cliffs, N.J.: Prentice-Hall. (12)
Hastings, R., and B. Joyce. 1992. Purify: Fast detection of memory leaks and access errors. Proceedings of the Winter USENIX Technical Conference , San Francisco, 125-36. January. (85)
Hennessy, J. L., and D. A. Patterson. 1994. Computer Organization and Design: The Hardware/Software Interface. San Mateo, Calif.: Morgan Kaufmann. (238, 321,322)
Hoare, C. A. R. 1978. Communicating sequential processes. Communications of the ACM 21 (8), 666-77. August. (464)
Horning, J., B. Kalsow, P. McJones, and G. Nelson. 1993. Some Useful Modula-3 Interfaces. Research Report 113, Palo Alto, Calif.: Systems Research Center, Digital Equipment Corp. December. (31,180)
International Organization for Standardization. 1990. Programming Languages—C. ISO/IEC 9899: 1990. Geneva. (12)
Institute for Electrical and Electronic Engineers. 1995. Information Technology—Portable Operating Systems Interface (POSIX) — Part 1: System Application Programming Interface (API) — Amendment 2: Threads Extension [C Language]. IEEE Standard 1003.1c-1995. New York. Also ISO/IEC 9945-2:1990c. (464)
Jaeschke, R. 1991. The Dictionary of Standard C. Horsham, Penn.: Professional Press Books. (12)
Kernighan, B. W., and R. Pike. 1984. The UNIX Programming Environment. Englewood Cliffs, N.J.: Prentice-Hall. (13, 13)
Kernighan, B. W., and P. J. Plauger. 1976. Software Tools. Reading, Mass.: Addison-Wesley. (12,295)
——. 1978. The Elements of Programming Style (second edition). Englewood Cliffs, N.J.: Prentice-Hall. (13)
Kernighan, B. W., and D. M. Ritchie. 1988. The C Programming Language (second edition). Englewood Cliffs, N.J.: Prentice-Hall. (12, 13, 85, 86)
Kleiman, S., D. Shah, and B. Smaalders. 1996. Programming with Threads. Upper Saddle River, N.J.: Prentice-Hall. (464, 468)
Knuth, D. E. 1973a. The Art of Computer Programming: Volume 1, Fundamental Algorithms (second edition). Reading, Mass.: Addison-Wesley. (13, 85,100, 113, 196)
——. 1973b. The Art of Computer Programming: Volume 3, Searching and Sorting. Reading, Mass.: Addison-Wesley. (42, 42)
——. 1981. The Art of Computer Programming: Volume 2, Seminumerical Algorithms (second edition). Reading, Mass.: Addison-Wesley. (321,354, 355)
——. 1992. Literate Programming. CSLI Lecture Notes Number 27. Stanford, Calif.: Center for the Study of Language and Information, Stanford Univ. (12)
Koenig, A. 1989. C Traps and Pitfalls. Reading, Mass.: Addison-Wesley. (13)
Larson, P.-A. 1988. Dynamic hash tables. Communications of the ACM 31 (4), 446-57. April. (133,134)
Ledgard, H. F. 1987. Professional Software Volume II. Programming Practice. Reading, Mass.: Addison-Wesley. (13)
Maguire, S. 1993. Writing Solid Code. Redmond, Wash.: Microsoft Press. (13, 31, 64, 85, 86)
Marlin, C. D. 1980. Coroutines: A Programming Methodology, a Language Design and an Implementation. Lecture Notes in Computer Science 95, New York: Springer-Verlag. (464)
McConnell, S. 1993. Code Complete: A Practical Handbook of Software Construction. Redmond, Wash.: Microsoft Press. (13)
McIlroy, M. D. 1968. Coroutines. Unpublished Report, Murray Hill, N.J.: Bell Telephone Laboratories. May. (464)
——. 1990. Squinting at power series. Software—Practice and Experience 20 (7), 661-83. July. (464)
McKeeman, W. M., J. J. Horning, and D. B. Wortman. 1970. A Compiler Generator , Englewood Cliffs, N.J.: Prentice-Hall (out of print). (294)
Meyer, B. 1992. Eiffel: The Language. London: Prentice-Hall International. (31, 63)
Musser, D. R., and A. Saini. 1996. STL Tutorial and Reference Guide: C ++ Programming with the Standard Template Library. Reading, Mass.: Addison-Wesley. (31)
Nelson, G. 1991. Systems Programming with Modula-3. Englewood Cliffs, N.J.: Prentice-Hall. (31, 63, 169,464)
Parnas, D. L. 1972. On the criteria to be used in decomposing systems into modules. Communications of the ACM 5 (12), 1053-58. December. (30)
Pike, R. 1990. The implementation of Newsqueak. Software—Practice and Experience 20 (7), 649-59. July. (464)
Plauger, P. J. 1992. The Standard C Library. Englewood Cliffs, N.J.: Prentice-Hall. (12, 30, 238, 264)
Press, W. H., S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. 1992. Numerical Recipes in C: The Art of Scientific Computing (second edition). Cambridge, England: Cambridge University Press. (402,402)
Pugh, W. 1990. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM 33 (6), 668-76. June. (181)
Ramsey, N. 1994. Literate programming simplified. IEEE Software 13 (9), 97-105. September. (13)
Reppy, J. H. 1997. Concurrent Programming in ML. Cambridge, England: Cambridge University Press. (465)
Richter, J. 1995. Advanced Windows: The Developer's Guide to the Win32 API for Windows NT 3.5 and Windows 95. Redmond, Wash.: Microsoft Press. (468)
Roberts, E. S. 1989. Implementing Exceptions in C. Research Report 40, Palo Alto, Calif.: Systems Research Center, Digital Equipment Corp. March. (63, 64)
——. 1995. The Art and Science of C: An Introduction to Computer Science. Reading, Mass.: Addison-Wesley. (31,264)
Schneier, B. 1996. Applied Cryptography: Protocols, Algorithms, and Source Code in C (second edition). New York: John Wiley. (402)
Sedgewick, R. 1990. Algorithms in C. Reading, Mass.: Addison-Wesley. (xii, xiv, 13, 42, 134, 196)
Sewell, W. 1989. Weaving a Program: Literate Programming in WEB. New York: Van Nostrand Reinhold. (13)
Steele, Jr., G. L., and J. L. White. 1990. How to print floating-point numbers accurately. Proceedings of the SIGPLAN'90 Conference on Programming Language Design and Implementation, SIGPLAN Notices 25 (6), 112-26. June. (239, 239)
Stevens, W. R. 1992. Advanced Programming in the UNLX Environment. Reading, Mass.: Addison-Wesley. (465)
Tanenbaum, A. S. 1995. Distributed Operating Systems. Englewood Cliffs, N.J.: Prentice-Hall. (464, 467)
Ullman, J. D. 1994. Elements of ML Programming. Englewood Cliffs, N.J.: Prentice-Hall. (114)
Vo, K. 1996. Vmalloc: A general and efficient memory allocator. Software—Practice and Experience 26 (3), 357-74. March. (99)
Wampler, S. B., and R. E. Griswold. 1983. Co-expressions in Icon. Computer Journal 26 (1), 72-78. January. (464)
Weinstock, C. B., and W. A. Wulf. 1988. Quick fit: An efficient algorithm for heap storage management. SIGPLAN Notices 23 (10), 141-48. October. (85)
Wolfram, S. 1988. Mathematica: A System for Doing Mathematics by Computer. Menlo Park, Calif.: Addison-Wesley. (354)
Zorn, B. G. 1993. The measured cost of conservative garbage collection. Software — Practice and Experience 23 (7), 733-56. July. (100)