Skip to main content
Link
Menu
Expand
(external link)
Document
Search
Copy
Copied
EECS 662: Programming Languages
About
Syllabus
Schedule
Assignments
1. Racket Primer
2. More Primitives and Conditionals
3. Let bindings and arity checking
4. Term Rewrites and Lambda Calculus
5. Type System
Notes
01. What is an interpreter?
02. From Haskell to Racket
03. Amount: A Language of Numbers
04. Arithmetic: Calculating Numbers
05. Formal Semantics
06. Con: A language of conditions
07. Defend: Handling errors
08. Fraud: Local bindings and variables
09. Gross: Function Definitions and Calls
10. Lambda: First-class Functions
11. Lambda Calculus
12. Programs as Data Structures
13. Mutation and State
14. Types
Resources
Software
Texts
XKCD
Canvas
Example Code on Github
Sankha Narayan Guria
Notes
Table of contents
1. Racket Primer
2. More Primitives and Conditionals
3. Let bindings and arity checking
4. Term Rewrites and Lambda Calculus
5. Type System