This course will help you learn how programming languages are designed, specified, and implemented. You will learn both about broad areas of commonality that underlie many superficially different langauges and about the critical distinctions between langauges that may at first glance seem similar. Although we will spend some time working with a few example languages, the goal is not to make you a master of these languages, but rather to give you ways to think about languages, which will serve you well as you encounter future languages.
I will be available in my office (OHS 303) 9:00-11:20 on Mondays and Fridays as well as by appointment. Or try your luck: just stop by and see whether my door is open. You may send me electronic mail at max@gustavus.edu or call me at extension 7466. I'll try to put any updates to my office hours on my web page, so check there if in doubt.
All course materials will be available through my World Wide Web page. The URL for this course is http://gustavus.edu/+max/courses/S2008/MCS-287/. After this syllabus I will give hardcopy handouts only to those students who want them.
This course has MCS-178 and MCS-236 as prerequisites. In MCS-178 you previewed several topics we cover in this course: grammars, abstract syntax trees, evaluation, and the stack-oriented use of a computer's memory to support recursive procedure invocations. You also were introduced to object-oriented programming and Java, which we will review and build upon. (We will also build on your knowledge of functional programming, though not in Scheme.) From MCS-236, you should be comfortable with basic mathematical concepts and notations, such as sets, functions, and relations.
The primary text for this course is Modern Programming Languages: A Practical Introduction, by Adam Brooks Webber. In order to rememdy one of the most important regards in which this book is out of date, I've also linked into the syllabus a supplementary reading about Java generics. In both cases, numerically specified readings in the syllabus refer to chapters and sections.
There will be two intra-term tests as shown on the syllabus and a final exam as scheduled by the registrar. If you have a conflict with a testing time, please contact me as soon as possible to make an alternative arrangement.
Exams will be closed-book and mostly closed-notes. You may, however, use a single 8 1/2 by 11 sheet of paper with hand-written notes for reference. (Both sides of the sheet are OK.)
Some days, shown in the syllabus, we will meet in the OHS 326 computer lab rather than in the usual classroom. Each lab assignment will also require you to spend additional time out of class.
You are expected to be familiar with the college academic honesty honor code policy and to comply with that policy. If you have any questions about it, please ask.
The syllabus shows due dates for eight homework assignments; each will typically consist of a few problems. You must turn in all the problems in an assignment by that assignment's due date, but may turn in individual problems earlier if you wish. I will mark each problem as "mastered" or "not yet mastered," and return them to you as rapidly as I can. For those not yet mastered, I may write some brief indication of what area needs work, but you should really take these as an invitation to come talk. You may turn in a revised version of each problem (with the previous graded version attached) however many times it takes to reach the "mastered" point, even after the original due date. The only restrictions are these:
You must have submitted an initial attempt by the original due date.
No revision will be accepted for homeworks 1 and 2 after 8:00am March 10th, for homeworks 3, 4, and 5 after 8:00am April 24th, or for homeworks 6, 7 and 8 after 8:00am May 20th. These cutoff dates are intentionally synchronized with the test review days; the point of the homeworks is to prepare you for the tests.
Note that if you turn in each homework problem as soon as you can do it, rather than saving them for the assignment due dates, you will have more opportunity for revision and resubmission before the cutoff dates listed above. Particularly for the last homeworks before each cutoff date (and test), I can't guarantee you'll have time for a revision cycle otherwise.
The homework portion of your course grade will simply be determined by the fraction of the homework problems you eventually mastered.
All lab assignments are due at the beginning of class on the day indicated. Late lab assignments will be penalized by one “grade notch” (such as A to A- or A- to B+) for each weekday late or fraction thereof. However, no late assignments will be accepted after graded assignments are handed back or solutions are distributed.
If you are too sick to complete an assignment on time, you will not be penalized. Simply write “late due to illness” at the top of the assignment, sign your name and hand it in. Other circumstances will be evaluated on a case-by-case basis.
Please point out any arithmetic or clerical error I make in grading, and I will gladly fix it. You may also request reconsideration if I have been especially unjust.
The course components will contribute to your grade in the following proportion:
However, I reserve the right to subjectively adjust your final grade. Please see me if you have any question how you stand. Class participation is not graded; however, it allows you to find and repair the gaps in your understanding before doing the assignments, and thus can dramatically improve your grade. You are responsible for all course material, whether or not you are present when it was covered or distributed.
All assignments should be readily readable and should not presuppose that I already know what you are trying to say. Use full English sentences where appropriate (namely almost everywhere) and clear diagrams, programs, etc. Remember that your goal is to communicate clearly and that the appearance of these technical items plays a role in this communication process. Be sure your assignments are always stapled together and that your name is always on them.
If you have a learning, psychological, or physical disability for which a reasonable accommodation can be made, I would be happy to refer you to the college's disability services coordinator and to cooperate in the accommodation process. It is generally best if this can be done as soon as possible.
This is my best guess as to the rate at which we will cover material. However, don't be shocked if I have to pass out one or more revised syllabi.
| Date | Reading | Topic | Due |
|---|---|---|---|
| 2/11 | 1.1-2.5 | Overview and grammars | |
| 2/12 | 2.6-2.8 | More on grammars | |
| 2/14 | 3 | Syntax meets semantics | |
| 2/15 | 4 | Language systems | |
| 2/18 | 5 | A first look at ML | HW 1 |
| 2/19 | Lab 1: ML Programming | ||
| 2/21 | 6 | Types | |
| 2/22 | 7 | A second look at ML | |
| 2/25 | 8 | Polymorphism | |
| 2/26 | Lab 1 concludes | ||
| 2/28 | 9 | A third look at ML | |
| 2/29 | 10 | Scope | |
| 3/3 | 11 | A fourth look at ML | HW 2 |
| 3/4 | 12.1-12.6 | Activation records | |
| 3/6 | 12.7-12.9 | Closures | Lab 1 |
| 3/7 | More on activation records and closures | ||
| 3/10 | Review/catch-up | ||
| 3/11 | Intra-term exam 1 | ||
| 3/13 | No class | ||
| 3/14 | No class | ||
| 3/17 | 13 | A first look at Java | |
| 3/18 | 14.1-14.4 | Memory management | |
| 3/20 | 14.5-14.6 | Garbage collection | HW 3 |
| 3/31 | No class | ||
| 4/1 | 15 | A second look at Java | |
| 4/3 | Lab 2: An Interpreter | ||
| 4/4 | Lab 2 continues | ||
| 4/7 | Bracha 1-3 | Java generics | |
| 4/8 | Lab 2 concludes | ||
| 4/10 | Bracha 4-6 | More Java generics | |
| 4/11 | Bracha 7-11 | Yet more Java generics | Lab 2 |
| 4/14 | 16 | Object orientation | |
| 4/15 | Lab 3: Java Generics | HW 4 | |
| 4/17 | Lab 3 continues | ||
| 4/18 | 17 | A third look at Java | |
| 4/21 | 18 | Parameters | |
| 4/22 | Lab 3 concludes | HW 5 | |
| 4/24 | Review/catch-up | ||
| 4/25 | Intra-term exam 2 | ||
| 4/28 | 19.1-19.7 | A first look at Prolog | Lab 3 |
| 4/29 | 19.8-19.11 | More prolog | |
| 5/1 | Lab 4: Parsing and Analysis in Prolog | ||
| 5/2 | 20.1-20.4 | Prolog implementation | HW 6 |
| 5/5 | 20.5-20.7 | More about Prolog | |
| 5/6 | Lab 4 continues | ||
| 5/8 | 21 | Cost models | |
| 5/9 | 22 | Final Prolog class | HW 7 |
| 5/12 | 23.1-23.3 | Natural semantics | |
| 5/13 | Lab 4 continues | ||
| 5/15 | Lab 4 concludes | HW 8 | |
| 5/16 | 23.4-23.6 | More on semantics | |
| 5/19 | 24 | History of programming languages | Lab 4 |
| 5/20 | Review/catch-up | ||