Skip to main content

Sub-Birkhoff

  • Conference paper

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

Abstract

For equational specifications validity coincides with derivability in equational logic, which in turn coincides with convertibility generated by the rewrite relation. It is shown that this correspondence, essentially due to Birkhoff, can be generalised in a uniform way to sub-equational logics such as Meseguer’s rewriting logic.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  3. Birkhoff, G.: On the structure of abstract algebras. In: Proceedings of the Cambridge Philosophical Society, vol. 31, pp. 433–454 (1935)

    Google Scholar 

  4. Yamada, T., Avenhaus, J., Loría-Sáenz, C., Middeldorp, A.: Logicality of conditional rewrite systems. TCS 236, 209–232 (2000)

    Article  MATH  Google Scholar 

  5. Mitchell, J.C.: Foundations for Programming Languages. Foundations of Computing series. The MIT Press, Cambridge (1996)

    Google Scholar 

  6. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. TCS 96, 73–155 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Zantema, H.: Termination of term rewriting: interpretation and type elimination. JSC 17, 23–50 (1994)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Oostrom, V. (2004). Sub-Birkhoff. In: Kameyama, Y., Stuckey, P.J. (eds) Functional and Logic Programming. FLOPS 2004. Lecture Notes in Computer Science, vol 2998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24754-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24754-8_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21402-1

  • Online ISBN: 978-3-540-24754-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics