CS 342 Lecture -*- Outline -*- * real SASL ** if syntax: is it a good idea? b -> c; a see page 175 ** pattern matching (as in ML) allows definition by cases, matches equational reasoning e.g., h:t is list with car h and cdr t ------------ mapcar f () = () mapcar f (h:t) = f h : mapcar f t ------------ ** ZF expressions like expressions used to make sets { x | prime?(x) } but for lists 1 .. 5 is list (1 2 3 4 5) { m ; m <- 1 .. 5 } is list (1 2 3 4 5) first ";" means "such that", later ones mean "and" "<-" means "is drawn from the list" see homework exercise 2 moral: bring important ideas into the notation.