Teaching     Home


News


Course             

CS 68 | Principles of Programming Languages | Winter 2000
Lecture

Fairchild 101 | MWF 1:45-2:50 | XHr 1:00-1:50 R
Instructor

Hany Farid | Sudikoff 208 | 646.2761
office hours: MF 3:00-4:00 | W 12:30-1:30
TA

Yougu.Yuan @ dartmouth.edu | Sudikoff 106 | 646.3297
office hours: TuTh 2:00-3:00

David.A.Castleman @ dartmouth.edu
lab hours (005): W 3:30-5:00 | Th 6:00-7:30


Textbook

Programming Languages, Principles and Practice, Kenneth C. Louden
Computing

The linux boxes in Sudikoff 005 support all the neccessary programming languages. You should make sure that any code you write compiles and runs on these machines.


Syllabus
     o History of programming languages
     o Abstractions in programming languages
     o Scanning/Parsing (flex/bison)
     o Basic semantics
     o Type checking
     o Lambda calculus
     o Scheme
     o ML
     o Prolog
     o Matlab

Readings

Chapters 1,2 (introduction)
Chapters 4,5 (syntax/semantics)
Chapter 6 (type checking)
Chapter 10 (functional programming)
Chapter 11 (logic programming)

Documentation
Bison | C | Flex | ML | Prolog | Scheme: user manual | programmer's guide


Grading

Homework (35%) | Midterm (30%) | Final (35%)
Homework

There will be weekly homeworks given on Friday. Homework is due in class on the following Friday. Submit a hardcopy of any written questions, a hardcopy of any programming questions, and sample output. Homeworks received after Friday class will lose 20%, on Saturday 30%, on Sunday 40%, on Monday 50%, and will not be accepted afterwards. At any time during the term you may have a one week extension on any single homework.
Homework #1 | Homework #2 | Homework #3 | Homework #4 | Homework #5
Electronic submission guidelines

Exam The midterm and final will be in-class exams.
Sample Problems 1 | Sample Problems 2


Teaching     Home