<https://johncarlosbaez.wordpress.com/2020/12/04/g...
# linking-together
e
are you using graph transformation in any projects?
c
A bit, in managing the graph representation of the IaaS where I work - trying to discover morphs that leave assets stranded
e
what sort of graph representation do you use? Do you work off of a graph database?
j
The language I am (sporadically) working on is term rewriting based. But I have considered trying to do jungle evaluation as a performance optimization. Not quite to the point where that matters yet though. https://www.cs.york.ac.uk/plasma/publications/pdf/HabelKreowskiPlump.88.pdf
d
Onex is definitely based on tree rewriting, but could be graph rewriting depending on what is the formal difference between the two! Ask me a tree or graph rewriting discrimination question 😊
e
guys feel free to add copious links in this chats. I had no idea what onex was, luckily it was google-able http://object.network/index-non-tech.html 🙂
also I'm not sure what's the language you are sporadically working on @Jimmy Miller but I recognize you as "that guy from the meander talk" 😛
j
Glad to be recognized 🙂 Yeah, I’ve been working on a language that does the think I sketched at the end of that talk. If I ever get back to working on it, I should have some nice things there. Very close to having a time-traveling debugger in like 5-7 lines of userland code.
👍 1
d
GReTA: "a platform for the international graph rewriting community, to promote recent developments and trends in the field, and to permit a regular networking and interaction between members of this community" Okay, so where do I go if I'm newb and merely want to learn more about graph rewriting?
In particular I would like to know ways in which graph rewriting can be somehow superior to traditional, um, programs; the topic is only interesting to me insofar as it can provide a better way to accomplish something.
e
@David Piepgrass I have it on my backburner to study https://en.wikipedia.org/wiki/GrGen, "a tool optimized for the processing of graph structured data. The core of the languages consists of modular graph rewrite rules, which are built on declarative graph pattern matching and rewriting"
it is based on .NET so it should be up your alley 🙂
ohhh apparently also has a Java version... cool 🙂