e Programming Languages

Information

Class MeetingsWed 5:10-7pm in CIWW 109
RecitationsThu 6:10-7pm in CIWW 109
First LectureJan 30, 2019
Last LectureMay 8, 2019
Midterm ExamMar 27, 2019, 5:10-7pm in CIWW 109
Final ExamMay 15, 2019, 5:10-7pm in CIWW 109
InstructorThomas Wies, Office 60FA 403, Office Hours Tue 4:00-5:00pm, or by appointment
RecitationsTBD
GradersTBD

Overview

Design and use of mainstream programming languages: naming, scoping, type models, control structures, procedural abstractions, modularization. Implementation issues and runtime organization. We will study languages such as C, C++, Java, Scala, Scheme, and OCaml. The course work includes extensive programming exercises in various languages.

Prerequisites: Undergraduate courses in data structures and algorithms or equivalent, as well as familiarity and programming experience in a high-level language like C, C++, Java, or a similar language.

Topics

Throughout the semester, we will investigate the following topics in detail among others:

  • Syntax
  • Names, Scopes, and Bindings
  • Control Flow
  • Subprograms and Control Abstraction
  • Functional Programming
  • Types
  • Object-Oriented Programming
  • Generic Programming
  • Memory Management
  • Concurrency

Details

Piazza

We will use Piazza for course-related discussions and announcements. I encourage you to ask questions when you are struggling to understand a concept - you can even do so anonymously.

Grading

Homework assignments (30%), midterm exam (30%), final exam (40%).

Late Submission Policy

Late submissions of homework solutions and projects will be graded with a 10% penalty per day of late submission. Solutions will not be graded if they are submitted later than one week after the specified deadline.

Academic Integrity

Please review the departmental academic integrity policy. In this course, you may discuss assignments with other students, but the work you turn in must be your own. Do not copy another student's work. You should help other students on specific technical issues but you must acknowledge such interactions. Copying code or other work without giving appropriate acknowledgment is a serious offense with consequences ranging from no credit to potential expulsion.

Recommended Textbooks

There will be no required textbook for this course. However, the following textbooks are recommended for further study:

Syllabus

The syllabus can be subject to change, so please refresh frequently.

Week Date Topics Materials Further Reading
1 01/30
  • Introduction; Syntax and Semantics
PLP, Ch. 1-2
1 01/31
  • Recitation
2 02/06
  • Names, Binding, Scoping
  • Scala Basics
  • PLP, Ch. 3
  • Programming in Scala (PiS), Ch. 2
2 02/07
  • Recitation
3 02/13
  • Imperative Programming
  • Basic Control Flow Mechanisms
  • PLP, Ch. 6.1-6.5
  • Programming in Scala (PiS), Ch. 2
3 02/14
  • Recitation
4 02/20
  • Subroutines
  • Parameter Passing Variants
  • PLP, Ch. 3.6, 6.6, and 8.1-8.3
4 02/21
  • Recitation
5 02/27
  • Functional Programming
  • Lambda Calculus
  • Scheme Intro
5 02/28
  • Recitation
6 03/06
  • Scheme
  • Computing with lists
  • Higher-order functions
  • PLP, Ch. 11.3, 11.6
  • Scheme intro
  • Scheme pattern matching
  • 6 03/07
    • Recitation
    7 03/13
    • Types
    • OCaml Intro
  • PLP, Ch. 7.1, 7.2, 11.4
  • OCaml tutorials
  • OCaml manual
  • 7 03/14
    • Recitation
    03/20
    • No class (Spring break)
    03/21
    • No recitation (Spring break)
    8 03/27
    • Midterm Exam
    8 03/28
    • No recitation
    9 04/03
    • OCaml
    • Type inference
    • Algebraic datatypes
    9 04/04
    • Recitation
    10 04/10
    • Modules and Program Structure
    • OCaml Module System
    10 04/11
    • Recitation
    11 04/17
    • Object-Oriented Programming
    • Subtyping and Dynamic Method Dispatch
    • Scala revisited
    • PLP, ch. 9, 3.6.3
    • OSV Ch. 4
    11 04/18
    • Recitation
    12 04/24
    • Generic Programming
    • Scala Generics
    • PLP, Ch. 8.4
    • OSV, Ch. 19
    12 04/25
    • Recitation
    13 05/01
    • Memory Management
    • Garbage Collection
    • Reference Counting
    • Ownership Types
    13 05/02
    • Recitation
    14 05/08
    • Concurrent Programming
    14 05/09
    • Recitation
    15 05/15
    • Final Exam