CSE 341: Programming Languages, Autumn 2002

Selected Example Programs

A number of the questions on the final examination will be about the selected example programs listed here. Be sure to learn how these programs work.
  • Scheme Permutations program
  • ML Transitivity of Implication program
  • Java Marine Transportation program
  • Perl Preshuss Raahks program
  • You should also be familiar with the small Prolog program grandmother.pl that was presented in lecture.

    Some Other Topics for the Final

    In addition to topics covered on the first two quizzes and the Perl topics covered by the example program, here are some others to study. 
    
Programming language paradigms, especially in comparison
 to one another.

Visual data flow paradigm

Comparison of objects and closures.

Horn clauses and their representation in both Prolog syntax
 and conventional logic notation.

Unification of literals.

Logical resolution.

Concepts of programming language design such as orthogonality
and polymorphism.

Definition of regular expressions, definition of finite
automata, and the functional equivalence of these as
representations of sets of strings.