[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

A programming language for deriving hypergraphs

  • Conference paper
  • First Online:
CAAP '92 (CAAP 1992)

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

Included in the following conference series:

  • 132 Accesses

Abstract

Transformations of hypergraphs by applying rewriting rules ate considered. An idea of programming such transformations and a suitable language with a denotational semantics is presented. It is shown that in this language one can program sequential and parallel processes of rewriting as particular cases.

This paper has been supported by Consiglio Nazionale delle Ricerche (G.N.I.M.) and by the Institute of Computer Science of the Polish Academy of Sciences

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bunke, H., Programmed Graph Grammars, in [CER 79]

    Google Scholar 

  2. Claus, V., Ehrig, H., Rozenberg, G., (Eds.) Proceedings of the 1st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, Springer LNCS 73, 1979

    Google Scholar 

  3. Corradini, A., Rossi, F., Parisi-Presicce, F., Logic Programming as Hypergraph Rewriting, to appear in the Proceedings of CAAP 91

    Google Scholar 

  4. Ehrig, H., Kreowski, H.-J., Rozenberg, G., (Eds.) Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science, to appear in Springer LNCS

    Google Scholar 

  5. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Löwe, M., Logic Programming and Graph Grammars, to appear in [EKR 91].

    Google Scholar 

  6. Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A., (Eds.) Proceedings of the 3rd Workshop on Graph-Grammars and Their Application to Computer Science, Springer LNCS 291, 1987

    Google Scholar 

  7. Maggiolo-Schettini, A., Winkowski, J., Towards a Programming Language for Manipulating Relational Data Bases, in: Bjorner, D., (Ed.), Formal Description of Programming Concepts II, North-Holland, 1983

    Google Scholar 

  8. Maggiolo-Schettini, A., Winkowski, J., Programmed Derivations of Relational Structures, to appear in [EKR 91]

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56100, Pisa, Italy

    Andrea Maggiolo-Schettini

  2. Institute of Computer Science, Polish Academy of Sciences, P.O.Box 22, 00-901, Warsaw, PKiN, Poland

    Józef Winkowski

Authors
  1. Andrea Maggiolo-Schettini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Józef Winkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. -C. Raoult

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maggiolo-Schettini, A., Winkowski, J. (1992). A programming language for deriving hypergraphs. In: Raoult, J.C. (eds) CAAP '92. CAAP 1992. Lecture Notes in Computer Science, vol 581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55251-0_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-55251-0_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55251-2

  • Online ISBN: 978-3-540-46799-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation