Efficient graph rewriting and its implementation
This book presents two major research results on the fast implementation of graph rewriting systems (GRS). First, it explores the class of so-called UBS-GRS, where the complexity of a rewriting step is linear instead of NP, showing for example that visual programming is possible by UBS graph rewriti...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
922 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Efficient graph rewriting and its implementation, Heiko Dörr, New York, Springer-Verlag, 1995, 1 vol. (IX-266 p.), Lecture notes in computer science, 3-540-60055-8 • Efficient Graph Rewriting and Its Implementation, Texte imprimé, 9783662214855 |
Sadržaj:
- Graph rewriting systems The basic concepts
- UBS-Graph rewriting systems matching subgraphs in constant time
- Programmed attributed graph rewrite systems An advanced modelling formalism
- The abstract machine for graph rewriting supporting a fast implementation
- A graphical implementation of functional languages a case study in UBS-graph rewriting systems
- Conclusions.