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.
Author(s): Peter Aczel (auth.), Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, David Schmidt (eds.)
Series: Lecture Notes in Computer Science 802
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1994
Language: English
Pages: 654
Tags: Programming Languages, Compilers, Interpreters; Computation by Abstract Devices; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Mathematical Logic and Foundations
Final universes of processes....Pages 1-28
On the symmetry of sequentiality....Pages 29-71
Computational adequacy via ‘mixed’ inductive definitions....Pages 72-82
A structural co-induction theorem....Pages 83-102
Three metric domains of processes for bisimulation....Pages 103-121
Topological models for higher order control flow....Pages 122-142
An investigation into functions as processes....Pages 143-159
Time abstracted bisimulation: Implicit specifications and decidability....Pages 160-176
Timewise refinement for communicating processes....Pages 177-214
Axiomatising real-timed processes....Pages 215-229
A predicative semantics for the refinement of real-time systems....Pages 230-249
Compositional process semantics of Petri Boxes....Pages 250-270
On the specification of elementary reactive behaviour....Pages 271-292
A chemical abstract machine for graph reduction extended abstract....Pages 293-303
Lifting theorems for Kleisli categories....Pages 304-319
Sequential functions on indexed domains and full abstraction for a sub-language of PCF....Pages 320-332
Another approach to sequentiality: Kleene's unimonotone functions....Pages 333-358
Mechanizing logical relations....Pages 359-377
Some quasi-varieties of iteration theories....Pages 378-409
Probabilistic power domains, information systems, and locales....Pages 410-437
Linear domains and linear maps....Pages 438-453
Universal quasi-prime algebraic domains....Pages 454-473
Holomorphic models of exponential types in linear logic....Pages 474-512
A syntax for linear logic....Pages 513-529
A complete axiomatisation for trace congruence of finite state behaviors....Pages 530-543
The asymmetric topology of computer science....Pages 544-553
Ultimately periodic words of rational ω -languages....Pages 554-566
Category of Δ-functors....Pages 567-586
A categorical interpretation of Landin's correspondence principle....Pages 587-602
An operational semantics for TOOPLE: A statically-typed object-oriented programming language....Pages 603-626
On the transformation between direct and continuation semantics....Pages 627-648
