Bibliography

AbSus85

Abelson, H., Sussman, G.J., and Sussman, J.

Structure and Interpretation of Computer Programs. MIT Press, Cambridge, Massachusetts, 1985.

Backus78

Backus, J. W., ``Can Programming Be Liberated from the von Neumann Style?'' CACM, vol. 21, no. 8, pp. 613-614.

Bare84

Barendregt, H. P., The Lambda Calculus: Its Syntax and Semantics. 2d ed. North-Holland, 1984.

BirdWad88

Bird, R.A. and Wadler, P.L.,

Introduction to Functional Programming. Prentice/Hall International, 1988.

Boehm66

Boehm, C. and Jacopini, G., ``Flow Diagrams, Turnign Machines, and Languages with Only Two Foramation Rules.'' CACM, vol. 9, no. 5, pp. 366-371.

CF68

Curry. H. B. and Feys, R., Combinatory Logic, Vol. I. North-Holland, 1968.

CHS72

Curry. H. B., Hindley, J. R., and Seldin, J. P., Combinatory Logic, Vol. II. North-Holland, 1972.

DJL88

Deransart, P., Jourdan, M., and Lorho, B., Attribute Grammars: Definitions, Systems and Bibliography. Lecture Notes in Computer Science 323. Springer-Verlag, 1988.

Dijk68

Dijkstra, E. W., ``Goto Statement Considered Harmful.'' Communications of the ACM vol. 11 no. 5 (May 1968): pp. 147-149.

Foster96

Foster, I., Compositional Parallel Programming Languages TOPLAS Vol 18 No. 4 (July 1996): pp. 454-476.

Gries81

Gries, D., The Science of Programming Springer-Verlag, New York, 1981.

Hehner84

Hehner, E. C. R.,

The Logic of Programming. Prentice/Hall International, 1984.

Hend80

Henderson, Peter,

Functional Programming: Application and Implementation. Prentice/Hall International, 1980.

HS86

Hindley, J. R., and Seldin, J. P., Introduction to Combinators and $\lambda$ Calculus, Cambridge University Press, London, 1986.

HU79

Hopcroft, J. E. and Ullman, J. D., Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.

Knuth68

Knuth, D. E., ``Semantics of context-free languages.'' Mathematical Systems Theory, vol. 2, 1968, pp. 127-145. Correction in Mathematical Systems Theory, vol. 5, 1971, p. 95.

Kowalski79

Kowalski, R. A., ``Algorithm = Logic + Control''. CACM vol. 22 no. 7, pp. 424-436, 1979.

Landin66

Landin, P. J., The next 700 programming languages, Communications of the ACM 9, 157-64 1966.

McCarthy60

McCarthy, J., ``Recursive functions of symbolic expressions and their computation by machine, Part I.'' CACM vol. 3 no. 4, pp. 184-195, 10, 1960.

McCarthy65

McCarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., and Levin, M., LISP 1.5 Programmer's Manual. 2d ed. MIT Press, Cambridge, MA. 1965.

MLennan90

MacLennan, Bruce J.,

Functional programming: practice and theory. Addison-Wesley Publishing Company, Inc. 1990.

Miller67

Miller, G. A.,

The Psychology of Communication. Basic Books, New York, 1967.

PJones87

Peyton Jones, Simon L.,

The Implementation of Functional Programming Languages. Prentice/Hall International, 1987.

PittPet92

Pittman, T. and Peters, J.,

The Art of Compiler Design: Theory and Practice. Prentice-Hall, 1992.

Pratt84

Pratt, T. W.,

Programming Languages: Design and Implementation. Printice-Hall, 1984.

Revesz88

Révész, G. E., Lambda-Calculus, Combinators, and Functional Programming. Cambridge University Press, Cambridge, 1988.

Schmidt88

Schmidt, D. A., Denotational Semantics: A Methodology for Language Development. Wm. C. Brown, Dubuque, Iowa, 1988.

SchFre85

Schreiner, A. T. and Freidman, H. G., Introduction to Compiler Construction with Unix Prentice-Hall, 1985.

Scott87

Scott, D. S., Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1987.

Steele84

Steele, G. L., Jr., Common Lisp. Digital Press, Burlington, MA. 1984.

Tenn81

Tennent, R. D., Principles of Programming Languages, Prentice-Hall International, 1981.

Wegner90

Wegner, Peter, ``Concepts and Paradigms of Object-Oriented Programming.'' OOPS Messenger vol. 1 no. 1 (August 1990): pp. 7-87.

Worf56

Worf, Benjamin,

Language thought and reality, MIT Press, Cambridge Mass., 1956.