Mathematical Foundations of Programming Semantics: 9th International Conference, New Orleans, LA, USA, April 7 - 10, 1993. ProceedingsStephen Brookes This volume is the proceedings of the Ninth International Conference on the Mathematical Foundations of Programming Semantics, held in New Orleans in April 1993. The focus of the conference series is the semantics of programming languages and the mathematics which supports the study of the semantics. The semantics is basically denotation. The mathematics may be classified as category theory, lattice theory, or logic. Recent conferences and workshops have increasingly emphasized applications of the semantics and mathematics. The study of the semantics develops with the mathematics and the mathematics is inspired by the applications in semantics. The volume presents current research in denotational semantics and applications of category theory, logic, and lattice theory to semantics. |
Contents
I | 1 |
II | 29 |
III | 72 |
IV | 83 |
V | 103 |
VI | 122 |
VII | 143 |
VIII | 160 |
XVII | 333 |
XVIII | 359 |
XIX | 378 |
XX | 410 |
XXI | 438 |
XXII | 454 |
XXIV | 474 |
XXV | 513 |
IX | 177 |
X | 215 |
XI | 230 |
XII | 250 |
XIII | 271 |
XIV | 293 |
XV | 304 |
XVI | 320 |
XXVI | 530 |
XXVII | 544 |
XXVIII | 554 |
XXIX | 567 |
XXX | 587 |
XXXI | 603 |
XXXIII | 627 |
Other editions - View all
Mathematical Foundations of Programming Semantics: 9th International ... Stephen D. Brookes No preview available - 1994 |
Mathematical Foundations of Programming Semantics: 9th International Conference Stephen Brookes No preview available - 1994 |
Common terms and phrases
A-calculus agent application automata automaton axioms Banach space behaviour bisimulation calculus call-by-value coalgebra comonad complete composition Concurrency congruence construction continuous continuous function corresponding defined Definition denotational semantics domain equations e₁ element encoding equivalence example expression F-coalgebra finite fixed point Fock space full subcategory fully abstract functor given holomorphic holomorphic function implies induction infinite infosys isomorphism iteration theories labelled lambda lambda calculus Lecture Notes Lemma linear logic m₁ monad morphisms natural transformation notation Notes in Computer notion Object Type operational semantics oracle output P₁ pair process domain programming language Proposition real-time recursive refinement relation result rules satisfies Scott-domains sequence sequential algorithms sequential function shunt specification strategy structure subset symmetric syntax Theorem TOOPLE topology trace transition trivial unique untimed valof variables vector space
Popular passages
Page 528 - P. Wadler, Linear types can change the world! In M. Broy and C. Jones, editors, Programming Concepts and Methods, Sea of Galilee, Israel, North Holland, April 1990.