Aho, Alfred V. and Jeffrey D. Ullman. 1972. Theory of Parsing, Translation and Compiling. Englewood Cliffs, NJ: Prentice Hall.

Aho, Alfred V., Ravi Sethi, and Jeffrey D. Ullman. 1986. Compilers: Principles, Techniques, and Tools. Reading, MA: Addison-Wesley.

American National Standards Institute (ANSI)/Institute of Electric and Electronics Engineers (IEEE). 1993. X3.215-199x. Draft Proposed American National Standard for Information—Programming Languages—Forth. X3J14 dpANS-6—June 30.

Anderson, L. W. and D. R. Krathwohl. 2001. A Taxonomy for Learning, Teaching, and Assessment: A Revision of Bloom’s Taxonomy of Educational Objectives. New York: Longman.

Barendregt, H. P. 1984. The Lambda Calculus: Its Syntax and Semantics. Amsterdam: North Holland.

Bloom, B. S. 1956. Taxonomy of Educational Objectives, Handbook I: The Cognitive Domain. New York: David McKay.

Boehm, Corrado and Guiseppe Jacopini. 1966. “Flow Diagrams, Turing Machines and Languages with Only Two Formation Rules.” Communications of the ACM 9 (May): 366–71.

Bransford, John D., Ann L. Brown, and Rodney R. Cocking, eds. 2000. How People Learn: Brain, Mind, Experience, and School. Washington, D.C.: National Academies Press.

Brodie, L. 1981. Starting FORTH. Englewood Cliffs, NJ: Prentice Hall.

——. 1984. Thinking FORTH. Englewood Cliffs, NJ: Prentice Hall.

Brooks, F. P. 1975. The Mythical Man Month. Reading, MA: Addison-Wesley.

Chandy, K. Mani and Jayadev Misra. 1988. Parallel Program Design: A Foundation. Reading, MA: Addison-Wesley.

Chomsky, Noam. 1956. “Three Models for the Description of Language.” IRE Transactions on Information Theory 2: 113–124.

——. 1959. “On Certain Formal Properties of Grammar.” Information and Control 1: 91–112.

Church, Alonzo. 1936. “A Note on the Entscheidungsproblem.” Journal of Symbolic Logic 1: 40–41.

——. 1941. The Calculi of Lambda-Conversion. Annals of Mathematics Studies. Princeton, NJ: Princeton University Press.

Crimmins, Mark. 1998. “Language, Philosophy of.” In Routledge Encyclopedia of Philosophy, ed. E. Craig. London: Routledge (retrieved February 2005, from http://www.rep.routledge.com/article/U017).

Dijkstra, Edsger W. 1968. “Go To Statement Considered Harmful.” Communications of the ACM 11(3): 147–48.

Fleming, Quentin W. and Joel M. Koppelman. 2000. Earned Value Project Management, 2nd edition. Newtown Square, PA: Project Management Institute.

Foster, Ian and Stephen Taylor. 1990. Strand: New Concepts in Parallel Programming. Upper Saddle River, NJ: Prentice Hall.

Halaas, A., B. Svingen, M. Nedland, P. Saetrom, O. Snove, Jr., and O. R. Birkeland. 2004. “A Recursive MISD Architecture for Pattern Matching.” IEEE Transactions on Very Large Scale Integration (VLSI) Systems 12(7): 727–34.

Hankin, C. 2004. Lambda Calculi: A Guide for Computer Scientists. London: King’s College Publications.

Heuring, Vincent P. and Harry F. Jordan. 2003. Computer Architecture and Organization: An Integrated Approach. New York: John Wiley & Sons.

Hoare, C. A. R. 1969. “An Axiomatic Basis for Computer Programming.” Communications of the ACM 12(10): 576–80.

——. 1974. “Monitors: An Operating System Structuring Concept.” Communications of the ACM 17(10): 549–57.

Humphrey, Watts S. 1996. Introduction to the Personal Software Process. Reading, MA: Addison-Wesley.

Jones, Richard and Rafael Lins. 1996. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. New York: John Wiley & Sons.

Kleene, S. C. 1936. “Lambda-Definability and Recursiveness.” Duke Mathematical Journal 2: 340–53.

Louden, Kenneth C. 2003. Programming Languages: Principles and Practice, 3rd edition. Belmont, CA: Thompson, Brooks/Cole.

McCarthy, John. 1963. “A Basis for a Mathematical Theory of Computation.” Pp. 33–70 in Computer Programming and Formal Systems, ed. P. Braffort and D. Hirschberg. Amsterdam: North Holland.

Moore, C. H. 1980. “The Evolution of FORTH—an Unusual Language.” Byte (August).

National Research Council. 2000. How People Learn: Brain, Mind, Experience, and School, expanded edition. Washington, D.C.: National Academies Press.

Paulson, Lawrence C. 1996. ML for the Working Programmer. London: Cambridge University Press.

Plotkin, Gordon, D. 1981. A Structural Approach to Operational Semantics. Technical report DAIMI FN-19. Computer Science Department, Aarhus University, Aarhus, Denmark.

Pólya, George. 1957. How to Solve It, 2nd edition. Princeton, NJ: Princeton University Press.

Pratt, Terrence W. and Marvin V. Zelkowitz. 1995. Programming Languages: Design and Implementation, 4th edition. Upper Saddle River, NJ: Prentice Hall.

Russell, Bertrand. 1908. “Mathematical Logic as Based on the Theory of Types.” American Journal of Mathematics 30: 222–62 (reprinted 1967, in Jean van Heijenoort, From Frege to Gödel, pp. 152–82. Cambridge, MA: Harvard University Press).

Simon, H. A. 1969. The Sciences of the Artificial. Cambridge, MA: MIT Press.

Turing, A. 1936. “On Computable Numbers, with an Application to the Entscheidungsproblem.” Proceedings of the London Mathematical Society, Ser. 2 42: 230–65.

Weiss, Mark Alan, Data Structures and Algorithms in JAVA. Additions-Wesley 2003.