Mathematical foundations of programming semantics : 7th International conference, Pittsburgh, PA, USA, March 25-28, 1991 : proceedings
This volume contains the proceedings of the Seventh International Conferenceon the Mathematical Foundations of Programming Semantics, held at Carnegie Mellon University, March 1991. The conference continued a series of annual meetings, alternating between workshop and conference formats, intended to...
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Korporativna značnica: | |
| Drugi avtorji: | , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
598 |
| Teme: | |
| Online dostop: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Sporočilo: |
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, proceedings, 7th International conference, Pittsburgh, PA, USA, March 25-28, 1991, Berlin, Springer-Verlag, 1992, 1 vol. (VIII-506 p.), Lecture notes in computer science, 3-540-55511-0 • Mathematical Foundations of Programming Semantics, Texte imprimé, 9783662193730 |
Kazalo:
- Types, abstraction, and parametric polymorphism, part 2
- Call-by-value combinatory logic and the lambda-value calculus
- From operational to denotational semantics
- A simple language supporting angelic nondeterminism and parallel composition
- The equivalence of two semantic definitions for inheritance in object-oriented languages
- Primitive recursive functional with dependent types
- Typed homomorphic relations extended with subtypes
- Information links in domain theory
- Nonwellfounded sets and programming language semantics
- Simultaneous substitution in the typed lambda calculus
- HSP type theorems in the category of posets
- Decomposition of domains
- Cartesian closed categories of domains and the space proj(D)
- An upper power domain construction in terms of strongly compact sets
- Correctness of procedure representations in higher-order assembly language
- An algorithm for analyzing communicating processes
- Continuous functions and parallel algorithms on concrete data structures
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
- On relating concurrency and nondeterminism
- On continuous time agents
- A monoidal closed category of event structures
- An exper model for Quest
- Equations for if-then-else
- Program correctness and matricial iteration theories
- Liminf progress measures
- Connections.