Mathematical foundations of programming semantics : 5th international conference, Tulane University, New Orleans, Louisiana, USA, March 29-April 1, 1989 : proceedings
This is the latest in a series of proceedings of conferences on the Mathematical Foundations of Programming Semantics. The purpose of the series is to bring together mathematicians and theoretical computer scientists who share the common interests of working on problems related to programming langua...
保存先:
| 団体著者: | |
|---|---|
| その他の著者: | , , |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
New York, NY :
Springer-Verlag : Springer e-books
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
442 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
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, 5th international conference, Tulane University, New Orleans, Louisiana, USA, March 29-April 1, 1989, proceedings, M. Main, A. Melton, M. Mislove... [et al.], eds, Berlin, Springer-Verlag, 1990, 1 vol. (vi, 439 p.), Lecture notes in computer science, 0-387-97375-3 • Mathematical Foundations of Programming Semantics, Texte imprimé, 9781475789225 |
目次:
- A generalized Kahn Principle for abstract asynchronous networks
- Operations on records
- Connections between a concrete and an abstract model of concurrent systems
- A hierarchy of domains for real-time distributed computing
- Factorizing proofs in timed CSP
- Unbounded nondeterminism in CSP
- The semantics of priority and fairness in occam
- Inductively defined types in the Calculus of Constructions
- On some semantic issues in the reflective tower
- Semantic models for total correctness and fairness
- Equationally fully abstract models of PCF
- Generalization of final algebra semantics by relativization
- Termination, deadlock and divergence
- A category-theoretic semantics for unbounded indeterminacy
- Algebraic types in PER models
- Pseudo-retract functors for local lattices and bifinte L-domains
- L-domains and lossless powerdomains
- Does N+1 times prove more programs correct than N times ?
- An algebraic formulation for data refinement
- Categorical semantics for programming languages
- Initial algebra semantics for lambda calculi.