CSE 130: Principles of Programming Languages
The following is a summary in outline form, of topics in CSE 130 as taught Winter 2005. It is intended to help students review for the final exam, but please do not think that only topics listed here can appear on the exam, or that the emphasis given to topics here corresponds to their probability of being on the exam.
  1. Introduction:
    1. Interpreter vs. compiler vs. meaning. Features and their uses. The notion of language paradigm. Abstraction.
    2. Paradigmatic vs. syntagmatic and the social use of programming and programming languages.
    3. History means evolution: emphasis on why, not when or who. Constant rise in abstraction.

  2. Syntax:
    1. BNF, EBNF, CFG, abstract syntax, regular expressions.
    2. Parsing and ambiguity. Terminator vs. separator.

  3. Structured Programming:
    1. Assignment is the essence of the imperative paradigm. L-value and R-value.
    2. Control flow. Structured vs. goto.
    3. Loops, pre and post conditions, invariants, proofs of correctness, proof rules.

  4. Data Representation:
    1. Basic datatypes, coercion; arrays, records, sets.
    2. Layout vs. allocation. Union types, variant types.
    3. Early vs. late binding; static vs. dynamic binding. Visibility.
    4. Type expression. Type checking. Type equivalence.
    5. Pointers, garbage, dereference, dangling, proxy, storage leaks.
  5. Procedures:
    1. The call-by's, in/out. Static vs. dynamic scope. Nested scopes.
    2. Activation records.
    3. Procedure vs. class vs. module vs. macro.
    4. Interface. Information hiding. Data invariant.
  6. Functional Programming:
    1. Type constructors and expressions.
    2. Innermost vs. outermost evaluation.
    3. Function declarations, recursion. Cases and patterns. Functions on lists.
    4. Higher order functions, parametric polymorphism.
    5. Datatype declarations with cases, and function definitions over them.
    6. Exceptions.
  7. Logic programming:
    1. Relation, Horn clause, term.
    2. Queries, goals, subgoals. Unification and substitution.
    3. Search trees: depth first backtrack search.
    4. Negation as failure. Cut. Lists and open lists.

To CSE 130 homepage
Maintained by Joseph Goguen
© 2000 - 2005 Joseph Goguen
Last modified: Fri Mar 12 16:31:08 PST 2004