CS Classics Course

From Digital Grammars Wiki

This is the unofficial home page of the PhD course "Classical Papers in Computer Science" at the Department of Computer Science and Engineering at Chalmers University of Technology and Göteborg University.

Note: to protect it from spam, this page can only be edited by logged-in users. Create an account if you want to edit it.

Mailing list

There is a Google Group for the course.

Schedule

We meet every Monday at 15.15.

Date	Location	Person	Paper
2007-03-26	SGSR	Andreas Larsson	E.W. Dijkstra, Recursive Programming
2007-04-02 Time: 16.05	SGSR	Björn Bringert	P. J. Landin, The next 700 programming languages
2007-04-09	SGSR	Easter Monday	-
2007-04-16	SGSR	Ulf Norell	Hoare, An Axiomatic Basis for Computer Programming
2007-04-23 1000	ES52 (SIC!)	Emil Axelsson	J. Backus, Can programming be liberated from the von Neumann style?
2007-04-30	SGSR	HÃ¥kan Burden	Turing, On computable numbers, with an application to the Entscheidungsproblem
2007-05-07 Time: 16.15	SGSR	Alejandro Russo	Milner: A theory of type polymorphism in programming (Additional material Principal type-schemes for functional programs)
2007-05-14	SGSR	Harald Hammarström	Boyer-Moore. A Fast String Searching Algorithm
2007-05-21	SGSR	Fredrik Lindblad	J. McCarthy: A Basis For A Mathematical Theory Of Computation
2007-05-28	SGSR	Marcin Zalewski	Knuth: Structured Programming with go to Statements (see also the famous paper by Dijkstra Go to statement considered harmful)
2007-06-11	SGSR	Philipp Ruemmer	[http://www.cs.chalmers.se/~philipp/restricted 1000 /owicki-gries.pdf Susan Owicki and David Gries: An axiomatic proof technique for parallel programs I]
2007-10-15	SGSR	Daniel Hedin	A Semantics of Multiple Inheritance
2007-10-22	SGSR	Tobias Gedell	David Lorge Parnas: Software Aspects of Stategic Defense Systems
2007-11-05 Time: 16.15	5453	Aslan Askarov	McCarthy: Recursive functions of symbolic expressions and their computation by machine, part 1. Slides from the talk
2007-11-19	SGSR	Jean-Philippe Bernardy	On Understanding Types, Data Abstraction, and Polymorphism