Skip to main content

Part of the book series: Progress in Theoretical Computer Science ((PTCS))

  • 107 Accesses

Abstract

In the semantic models we present in this treatise we focus on nondeterministic and (terminating and) nonterminating computations. This is also reflected by the semantic domains we exploit in our models. In this chapter, we introduce two categories of domains and we study them in some detail.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Birkhäuser Boston

About this chapter

Cite this chapter

van Breugel, F. (1998). Linear and branching domains. In: Comparative Metric Semantics of Programming Languages. Progress in Theoretical Computer Science. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4160-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4160-7_3

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-1-4612-8680-6

  • Online ISBN: 978-1-4612-4160-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics