Oct 24, 2017: Sebastiaan Joosten: Graph Saturation for Logic Programming for Graph Transformations for Programming

October 24, 2017Graph Saturation for Logic Programming for Graph Transformations for Programming
Room: Hal B 2BSebastiaan Joosten
12:30-13:30
As a distinction between low-level and high-level programming, one might say that a low-level program manipulates the computer memory: a sequence of bits, whereas a high-level program manipulates structured data.
Graphs are a generic way to model data structures, and therefore a graph transformation is a high-level program.
In this talk, we describe a part of a program I built, Amperspiegel.
Amperspiegel describes graph transformations in a high level way, through a form of logic programming (though in a language different from Prolog).
True to the paradigm of seeing programs as graph transformations, the engine to evaluate the logic program is implemented as a graph transformation.
This particular graph transformation is a saturation procedure that uses ideas from graph rewriting.