---
>
39,43c39
< COMP 411
< > Professor Swarat Chaudhuri >
58c56 < Lecture: Room 1042, Duncan Hall, Monday, Wednesday, Friday, 1:00pm–1:50pm --- > Fall 2011: Room 1042, Duncan Hall, Monday, Wednesday, Friday, 1:00pm–1:50pm 60,61c58,59 < For more information on the course staff including office hours, see course information. < --- > For more information on the course staff including office hours, see course information. > 64c62 <A secondary theme is software engineering. All of the < programming assignments in this course are conducted in Scala < using test-driven development and < pair-programming, two of the major tenets of Extreme < Programming. Scala is a putative successor to Java and runs on < the Java Virtual Machine. Scala is fully compatible with < compiled Java code. The Scala core libraries are an extension < of the Java core libraries. In fact, it is possible to develop < projects written partly in Scala and partly in Java, although we < do not recommend using Java instead of Scala unless there is a < strong external reason such as a project that extends an < existing Java code base. --- > In the lecture materials, interpreters are written in concise functional notation using Scheme. > In some cases, supplementary material showing > how the same interpreters can be written in OCaml (using explicit typing) are provided. While Java is a very good vehicle > for implementing these interpreters, it is not a good conceptual representation because it is much too wordy and > the OO structure obscures the simple algebraic structure of abstract syntax and structural recursion used to defin > interpretation. >
> A secondary theme is software engineering. All of the programming assignments in this course are conducted in Java using test-driven development and pair-programming, two of the major tenets of Extreme Programming. 136c121 < methods) are left to COMP 412, a --- > methods) are left to COMP 412, a 151,154c136,138 < raise certain classes of error signals. Memory safety guarantees < that programs release memory if it is provably useless (using graph < reachability [pointer-chasing] and perhaps more powerful techniques) for the < remainder of the evaluation. Type safety typically implies on --- > raise certain classes of error signals. Memory safety guarantees > that programs release memory if it is provably useless for the > remainder of the evaluation. Type safety typically depends on 171,173c155,156 < a process which is explored in more detail in < COMP 412
Powerpoint slides for selected lectures are available in this directory. 237c214 < --- > 1034,1056d963 <