Skip to main content

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

  • 62 Accesses

Abstract

The conclusions from chapter 1 are:

  1. (1)

    Classical term rewriting is unsound for nondeterministic specifications.

  2. (2)

    If the axioms are restricted to right-linear inclusion rules, classical term rewriting is sound and complete, however this restriction is not satisfactory for practical applications.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

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

© 1993 Birkhäuser Boston

About this chapter

Cite this chapter

Hussmann, H. (1993). Specifications with a Deterministic Basis. In: Nondeterminism in Algebraic Specifications and Algebraic Programs. Progress in Theoretical Computer Science. Birkhäuser Boston. https://doi.org/10.1007/978-1-4684-6834-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-6834-2_3

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-1-4684-6836-6

  • Online ISBN: 978-1-4684-6834-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics