Loop Invariants in a Second Programming Course
D. Arnow, Brooklyn

Axioms for Iteration
S. Bloom, Stevens Institute

Can We Teach the Essence of Computer Science to Freshmen?
R. Cartwright, M. Felleisen, Rice

Teaching Formal Hardware Specification, Design, and Verification
S. Chin, Syracuse

Modules on Denotational Semantics and Unification
T. Clement, Manchester

Z `a la Calgary
R. Cockett, Calgary

Formal Methods in Functional Programming
H. Conrad Cunningham, Mississippi

Formal Specifications of Abstract Data Types
R. Davis, Santa Clara

Learning Z: An Interactive Approach
N. Dean, M. Hinchey, Anglia Polytechnic and Cambridge, respectively

Using the ASF+SDF Meta Environment for Teaching Formal Methods
T. B. Dinesh, Amsterdam

Reasoned Programming
S. Eisenbach, Imperial College

Reasoning About Programs: A Module to Teach Specification, Verification, and Analysis of Run-Tiimes in Association with Introductory Programming
A. Fekete, Sydney

Operational Semantics and Definitional Interpreters
V. Gehlot, Delaware

Equational Unification
E. Knapp, Purdue

A Formal Approach to Abstract Data Types
E. Knapp, M. Young, both of Purdue

Freshman Seminars in Math and Computer Science
J. Lipton, Wesleyan

Teaching the Practice of Formal Methods in Distributed Computing Systems
B. McMillan, B. Arrowsmith, both of Missouri-Rolla

A Categorical Algebra of Programs: Module for a Course on Formal Methods
D. Naumann, Southwestern

Algebra for Computer Sciences
V. Pratt, Stanford

An Introduction to Z
H. Saiedian, Omaha

A Formal Introduction to Hardware Design
J. W. Sanders, Oxford

Post Systems in Programming Languages Precis
R. Stansifer, North Texas

The Algebra of Finite State Machines
K. Sutner, Stevens Institute

Categories in Computer Science
B. Walters, Sydney