CS 3200: Organization of Programming Languages

Fall 2017

Programming Languages

There are thousands of programming languages, from A#.NET to ZPL and everything in between. Do you need to know all of them to be a good programmer/engineer/computer scientist?

The goal of this course is to convince you that the answer to this question is no. In fact, many programming languages — while superficially distinct at the level of syntax — are actually quite similar once you take a closer look.

This semester, we'll explore by boiling a number of programming languages down to a small set of more fundamental language features, including structured data, control, mutable state, (higher-order) functions, types, polymorphism, and objects. Once you understand how these features work in isolation, you'll start seeing them (or not!) in all your favorite programming languages. This, in turn, will make it easy to pick up new languages with minimal fuss.

To learn many of these features, you'll be implementing them yourselves within a series of increasingly complex interpreters for small programming languages. The meta-language for programming and discussion is Pyret, a new PL developed primarily by Shriram Krishnamurthi at Brown University. Try it out right now at code.pyret.org/editor.
Pyret logo

Meeting: MWF 2:00–2:55 p.m., ARC 212
Instructor: Gordon Stewart (gstewart@ohio.edu)
Office Hours: Stocker 355, Wednesday 11am-12pm, Friday 1pm-2pm
GA: Yiran Liu (yl051516@ohio.edu)
Textbook: PAPL

Pyret QuickStart Links

Prerequisites

CS 2650 and 3000, but also: Some mathematical maturity (at the level of "I've seen and done a few proofs before") and (most importantly) a desire to learn!

Course Structure

We'll meet MWF from 2-2:55pm. Attendance in class is required.

Homework consists of programming assignments and Blackboard quizzes. We'll have both a traditional in-class midterm and a final.

The grading breakdown is roughly as follows:

ComponentWeight
Homework40%
Attendance and Quizzes10%
Midterm20%
Final30%

Blackboard will be used to post quizzes and to report grades. Up-to-date information on other aspects of the course (assignment due dates, etc.) will be posted on this website so check back frequently!

Assignments Key:
Programming Assignment DUE
Blackboard Quiz DUE
Unless otherwise noted, assignments and quizzes are due at 11:59pm.

Schedule (Tentative)

Programming in Pyret
W1: 8/28-9/1
Intro. to programming languages
Intro. to programming in Pyret
Reading: PAPL 1, PAPL 2
W 8/30: Q0 Due
W2: 9/4-8
More Pyret intro.
Lists, recursion, higher-order functions
Reading: PAPL 5.3-5.4, PAPL 6
W 9/6: A0 Due: A0: Intro. to Pyret.
M 9/4: Holiday - NO CLASS
W3: 9/11-15
Lists, recursion, and higher-order functions continued
Reading: Same as last week
Supplementary Reading: Sections 1-3 of A tutorial on the universality and expressiveness of fold by Graham Hutton
W 9/13: Q1 Due
W4: 9/18-22
Structured data, general pattern-matching
Recursive and polymorphic datatypes
Lazy evaluation, streams
Reading: PAPL 7-9, PAPL 13
W 9/20: A1 Due: A1: Lists.
Reasoning About Programs
W5: 9/25-29
Automated reasoning, SAT
Reading: Boolean Satisfiability Solvers (up to 1.3.4), by Malik and Weissenbacher
W 9/27: Q2 Due
W6: 10/2-6
Equational reasoning about functional programs
Reading: TBD
W 10/4: A2 Due: A2: More Functional Programming.
W7: 10/9-13
More equational reasoning
Midterm review
Reading: Study for midterm!
T 10/10: Fall Semester Reading Day
F 10/13: In-Class Midterm
PL Through Interpreters
W8: 10/16-20
Representing programs: concrete vs. abstract syntax
S-expressions and our first interpreter
Reading: PAPL 23 and 24
W 10/18: Q3 Due
W9: 10/23-27
Interpreters continued, basic control flow
Reading: PAPL 25
W10: 10/30-11/3
Let bindings, functions, desugaring
Reading: PAPL 26
W 11/1: A3 Due: A3: Scheme0.
W11: 11/6-10
Types and type-checking
Reading: PAPL 27
F 11/10: Holiday - NO CLASS
W12: 11/13-17
More types, type safety
Reading: PAPL 28
W 11/15: Q4 Due
W13: 11/20-24
Mutable state, references and reference types
Reading: PAPL 31
M 11/20: A4 Due: A4: Typed Scheme.
W-F 11/22-24: Thanksgiving - NO CLASSES
W14: 11/27-12/1
References continued
Objects
Reading: PAPL 32
W 11/29: Q5 Due
Looking Ahead
W15: 12/4-8
Advanced programming languages
Other paradigms: Logic programming in Datalog
Reading: TBD
W 12/6: A5 Due: A5: Typed Scheme Extended.
12/11-15: Final Exam Period

Student Outcomes vs. Course Learning Outcomes

(a) An ability to apply knowledge of computing and mathematics appropriate to the program's student outcomes and to the discipline. Students will be able to:

(b) An ability to analyze a problem, and identify and define the computing requirements appropriate to its solution. Students will be able to:

(c) An ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs. Students will be able to:

(j) An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices. Students will be able to:

Homework and Lateness Policy

Homework will usually be due Wednesdays by 11:59pm. Late homework assignments will be penalized according to the following formula:

Academic Honesty Policy

Acceptable Collaboration Matrix

Instructor/GANoninstructor (e.g., Another Student)
Youall collaboration allowedhigh-level discussion (of the problems, not your code!) allowed but only after you've started the assignment; must be documented in README as described below
You may discuss the homework with other students in the class, but only after you've attempted the problems on your own first. If you do discuss the homework problems with others, write the names of the students you spoke with, along with a brief summary of what you discussed, in a README comment at the top of each submission. Example:

(*
README
Name: Gordon Stewart
Assignment: A0
Collaboration: I spoke with X and Y. We swapped tips regarding the use of lists in Pyret.
*)

However, under no circumstances are you permitted to share or directly copy code or other written homework material, except with course instructors. If I discover that you've cheated on an assignment, you'll get an automatic 0 along with an immediate referral to the Office of Community Standards, which will likely take disciplinary action against you. Remember: homework is there to give *you* practice in the new ideas and techniques covered by the course; it does you no good if you don't engage!

In general, students in EECS courses such as this one must adhere to the Russ College of Engineering and Technology Honor Code, and to the OU Student Code of Conduct. If you haven't ever read these documents, please do so.

Students with Disabilities

If you suspect you may need an accommodation based on the impact of a disability, please contact me privately to discuss your specific needs. If you're not yet registered as a student with a disability, contact the Office of Student Accessibility Services first.