λ CS 251 : Principles of Programming Languages .

Staff / Hours

Instructor: Lyn Turbak, SCI E126
Drop-in hours: (see the drop-ins calendar for the most up-to-date info):

• Mondays 5-8pm (SCI E126)
• Tuesdays 2:50-4pm (SCI E126, CS111 due date)
• Wednesdays TBA (SCI E126)
• Thursdays 8-10pm (8:30 on Thu Feb 01) (SCI E111)
• Fridays 2:30-5:30pm (SCI E111)

Tutor Drop-in:
(see the drop-ins calendar for the most up-to-date info)

• Tuesdays 8-10pm: Jane Abernathy (in micro Focus)
• Wednesdays 8-10pm: Hope Anderson (in micro Focus)

Schedule (jump to now)

• Class meetings: SCI E111 Tuesday, Wednesday, Friday 9:50am - 11am

Here is a tentative calendar for the semester. The future and recent past, as recorded here, are subject to revision at any time. See the long-term schedule on the syllabus for the big picture.

Tue	Wed	Fri
30 January 251 class starts today start big ideas; syntax, dynamic and static semantics [slides] administrivia (see syllabus) quick interactive session with Racket PS0 out; get to know you, study administrivia, install Racket Assign: PS0 Introductions	31 January discussion of dynamic and static semantics examples [slides] PS0 due PS1 out; syntax, comparing languages, Racket, big-step vs. small-step semantics. Assign: PS1 Evaluating Languages	02 February submit questions for today's lecture on big-step and small-step semantics. finish big ideas; pragmatics, dimensions [slides] administrivia Racket expressions and declarations; big-step semantics [slides]
06 February submit questions on today's lecture on the substition model for function calls in Racket. small-step semantics [slides] solutions to big and small step semantics exercises [slides] start functions and substitution model [slides 1-10]	07 February submit questions for today's lecture on recursion in Racket. more substitution model, start recursion [slides 11-20]	09 February submit questions for today's lecture on pairs and lists in Racket. Recursion/stack depth wrap-up; `fast-pow`, `fib` [slides 21-26] Racket pairs [slides 1-16] PS1 due PS2 out; semantics, Racket recursion, Racket lambda semantics and stack depth Assign: PS2 Antics with Semantics
13 February Racket lists [slides 17-30]	14 February submit questions for today's lecture on list recursion in Racket. Divide/conquer/glue list recursion in Racket [slides 1-14] Solutions to in-class exercises [product and friends, snoc and friends]	16 February finish list recursion (map and filter patterns) [slides 15-23] local binding (let) [slides] PS2 due PS3 out; Racket lists and list recursion Assign: PS3 Racket List Recursion
20 February Monday Schedule No class today	21 February let for efficient recursion, lexical contours, scope, let*, letrec [slides]	23 February first-class functions [slides] PS3 due PS4 out; first-class functions and higher-order list operations Assign: PS4 First-Class Fun
27 February wrap up first-class functions [slides] higher-order list operations; map, filter [slides 1-12, solns]	28 February higher-order list operations; foldr, foldr-ternop [slides 13-23, solns]	02 March iteration; tail recursion, foldl [slides 1-31, solns]
06 March iteration; tail recursion and foldl review; iterate, iterate-apply [slides 32-41, solns] PS4 due	07 March iteration wrap-up; generate, generate-apply [slides 41-51, solns] symbols and quoted lists [slides 1-9] PS4 due PS5 out; iteration and tail recursion Assign: PS5 Iterate Until Done	09 March PS04 hardcopy solutions distributed metaprogramming appetizer 1 s-expression trees; Racket syntax as s-expression [slides 10-16] An introduction to Postfix [specification and examples of PostFix language from Design Concepts in Programming Languages.] Postfix interpretation in Racket [slides 1-5]
13 March Snow Day; classes cancelled PS6 out; composition, trees, Postfix Assign: PS6 Practicing PostFix	14 March class starts at 10:25pm today metaprogramming appetizer 2 Postfix interpretation in Racket [slides 6-13] Postfix execution exercise in slide 6 of [slides] Start to flesh out configuration-based PostFix interpreter in postfix-config-tail-starter.rkt (solutions are in postfix-config-tail-simple.rkt) PS5 due	16 March PS05 hardcopy solutions distributed metaprogramming appetizer 3 Finish Postfix interpretation in Racket [slides 14-23] Adding `avg` command to PostFix. Bells and whistles in postfix-config-tail-fancy.rkt; error handling, printing of intermediate configurations, more modular handling of arithops and relops Using iterate-apply to iterate through Postfix commands/stack configurations [postfix-config-iterate-simple.rkt, postfix-config-iterate-fancy.rkt Implementation of PostFix interpreter via `foldl` to combine commands-as-stack-transformers [postfix-transform-simple.rkt, postfix-transform-fancy.rkt] Begin introduction to SML [slides (w/blanks) 1-11] FOR NEXT TIME; install wx appliance and run SML installer on it
20 March BEFORE LECTURE TODAY; install wx appliance and run SML installer on it More introduction to SML, including booleans, conditionals, recursion, tuples, tupled vs. curried arguments [slides (w/blanks) 12-14, 26-30, solns] Practical SML programming in SML in wx and Emacs using `.sml` and `*sml*` buffers (rather than terminal) [slides 15-21] GNU Emacs Reference Card handed out PS6 due (but no lateness coupon required until Tue. Apr. 02)	21 March Finish introduction to SML, including tail recursion, `let`, scoping gotchas, tuple pattern matching [slides (w/blanks) 22-25, 31-39, solns] Start list processing in SML [slides (w/blanks) 1-9, solns]	23 March Spring Break No class
27 March Spring Break No class PS7 out; SML programming, 2-3-trees Assign: PS7 Resistance is Futile. You Will Be SMLated.	28 March Spring Break No class	30 March Spring Break No class
03 April More list processing in SML [slides (w/blanks) 10-16, solns]	04 April Final SML list exercise [slide (w/blanks) 16, solns] Begin SML Sum-of-product datatypes; figures, options, lists [slides 1-9 w/blanks, slides 1-9 solns]	06 April Finish SML sum-of-product datatype; binary trees, binary search trees [slides 10-23 w/blanks, slides 10-23 solns]
10 April SML Modules and abstract datatypes 1; mathlib, rational numbers, signature matching[slides 1-16]	11 April SML Modules and abstract datatypes 2; sets [slides 17-23]	13 April SML Modules and abstract datatypes 3; more sets, intro to PS8 [slides 24-31] PS7 due PS8 out; ADTs, modules, sets, Backus paper Assign: PS8 Set Yourself Free
17 April Metaprogramming; interpreters, compilers, and language derivations [slides 1-17]	18 April Metaprogramming; language derivations exercise; bootstrapping [slides 18-28 w/blanks, solutions to derivation exercise on slides 18-19, all slides, including solutions to derivation exercise on slides 18-19]	20 April Discuss FunSet representation Wrap up discussion bootstrapping; sequence-of-metalanguages plan for rest of course [slides 28-30] Begin PostFix interpreter in SML [slides 1-6] PS8 dueish PS9 out; metaprogramming, PostFix-in-SML, Intex Assign: PS9 I Never Metalanguage I Didn't Like
24 April Finish PostFix interpreter in SML; error handling in SML; s-expressions in SML [slides 6-24] Introduction to Intex [slides 1-4 w/blanks, slides 1-4 w/solns]	25 April Intex interpreter; static arg checking; exercise hand-compiling Intex to PostFix [slides 5-18 w/blanks, slides 5-18 w/solns]	27 April Discuss common confusions in PS9 metalanguage derivations. Finish Intex-to-PostFix compilation [slides 19-20 w/blanks, slides 19-20 w/solns] Introduction to Bindex naming features [slides 1-9 w/blanks]
01 May Bindex free variables, environments, evaluation [slides 10-18 w/blanks, slides 10-18 w/solns]	02 May Ruhlman Conference No class PS9 dueish PS10 out; mini-FP interpreter, Bindex, Valex Assign: PS10 Open to Interpretation	04 May Bindex interpreter; extending Bindex to Sigmex = Bindex + sigma [slides 19-26 w/blanks, slides 19-26 w/solns]
08 May Valex; multiple values, conditionals, dynamic typing; desugaring [slides w/blanks, solns] PS11 out; desugaring, HOFL, HOILEC (only PS11 solo problem is required; PS11 regular problems are completely optional extra credit problems). Assign: PS11 A Hofl Lot	09 May HOFL = Valex + first-class functions. [F17 notes]; dynamic vs. static scope	11 May HOILEC; state and closures PS10 dueish PS11 solo problem dueish
15 May Reading Period	16 May Final Exams	18 May Final Exams
22 May Final Exams All leftover CS251 work due by end of day	23 May	25 May