Instructor: Eugene Wallingford
- office: 305 ITTC (the old East Gym)
- phone: 273-5919
- email: email@example.com
- web: http://www.cs.uni.edu/~wallingf/
- my office hours and schedule
- The course web page, http://www.cs.uni.edu/~wallingf/teaching/cs3540/
- The course mailing list, firstname.lastname@example.org
- The programming environment Dr. RacketNote that to send messages to the course mailing list, you must send from the mailing address from which you are subscribed. By default, that is your uni.edu e-mail address. If you prefer to be subscribed from some other address, just let me know.
- The Little Schemer, by Daniel Friedman and Matthias FelleisenThe Little Schemer uses an unusual question-and-answer format to help you to think and program in a new style. It's well worth a few dollars. Some people really like this format. If you are one of them, then take a look at The Seasoned Schemer, also by Friedman and Felleisen.
- Revised5 Report on the Algorithmic Language Scheme, aka "R5RS"This is the Scheme language definition, version 5. It contains information on all the standard data types and procedures of the language and is a simple-to-use reference for the course. Jump right to the table of contents to look up specific topics.
- The Scheme Programming Language, by Kent DybvigThis textbook gives a thorough introduction to Scheme, with some tutorial material and several cool examples. You can buy also a print copy of Dybvig's book from a variety of on-line booksellers.
The study of programming languages and paradigms is fundamental to the discipline of computer science. As a computer scientist, regardless of your specialty, you should have a deep understanding of the principles of programming languages. They govern the design and use of every language that you will encounter. They affect the design of the applications you encounter. They even affect the architecture of the machines on which we run our programs. If you understand these design principles, then you will find it easier to be become an effective user of any language, to adapt to new paradigms as they evolve, and to design and implement new languages when necessary. You may be surprised to learn just how often you find yourself implementing small languages as a part of your applications.
This course aims to help you develop a deep, hands-on understanding of the essentials of programming languages. It does so by confronting you with the most fundamental idea in computer programming: The interpreter for any computer language is just another program. We will first lay the foundation for the analytic study of programming languages and then use those ideas to develop a sequence of increasingly detailed interpreters for a simple language.
One prerequisite to this approach is that you learn a programming style that makes it relatively easy to build language interpreters. We will learn Racket, a programming language that allows us to treat programs as data and vice versa. One of the extra benefits of learning Racket is that you will learn to program in a functional style, which will expand your programming repertiore. It will be the third "paradigm" in which you can program, in addition to procedural (Python, Ada, C) and object-oriented (Java, Python). Functional programming differs from the other two styles in a very important way: in functional programming, we compute for values, rather than for side effects.
By the end of the semester, you should feel comfortable:
Note that this course is not about any particular programming language, nor even about a smorgasbord of different languages. We will not study the syntax of new programming languages so that you can use them to write programs. Instead, we will seek develop the knowledge and skills necessary for you to be able to study other languages on your own. The course does introduce you to Scheme, a small and malleable programming language, as a tool for expressing the features of languages and writing language interpreters. It will be the microscope we use to study the broader principles of programming languages and paradigms.
You will earn your grade based on your performance on homework assignments, quizzes, and the final examination. I assign final grades using the following distribution:
Grades will be assigned using an absolute scale:
This means that there is no curve. However, I reserve the right to lower the individual grade boundaries at the end of the term if I think that produces grades that better reflect what students have achieved.
The following schedule gives a rough sketch of the topics we will cover and the distinguished dates this semester. The quiz dates are tentative. If I decide to change a quiz date, I will notify you at least one week prior to the quiz date.
|1||01/12 - 01/14||Introduction to course and Racket||.|
|2||01/19 - 01/21||Functional programming and Racket||.|
|3||01/26 - 01/28||Functional programming and Racket||.|
|4||02/02 - 02/04||Induction and recursion||Exam 1 (Tue)|
|5||02/09 - 02/11||Recursive programming techniques||.|
|6||02/16 - 02/18||Recursive programming techniques||.|
|7||02/23 - 02/25||Recursive programming techniques||.|
|8||03/01 - 03/03||Syntactic abstraction||Exam 2 (Tue)|
|9||03/08 - 03/10||Syntactic abstraction||.|
|.||03/15 - 03/17||spring break||.|
|10||03/22 - 03/24||Syntactic abstraction||.|
|11||03/29 - 03/31||Syntactic abstraction||.|
|12||04/05 - 04/07||Data abstraction||Exam 3 (Tue)|
|13||04/12 - 04/14||Data abstraction||.|
|14||04/19 - 04/21||Interpreters||.|
|15||04/26 - 04/28||Interpreters; course wrap-up||.|
The FINAL EXAM is Thursday, May 5, from 3:00 PM - 4:45 PM.