Skip to main content
SpringerLink
Log in

Nondeterministic algebraic specifications and nonconfluent term rewriting

  • Invited Papers
  • Conference paper
  • First Online:
Book cover Algebraic and Logic Programming (ALP 1988)

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

Included in the following conference series:

Abstract

Algebraic specifications are generalized to the case of nondeterministic operations by admitting models with set-valued functions (multi-algebras). General (in particular, non-confluent) term rewriting systems are considered as a specification language for this semantic framework. Correctness, completeness and initiality results are given.

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

Access this chapter

Log in via an institution
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.

References

  1. E. Astesiano, G. Costa, Sharing in nondeterminism, in: H. A. Maurer (ed.), 6th Internat. Coll on Automata, Languages and Programming, Lecture Notes in Computer Science 71 (Springer, Berlin, 1979), 1–13.

    Chapter  Google Scholar 

  2. D. B. Benson, Parameter passing in nondeterministic recursive programs, J. Comput. System Sci. 19 (1979) 50–62.

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Broy, M. Wirsing, On the algebraic specification of nondeterministic programming languages, in: E. Astesiano, C. Böhm (eds.), 6th Coll. on Trees in Algebra and Programming, Lecture Notes in Computer Science 112 (Springer, Berlin, 1981) 162–179.

    Google Scholar 

  4. M. Broy, M. Wirsing, Partial abstract types, Acta Informat. 18 (1982) 47–64.

    Article  MathSciNet  MATH  Google Scholar 

  5. G. E. Hansoul, A subdirect decomposition theorem for multialgebras, Algebra Universalis, 16 (1983) 275–281.

    Article  MathSciNet  MATH  Google Scholar 

  6. M. C. B. Hennessy, The semantics of call-by-value and call-by-name in a nondeterministic environment. SIAM J. Comput. 9 (1980) 67–84.

    Article  MathSciNet  MATH  Google Scholar 

  7. W. H. Hesselink, A mathematical approach to nondeterminism in data types. ACM Trans. on Progr. Languages and System 10 (1988) 87–117

    Article  MATH  Google Scholar 

  8. G. Huet, D. C. Oppen, Equations and rewrite rules: a survey, in: R. V. Book (ed.), Formal Language Theory: Perspectives and Open Problems, (Academic Press, New York,1980).

    Google Scholar 

  9. H. Hussmann, Rapid prototyping for algebraic specifications — RAP system user's manual. Report MIP-8504, Universität Passau, Passau, 1985, 2nd, extended edition 1987.

    Google Scholar 

  10. H. Hussmann, Nichtdeterministische Algebraische Spezifikationen (in German), Ph. D. thesis, University of Passau, 1988.

    Google Scholar 

  11. S. Kaplan, Rewriting with a nondeterministic choice operator, Theoret. Comput. Sci. 56 (1988) 37–57.

    Article  MathSciNet  MATH  Google Scholar 

  12. T. Nipkow, Nondeterministic data types: Models and implementations, Acta Informat. 22(1986) 629–661.

    Article  MathSciNet  MATH  Google Scholar 

  13. H. E. Pickett, Homomorphisms and subalgebras of multialgebras, Pacific J. of Math. 21 (1967) 327–342.

    Article  MathSciNet  MATH  Google Scholar 

  14. P. A. Subrahmanyam, Nondeterminism in abstract data types, in: S. Even, O. Kariv (eds.), 8th Internat. Coll. on Algorithms, Languages and Programming, Lecture Notes in Computer Science 115 (Springer, Berlin, 1981) 148–164.

    Google Scholar 

  15. M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy, On hierarchies of abstract data types, Acta Informat. 20 (1983) 1–33.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Passau, Postfach 2540, D-8390, Passau

    Heinrich Hussmann

Authors
  1. Heinrich Hussmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Grabowski P. Lescanne W. Wechler

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Akademie-Verlag Berlin

About this paper

Cite this paper

Hussmann, H. (1988). Nondeterministic algebraic specifications and nonconfluent term rewriting. In: Grabowski, J., Lescanne, P., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1988. Lecture Notes in Computer Science, vol 343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50667-5_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-50667-5_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50667-6

  • Online ISBN: 978-3-540-46063-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation