An exploration of modern or unconventional concepts of programming languages, their semantics, and their implementations; abstract data types; axiomatic semantics using Hoare's logic and Dijkstra's predicate transformers; denotational semantics; functional, object-oriented, and logic programming; concurrency and Owicki-Gries theory. Example languages include ML, Ada, Oberon, LISP, PROLOG, and CSP.

Usually Offered:	Spring
Credit:	3 hours (class)
Prerequisite:	CS 251 and 352. CS 354 and 483 are recommended
University Catalog:	CS 565