CS 321 Programming Languages

Fall 2017

Lectures

Important Dates (tentative):

• Midterm Exam 1: 26.10.2017
• Midterm Exam 2: 30.11.2017
• Final Exam: 11.01.2018 @ 9:00, in room 237.
• Withdrawal week: 13-17.11.2017

25.09.2017 Monday

• Task: Install the latest version of Ocaml on your computer.
• Course intro [2up] [4up] [Video]
• OCaml, part 01 [2up] [4up]
• Code written during the lecture

28.09.2017 Thursday

• OCaml, part 02 [2up] [4up]

02.10.2017 Monday

• OCaml, part 02 cont’d.
• OCaml, part 03 - Lists (up to slide #19) [2up] [4up]

05.10.2017 Thursday

• NO LECTURE. The instructor is attending a conference.

09.10.2017 Monday

• OCaml, part 03 cont’d.
• Watch videos:
  • [Reversing a list]
  • [Map]
  • [Maya the bee]
  • [fold left & fold right] (Note: This video uses F# as the programming language. The differences from OCaml is that the “let” expressions do not have the “in” keyword, fold_left is called fold, and fold_right is called foldBack. Otherwise, the ideas are the same.)

12.10.2017 Thursday

• OCaml, part 03 cont’d.
• Tail recursion [2up] [4up] [Video]
• Code written during the lecture

16.10.2017 Monday

• User-defined data types [2up] [4up]
• Code written during the lecture

19.10.2017 Thursday

• User-defined data types (cont’d)
  • Polymorphic tree implementation in Java [Code]
• An interpreter for the ArithLang language (constant ints, names, arithmetic operations).
  • OCaml code
  • Read Chapter 1 and Chapter 2 (up to Section 2.3.2) in PLC.

23.10.2017 Monday

• Extended the ArithLang with Let-in.
  • Code

26.10.2017 Thursday

• MIDTERM EXAM 1
• To study, solve the exercises on the slides, the sample questions on functional programming, and the sample questions on interpretation (Q1-Q4).
  • Suggested approach

30.10.2017 Monday

• A Java implementation for the ArithLang interpreter.
  • A generic implementation for Env.
• Abandoned “ArithLang”, will call it “Deve” from now on.
• Extended Deve with conditionals.
• Extended Deve with relational operations.
• The corresponding Java code.
• Extended Deve with boolean literals.

02.11.2017 Thursday

• The big picture
• Writing a lexer for the Deve language.
  • Step 1, Step 2, Step 3, Step 4, Step 5, Step 6

06.11.2017 Monday

• Parsing [Slides] [Notes]
• Writing a parser for the Deve language.
  • Names and int constants, Let-in, boolean literals, if-then-else

09.11.2017 Thursday

• Parsing cont’d.
  • Refactoring, Binary exps (limited), Binary exps (right assoc.), Binary exps, Parenthesized exps
• Connecting the pieces to obtain a Deve REPL.
• At this point, we have an end-to-end interpreter that takes code as a string and reduces the code to a value. We will call this Deve 1.0.

13.11.2017 Monday

• Extending the Deve language with new features. See the sample questions on interpretation.
• At this point, we have a version of the language that handles booleans gracefully, has relational operators, handles pairs, etc. We will call this Deve 2.0.

16.11.2017 Thursday

• How to Have Fun
• At this point, we have reached Deve 3.0.

20.11.2017 Monday

• Read PLC Sections 4.1-4.9, 5.4.
• Type checking

23.11.2017 Thursday

• At this point, we have reached Deve 4.0.

27.11.2017 Monday

• Type inference and polymorphism [Slides (1-5)]
• Read PLC Section 6.2.

30.11.2017 Thursday

• MIDTERM EXAM 2
• See sample questions on interpretation, and type checking.

04.12.2017 Monday

• Generics, Co-variance/Contra-variance [ArrayList Slides] [Code].
• Read PLC Section 6.5, 6.6.

07.12.2017 Thursday

• Lambda calculus and Church numeral encodings [2up] [4up] [Code]
• Read: PLC Section 5.6

11.12.2017 Monday

• Lambda calculus (cont’d with recursion)
  • Sample problems.
  • Videos: part 1, part 2, part 3, part 4
• Imperative programming [Slides] [Code (experiment?.c)]
• Read: The C Programming Language by K&R, Chapter 5, Sections 5.1-5.4. (Available on LMS)

14.12.2017 Thursday

• Imperative programming cont’d.

18.12.2017 Monday

• Imperative programming cont’d. See swap.cpp and experiment5.cpp.
• Read: PLC Sections 7.1-7.5.
• Sample problems
  • Q8 video

21.12.2017 Thursday

• Garbage collection [Slides]
• Read: PLC Chapter 10, Sections 10.1-10.5
• Bonus reading: David Kieras’ C++11 Smart Pointers handout
• Sample problems

25.12.2017 Monday

• Eager vs. lazy evaluation, infinite streams [2up] [4up] [Sample code]
• Sample problems

28.12.2017 Thursday