Harvey Mudd College
Computer Science 131
Programming Languages
Spring Semester 2000

• Syllabus

   

• Supporting Software and Related Links
  
  
  • Basic Info on Emacs Mode for SML-NJ
  • More Info on Emacs Mode for SML-NJ -- This is the documentation that comes with the sml-mode. Some key-bindings have been changed for the version used in CS-131.
  • The SML Standard Basis Library
  • SML-NJ Home Page at Bell Labs (Lucent)
  • Fox Project Home Page - This is a project whose goal is to do OS-level programming in SML. The Project has included development of a TCP/IP stack and an HTTP server written entirely in an extension of SML. In fact, those two links are hosted on that server.

   

• Wetware
  
  
  • Josh Hodas (Professor)

   

• Assignments
  
  
  • Project 01 (due 1/28/00) - Warm-Up Programming in SML: Numbers, Lists, and Strings
  • Project 02 (due 2/4/00) - Warm-Up Programming in SML: Higher-Order Functions and Miscellaneous Munging
  • Project 03 (due 2/18/00) - Warm-Up Programming in SML: User Defined Recursive Types and A Simple Read-Eval-Print Loop
  • Project 04 (due 2/29/00) - Interpreter for a Simple Calculator Language -- Phase 1: Evaluation
  • Formal Specification of Expresion Evaluation for Project 04
  • Project 05 (due 3/10/00) - Interpreter for a Simple Calculator Language -- Phase 2: From Concrete to Abstract Syntax
  • Homework 01 (due 3/23/99) - A Pencil and Paper Assignment on Parsing
  • Project 06 (due 3/28/00) - Interpreter for a Simple Calculator Language -- Phase 3: Fruition
  • Project 07 (due 4/14/00) - Interpreter for a Dynamically Scoped Mini-Lisp
  • Project 08 (due 4/25/00) - Interpreter for a Lexically Scoped Mini-Scheme
  • Project 09 (due 5/5/00) No Late Submissions - Programming in Mini-Scheme

   

• Lectures
  • Part 0 -- Background
    
    
    • Lecture 01 (1/19/00) - Background, Course Details

    
    

  • Part I -- Functional Programming in SML
    
    
    • Lecture 02 (1/24/00) - Compilers & Interpreters, History of ML, Base Types, Built-in Structured Types
    • Lecture 03 (1/26/00) - Functions, Pattern Matching, Polymorphism, Tail Recursion
    • Lecture 04 (1/31/00) - Six Higher-Order Functions, Scope, local and let Definitions, The SML Module System: Structures
    • Lecture 05 (2/2/00) - Handling Aberrant Conditions: Undefined Results vs. Exceptions
    • Lecture 06 (2/7/00) - TypesFest 2000
    • Lecture 07 (2/9/00) - A More Involved Datatype Example, The SML Module System: Structures and Signatures
    • Lecture 08 (2/14/00) - The SML Module System: Functors

    
    

  • Part II -- Specifying and Parsing Programming Languages
    
    
    • Lecture 09 (2/16/00) - Denotational and Operational Semantics
    • Lecture 10 (2/21/00) Abstract vs. Concrete Syntax
    • Lecture 11 (2/23/00) - Lexical Analysis: Regular Expressions, Deterministic Finite Automata
    • Lecture 12a (2/28/00) - Lexical Analysis: Non-Deterministic Finite Automata
    • Lecture 12b (2/28/00) - Lexical Analysis: Converting NFA's to DFA's
    • Lecture 13 (3/1/00) - Faculty Candidate Kathryn Fisler: Type Inference
    • Lecture 14, 15, 16 (3/6/00, 3/8/00, opt evening) - SLR(1) Parsing

    
    

  • Part III -- Theory and Implementation: Scope
    
    
    • Lecture 17 (3/20/00) - Properties of Programs and Languages: Referential Transparency, Alpha-Equivalence, Subject Reduction
    • Lecture 18 (3/22/00) - Faculty Candidate Carsten Schuermann: Type Correctness
    • Lecture 19 (3/27/00) - Comparison of Scoping in Various Languages, The Stack Memory Model, The Upward & Downward FunArg problem
    • Lecture 20 (3/29/00) - Implementing Lexical Scope, The Environment Memory Model, Closures.

    
    

  • Part IV -- Real-World SML
    
    
    • Lecture 20a (3/29/00) - Mutable Data with Refs.
    • Lecture 21 (4/3/00) - Introduction to Continuations
    • Lecture 22 (4/5/00) - Faculty Candidate Chris Stone: Continuations, continued

    
    

  • Part V -- Theory and Implementation: The Lambda Calulus and Type Theory
    
    
    • Lecture 23 (4/10/00) - History, Syntax of the Lambda Calculus; Rewriting Systems; Redexes, Contractums and Closures; The Alpha, Beta, and Eta Contraction Rules
    • Lecture 24 (4/17/00) - Examples of Reduction Sequences, Confluence / Church-Rosser Propery, The Diamond Property, Proof of Confluence of Beta Reduction, Normal-Order vs. Applicative-Order Evaluation
    • Lecture 25 (4/19/00) - Representing Computation in the Constant-Free Calculus: Encoding Boolean and Numerical Expressions
    • Lecture 26 (5/1/00) - Name-Free Recursion, The Y Combinator, S-K-I Reduction
    • Lecture 27 (5/3/00) - Type Inference, The Curry-Howard Isomorphism

    
    

	This page copyright ©2000 by Joshua S. Hodas. Last changed on Thrusday, February 24, 2000.
http://www.cs.hmc.edu/~hodas/courses/cs131/index.html