Skip to main content
SpringerLink
Log in

A Term-Graph Syntax for Algebras over Multisets

  • Conference paper
Recent Trends in Algebraic Development Techniques (WADT 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5486))

Included in the following conference series:

  • 288 Accesses

Abstract

Earlier papers argued that term graphs play for the specification of relation-based algebras the same role that standard terms play for total algebras. The present contribution enforces the claim by showing that term graphs are a sound and complete representation for multiset algebras, i.e., algebras whose operators are interpreted over multisets.

Research supported by the EU FET integrated project Sensoria, IST-2005-016004.

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. Pitts, A.M.: Categorical Logic. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 5, pp. 39–123. Oxford University Press, Oxford (2001)

    Google Scholar 

  2. Walicki, M., Meldal, S.: Algebraic approaches to nondeterminism: An overview. ACM Computing Surveys 29, 30–81 (1997)

    Article  Google Scholar 

  3. Hoenke, H.J.: On partial algebras. In: Csákány, B., Fried, E., Schmidt, E. (eds.) Universal Algebra. Colloquia Mathematica Societatis János Bolyai, vol. 29, pp. 373–412. North Holland, Amsterdam (1977)

    Google Scholar 

  4. Ştefănescu, G.: Network Algebra. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  5. Căzănescu, V.E., Ştefănescu, G.: Classes of finite relations as initial abstract data types II. Discrete Mathematics 126, 47–65 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society 119, 425–446 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Corradini, A., Gadducci, F.: Categorical rewriting of term-like structures. In: Bauderon, M., Corradini, A. (eds.) GETGRATS Closing Workshop. Electr. Notes in Theor. Comp. Sci, vol. 51, pp. 108–121. Elsevier, Amsterdam (2002)

    Google Scholar 

  8. Corradini, A., Gadducci, F.: Rewriting on cyclic structures: Equivalence between the operational and the categorical description. Informatique Théorique et Applications/Theoretical Informatics and Applications 33, 467–493 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Corradini, A., Gadducci, F.: A functorial semantics for multi-algebras and partial algebras, with applications to syntax. Theor. Comp. Sci. 286, 293–322 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Corradini, A., Gadducci, F.: An algebraic presentation of term graphs, via gs-monoidal categories. Applied Categorical Structures 7, 299–331 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Burmeister, P.: Partial algebras - An introductory survey. In: Rosenberg, I.G., Sabidussi, G. (eds.) Algebras and Orders. NATO ASI Series C, pp. 1–70. Kluwer Academic, Dordrecht (1993)

    Chapter  Google Scholar 

  12. Corradini, A., Gadducci, F., Kahl, W., König, B.: Inequational deduction as term graph rewriting. In: Mackie, I., Plump, D. (eds.) Term Graph Rewriting. Electr. Notes in Theor. Comp. Sci, vol. 72.1, pp. 31–44. Elsevier, Amsterdam (2002)

    Google Scholar 

  13. Kock, J.: Frobenius Algebras and 2-D Topological Quantum Field Theories. London Mathematical Society Student Texts, vol. 59. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

  14. Hasegawa, M., Hofmann, M., Plotkin, G.D.: Finite dimensional vector spaces are complete for traced symmetric monoidal categories. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 367–385. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Bruni, R., Gadducci, F., Montanari, U.: Normal forms for algebras of connections. Theor. Comp. Sci. 286, 247–292 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae 26, 241–265 (1996)

    MathSciNet  MATH  Google Scholar 

  17. Sassone, V., Sobociński, P.: Reactive systems over cospans. In: Logic in Computer Science, pp. 311–320. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  18. Mac Lane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1971)

    Book  MATH  Google Scholar 

  19. Golan, J.: Semirings and Affine Equations over Them. Kluwer, Dordrecht (2003)

    Book  MATH  Google Scholar 

  20. Corradini, A., Gadducci, F., Kahl, W.: Term graph syntax for multi-algebras. Technical Report TR-00-04, Università di Pisa, Department of Informatics (2000)

    Google Scholar 

  21. Benson, D.: Counting paths: nondeterminism as linear algebra. IEEE Transactions on Software Engineering 10, 785–794 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  22. Lamo, Y., Walicki, M.: Quantifier-free logic for nondeterministic theories. Theor. Comp. Sci. 355(2), 215–227 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  23. Diaconescu, R.: Institution-independent Model Theory. Birkhäuser, Basel (2008)

    MATH  Google Scholar 

  24. Gadducci, F.: Graph rewriting for the π-calculus. Mathematical Structures in Computer Science 17(3), 407–437 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Polo Scientifico“Guglielmo Marconi”, via dei Colli 90, La Spezia, Italy

    Fabio Gadducci

Authors
  1. Fabio Gadducci
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Largo Bruno Pontecorvo 3, 56127, Pisa, Italy

    Andrea Corradini  & Ugo Montanari  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gadducci, F. (2009). A Term-Graph Syntax for Algebras over Multisets. In: Corradini, A., Montanari, U. (eds) Recent Trends in Algebraic Development Techniques. WADT 2008. Lecture Notes in Computer Science, vol 5486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03429-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03429-9_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03428-2

  • Online ISBN: 978-3-642-03429-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation