Language peer sets for PROGRES:
Designed 1990 ↑
1990s languages ↑
Business Data Processing ↑
Business Data Processing/1990↑
Business Data Processing/de ↑
Graph based programming languagealternate simple view
Sammet category: Business Data Processing
for PROgrammed GRaph REwriting Systems
Andy Scheurr and Albert Zuendorf, RWTH, Aachen, 1991
Very high-level language based on graph grammars. Supports multiple inheritance and type of types, declarative specification of graphical attributes, visual specification of graph rewrite rules.
"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.
Search in: Google Google scholar World Cat Yahoo Overture DBLP Monash bib NZ IEEE  ACM portal CiteSeer CSB ncstrl jstor Bookfinder