PROGRAMMED GRAPH REWRITING SYSTEMS

  

Copyright © Philip M. Parker, INSEAD. Terms of Use.

PROGRAMMED GRAPH REWRITING SYSTEMS

Specialty Definition: PROGRAMMED GRAPH REWRITING SYSTEMS

DomainDefinition

Computing

PROgrammed Graph REwriting Systems (PROGRES) A very high level language based on graph grammars, developed by Andy Scheurr and Albert Zuendorf of RWTH, Aachen in 1991. PROGRES supports structurally object-oriented specification of attributed graph structures with multiple inheritance hierarchies and types of types (for parametric polymorphism). It also supports declarative/relational specification of derived attributes, node sets, binary relationships (directed edges) and Boolean constraints, rule-oriented/visual specification of parameterised graph rewrite rules with complex application conditions, nondeterministic and imperative programming of composite graph transformations (with built-in backtracking and cancelling arbitrary sequences of failing graph modifications). It is used for implementing abstract data types with graph-like internal structure, as a visual language for the graph-oriented database GRAS, and as a rule-oriented language for prototyping nondeterministically specified data/rule base transformations. PROGRES has a formally defined semantics based on "PROgrammed Graph Rewriting Systems". It is an almost statically typed language which additionally offers "down casting" operators for run time checked type casting/conversion (in order to avoid severe restrictions concerning the language's expressiveness). Version RWTH 5.10 includes an integrated environment. [A. Scheurr, "Introduction to PROGRES, an Attribute Graph Grammar Based Specification Language", in Proc WG89 Workshop on Graphtheoretic Concepts in Computer Science", LNCS 411, Springer 1991]. (ftp://ftp.informatik.rwth-aachen.de/pub/Unix/PROGRES/) for Sun-4. (1993-11-02). Source: The Free On-line Dictionary of Computing.

Source: compiled by the editor from various references; see credits.

Top     

Crosswords: PROGRAMMED GRAPH REWRITING SYSTEMS

Specialty definitions using "PROGRAMMED GRAPH REWRITING SYSTEMS": PROGRES. (references)

Top     

Alternative Orthography: PROGRAMMED GRAPH REWRITING SYSTEMS


Hexadecimal (or equivalents, 770AD-1900s) (references)

50 52 4F 47 52 41 4D 4D 45 44      47 52 41 50 48      52 45 57 52 49 54 49 4E 47      53 59 53 54 45 4D 53

Leonardo da Vinci (1452-1519; backwards) (references)

            

Binary Code (1918-1938, probably earlier) (references)

01010000 01010010 01001111 01000111 01010010 01000001 01001101 01001101 01000101 01000100 00100000 01000111 01010010 01000001 01010000 01001000 00100000 01010010 01000101 01010111 01010010 01001001 01010100 01001001 01001110 01000111 00100000 01010011 01011001 01010011 01010100 01000101 01001101 01010011

HTML Code (1990) (references)

&#80 &#82 &#79 &#71 &#82 &#65 &#77 &#77 &#69 &#68 &#32 &#71 &#82 &#65 &#80 &#72 &#32 &#82 &#69 &#87 &#82 &#73 &#84 &#73 &#78 &#71 &#32 &#83 &#89 &#83 &#84 &#69 &#77 &#83

ISO 10646 (1991-1993) (references)

0050 0052 004F 0047 0052 0041 004D 004D 0045 0044      0047 0052 0041 0050 0048      0052 0045 0057 0052 0049 0054 0049 004E 0047      0053 0059 0053 0054 0045 004D 0053

Encryption (beginner's substitution cypher): (references)

50524941523547473938241523550422523957524354434841253595354394753

Top     



INDEX

1. Crosswords
2. Orthography
3. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.