Skip to main content
SpringerLink
Log in

Mathematical Foundations of Programming Semantics

5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29-April 1, 1989. Proceedings

  • Conference proceedings
  • © 1990

Overview

Editors:
  1. M. Main
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. A. Melton
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. M. Mislove
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. D. Schmidt
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 442)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (21 papers)

  1. Front Matter

    Download chapter PDF

  2. A generalized Kahn Principle for abstract asynchronous networks

    • Samson Abramsky
    Pages 1-21

  3. Operations on records

    • Luca Cardelli, John C. Mitchell
    Pages 22-52

  4. Connections between a concrete and an abstract model of concurrent systems

    • Eugene W. Stark
    Pages 53-79

  5. A hierarchy of domains for real-time distributed computing

    • G. M. Reed
    Pages 80-128

  6. Factorizing proofs in timed CSP

    • Jim Davies, Steve Schneider
    Pages 129-159

  7. Unbounded nondeterminism in CSP

    • A. W. Roscoe, Geoff Barrett
    Pages 160-193

  8. The semantics of priority and fairness in occam

    • Geoff Barrett
    Pages 194-208

  9. Inductively defined types in the Calculus of Constructions

    • Frank Pfenning, Christine Paulin-Mohring
    Pages 209-228

  10. On some semantic issues in the reflective tower

    • Karoline Malmkjær
    Pages 229-246

  11. Semantic models for total correctness and fairness

    • Michael G. Main, David L. Black
    Pages 247-270

  12. Equationally fully abstract models of PCF

    • Allen Stoughton
    Pages 271-283

  13. Generalization of final algebra semantics by relativization

    • Lawrence S. Moss, Satish R. Thatte
    Pages 284-300

  14. Termination, deadlock and divergence

    • L. Aceto, M. Hennessy
    Pages 301-318

  15. A category-theoretic semantics for unbounded indeterminacy

    • Prakash Panangaden, James R. Russell
    Pages 319-332

  16. Algebraic types in PER models

    • J. M. E. Hyland, E. P. Robinson, G. Rosolini
    Pages 333-350

  17. Pseudo-retract functors for local lattices and bifinte L-domains

    • Elsa L. Gunter
    Pages 351-363

  18. L-domains and lossless powerdomains

    • Radhakrishnan Jagadeesan
    Pages 364-372

  19. Does “N+1 times” prove more programs correct than “N times”?

    • Ana Pasztor
    Pages 373-389

  20. An algebraic formulation for data refinement

    • A. J. Power
    Pages 390-401
Back to top

Keywords

About this book

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 language semantics. The purpose of the book is to bring into print as quickly as possible papers which reflect the state of research on the topics comprising this area. The intended audience for the book consists of those researchers and graduate students with an interest in the research areas which are related to those presented in the book: programming language semantics, including algebraic, denotational and operational semantics, logics of programs, specification techniques, etc., and the relevant areas of mathematics research, including category theory, domain theory, ordered structures and lattice theory, and metric space methods. The papers included in the book represent the latest results in various facets of this rather broad research area, and this is the first time some of the ideas contained in these works are appearing in print.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation