Mathematical foundations of programming semantics : 9th international conference, New Orleans, LA, USA, April 7-10, 1993 : proceedings
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...
Đã lưu trong:
| Tác giả chính: | |
|---|---|
| Tác giả của công ty: | |
| Tác giả khác: | , |
| Định dạng: | Livre numérique |
| Ngôn ngữ: | Anglais |
| Được phát hành: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Loạt: | Lecture notes in computer science
802 |
| Những chủ đề: | |
| Truy cập trực tuyến: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Chú thích: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Mathematical foundations of programming semantics, 9th international conference, New Orleans, LA, USA, April 7-10, 1993, proceedings, S. Brookes ... [et al.], eds, Berlin, Springer-Verlag, 1994, 1 vol. (IX-648 p.), Lecture notes in computer science, 3-540-58027-1 • Mathematical Foundations of Programming Semantics, Texte imprimé, 9783662163559 |
Mục lục:
- Final universes of processes
- On the symmetry of sequentiality
- Computational adequacy via mixed inductive definitions
- A structural co-induction theorem
- Three metric domains of processes for bisimulation
- Topological models for higher order control flow
- An investigation into functions as processes
- Time abstracted bisimulation: Implicit specifications and decidability
- Timewise refinement for communicating processes
- Axiomatising real-timed processes
- A predicative semantics for the refinement of real-time systems
- Compositional process semantics of Petri Boxes
- On the specification of elementary reactive behaviour
- A chemical abstract machine for graph reduction extended abstract
- Lifting theorems for Kleisli categories
- Sequential functions on indexed domains and full abstraction for a sub-language of PCF
- Another approach to sequentiality: Kleene's unimonotone functions
- Mechanizing logical relations
- Some quasi-varieties of iteration theories
- Probabilistic power domains, information systems, and locales
- Linear domains and linear maps
- Universal quasi-prime algebraic domains
- Holomorphic models of exponential types in linear logic
- A syntax for linear logic
- A complete axiomatisation for trace congruence of finite state behaviors
- The asymmetric topology of computer science
- Ultimately periodic words of rational ?-languages
- Category of ?-functors
- A categorical interpretation of Landin's correspondence principle
- An operational semantics for TOOPLE: A statically-typed object-oriented programming language
- On the transformation between direct and continuation semantics.