Skip to main content
SpringerLink
Log in

Universelle Algebra

  • Chapter
Grundlagen der funktionalen Programmierung

Part of the book series: Leitfäden der Informatik ((XLINF))

  • 61 Accesses

Zusammenfassung

Die algebraische Semantik versucht die Bedeutung von syntaktischen Konstruktionen (hier eines Teils von Gofer) mithilfe von algebraischen Mitteln zu erklären. Das bedeutet, daß dabei Details des Berechnungswegs außer acht gelassen werden. Dem gegenüber steht die operationelle Semantik, wo die Bedeutung der Konstruktionen gerade durch Auswertungsregeln für Ausdrücke oder Zustandstransformationen erklärt wird.

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 49.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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.

Literatur

  1. Martelli, A. and U. Montanari: An Efficient Unification Algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258–282. 1979

    Article  Google Scholar 

  2. Baader, F. and J. H. Siekmann: Unification Theory. In: Gabbay, D. M., C. J. Hogger and J. A. Robinson (Eds.): Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Press, 1994.

    Google Scholar 

  3. Klaeren, H.: Algebraische Spezifikation — Eine Einführung. Lehrbuch Informatik. Springer Verlag, Berlin-Heidelberg-New York, 1983.

    Google Scholar 

  4. Ehrig, H. and B. Mahr: Equations and Initial Semantics, Band 1 der Reihe Fundamentals of Algebraic Specification. Springer, EATCS Monographs on Theoretical Computer Science Auflage, 1985.

    Google Scholar 

  5. Bergstra, J. A., J. Heering and P. Klint (Eds.): Algebraic specification. ACM Press frontier series. ACM Press, New York, 1989. ACM order # 704890.

    Google Scholar 

  6. Wirsing, M. and J. A. Bergstra (Eds.): Algebraic Methods: Theory Tools and Applications, Band 394 der Reihe LNCS. Springer, 1989.

    Google Scholar 

  7. Ehrig, H. and B. Mahr: Module Specifications and Constraints, Band 2 der Reihe Fundamentals of Algebraic Specification. Springer, EATCS Monographs on Theoretical Computer Science Auflage, 1990.

    Google Scholar 

  8. Wirsing, M.: Algebraic Specification, Band B der Reihe Handbook of Theoretical Computer Science, Kapitel 13. Elsevier Science Publishers, Amsterdam, 1990.

    Google Scholar 

  9. Goguen, J. A. and J. Meseguer: Order-Sorted Algebra Solves the Constructor-Selector, Multiple Representation and Coercion Problem. In: Proc. Second IEEE Symposium on Logic in Computer Science, S. 18–29, Ithaca, NY, 1987.

    Google Scholar 

  10. Smolka, G., W. Nutt, J. A. Goguen and J. Meseguer: Order-sorted equational computation. In: Ait-Kaci, H. and M. Nivat (Eds.): Rewriting Techniques, Band II der Reihe Resolution of Equations in Algebraic Structures, S. 299–369. Academic Press, New York, 1989.

    Google Scholar 

  11. Goguen, J. A. and J. Meseguer: Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations. Technischer BerichtSRl-CSL-89–10, SRI International, Menlo Park, CA, Juli 1987.

    Google Scholar 

  12. Mosses, P. D.: Unified algebras and modules. In: POPL1989 [POP89].

    Google Scholar 

  13. Smolka, G.: Logic Programming over Polymorphically Order-Sorted Types. Doktorarbeit, Fachbereich Informatik, Universität Kaiserslautern, 1989.

    Google Scholar 

  14. Hanus, M.: Horn Clause Programs with Polymorphic Types: Semantics and Resolution. Theoretical Computer Science, 89(1):63–106. 1999

    Article  MathSciNet  Google Scholar 

  15. Poigné, A.: On Specifications Theories and Models with Higher Types. Information and Control, 68:1–46,1986.

    Google Scholar 

  16. Meinke, K.: Universal Algebras in Higher Types. Theoretical Computer Science, 100(2):385–418.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Tübingen, Deutschland

    Dr. rer. nat. Peter Thiemann

Authors
  1. Dr. rer. nat. Peter Thiemann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1994 B. G. Teubner Stuttgart

About this chapter

Cite this chapter

Thiemann, P. (1994). Universelle Algebra. In: Grundlagen der funktionalen Programmierung. Leitfäden der Informatik. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-89207-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-89207-2_11

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-519-02137-7

  • Online ISBN: 978-3-322-89207-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation