| |
| | Formal Semantics of Programs |
 | | traditional approaches to language semantics for programming were informal, with disastrous results (e.g., inconsistent behavior of compilers) |
 | | Dana Scott established lambda calculus as an appropriate mathematical meta-language by giving it a semantics in terms of lattices and continuous functions (especially to model recursion, self-reference) |
 | | other approaches to formal semantics have also been explored (operational, algebraic, abstract machines, etc.); they vary in levels of abstraction (e.g., how overtly they specify computational steps) (interestingly, they are often not viewed as competitive alternatives, but as opportunities for perspective, via coherence results) |
| www.willamette.edu /~fruehr/talks/ling/clltalk6.html (148 words) |
|