The main course page is here; this page is automatically generated from papers tagged with classic-papers-fall09 in the Concertrg CiteULike library.
Reading List:
- September 9 (Karl Crary)
- An axiomatic basis for computer programming. C. A. R. Hoare. 1969.
- Guarded commands, nondeterminacy and formal derivation of programs. Edsger W. Dijkstra. 1975.
- Proof of a program: {FIND}. C. A. R. Hoare. 1971.
- September 14 (Rob Simmons)
- Some Properties of Conversion. Alonzo Church and J. B. Rosser. 1936.
- September 16 (Ruy Ley-Wild)
- The next 700 programming languages. P. J. Landin. 1966.
- September 21 (William Lovas)
- Investigations into Logical Deduction. Gerhard Gentzen. 1964.
- September 23 (Anand Subramanian)
- The Mechanical Evaluation of Expressions. P. J. Landin. 1964.
- September 28 (Luke Zarko)
- Recursive functions of symbolic expressions and their computation by machine, Part I. John McCarthy. 1960.
- October 5 (Michael Ashley-Rollman)
- Communicating sequential processes. C. A. R. Hoare. 1978.
- October 7 (Chris Martens)
- On the Meanings of the Logical Constants and the Justifications of the Logical Laws. Per Martin-Löf. 1996.
- October 12 (Miguel Silva)
- Definitional interpreters for higher-order programming languages. John C. Reynolds. 1972.
- October 14 (Rob Simmons)
- Toward A Mathematical Semantics for Computer Languages. Dana Scott and Christopher Strachey. 1971.
- November 9 (Rob Arnold)
- Types, Abstraction and Parametric Polymorphism. John C. Reynolds. 1983.