LEADER 03593nam  22006375  450 
001 996466162903316
005 20200702120828.0
010   $a3-540-49419-7
024 7 $a10.1007/BFb0031909
035   $a(CKB)1000000000234295
035   $a(SSID)ssj0000322820
035   $a(PQKBManifestationID)11227168
035   $a(PQKBTitleCode)TC0000322820
035   $a(PQKBWorkID)10289912
035   $a(PQKB)11689552
035   $a(DE-He213)978-3-540-49419-5
035   $a(PPN)155230069
035   $a(EXLCZ)991000000000234295
100   $a20121227d1995      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aEfficient Graph Rewriting and Its Implementation$b[electronic resource] /$fby Heiko Dörr
205   $a1st ed. 1995.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995.
215   $a1 online resource (X, 266 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v922
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-60055-8 
327   $aGraph 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.
330   $aThis 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 rewriting. Second, an abstract machine for graph rewriting is defined providing an instruction set sufficient for the execution of GRS. The basic definitions of GRS in the algorithmic approach are introduced and extended by attribution and control structures to comprise a formalism for an operational specification. The translation of a functional programming language to graph rewriting shows the capabilities of UBS-GRS.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v922
606   $aComputers
606   $aMathematical logic
606   $aProgramming languages (Electronic computers)
606   $aSoftware engineering
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
606   $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029
615  0$aComputers.
615  0$aMathematical logic.
615  0$aProgramming languages (Electronic computers).
615  0$aSoftware engineering.
615 14$aTheory of Computation.
615 24$aMathematical Logic and Formal Languages.
615 24$aProgramming Languages, Compilers, Interpreters.
615 24$aSoftware Engineering.
676   $a005.13/1
700   $aDörr$b Heiko$4aut$4http://id.loc.gov/vocabulary/relators/aut$0754775
906   $aBOOK
912   $a996466162903316
996   $aEfficient graph rewriting and its implementation$91518985
997   $aUNISA