Lambda Forever!

Course Syllabus


CS 3540

Programming Languages
and Paradigms

Spring Semester 2013



[ Basics | Goals | Requirements | Evaluation | Policies | Tentative Schedule ]

Basics

Instructor: Eugene Wallingford

Resources



Course Goals

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 Scheme, a programming language that allows us to treat programs as data and vice versa. One of the extra benefits of learning Scheme 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.



Course Requirements



Course Evaluation

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:


Item Number Weight
Homework 10-12 35%
Quizzes 4-5 35%
Final exam 1 30%

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.



Course Policies



Tentative Schedule

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.




Week Dates Topics Special Events
1 01/15 - 01/17 Introduction to course and Scheme .
2 01/22 - 01/24 Functional programming and Scheme .
3 01/29 - 01/31 Functional programming and Scheme .
4 02/05 - 02/07 Induction and recursion Quiz 1 (Tue)
5 02/12 - 02/14 Recursive programming techniques .
6 02/19 - 02/21 Recursive programming techniques .
7 02/26 - 02/28 Recursive programming techniques .
8 03/05 - 03/07 Syntactic abstraction Quiz 2 (Thu)
9 03/12 - 03/14 Syntactic abstraction .
. 03/19 - 03/21 spring break .
10 03/26 - 03/28 Syntactic abstraction .
11 04/02 - 04/04 Data abstraction Quiz 3 (Tue)
12 04/09 - 04/11 Data abstraction .
13 04/16 - 04/18 Data abstraction Quiz 4 (Thu)
14 04/23 - 04/25 Interpreters .
15 04/30 - 05/02 Interpreters; course wrap-up .


The FINAL EXAM is Thursday, May 9, from 3:00 PM - 4:45 PM.



Eugene Wallingford ..... wallingf@cs.uni.edu ..... January 15, 2013