Graph Based Languages

Fundamental notions on Graph Based Languages

Description

Domain specific languages for workflow are based on the execution of a directed graph. Graph Programming is the foundation for all domain specific languages. A Graph-Based Language (GBL) utilizes graph structures as a fundamental means of representing and manipulating data. Actions are represented as nodes, and the sequence of them is represented as edges. This approach that puts graphs at the center of the stage allows for intuitive modeling and analysis of complex relationships, dependencies, and networks.

Mind Interpreter

The Mind Interpreter utilizes a combination of domain specific languages, graph-oriented programming, LLMs and other advanced tools. It is possible from a simple conversation to generate, interpret, and execute a graph which represents a series of actions.

Turing Compatibility

The Mind Interpreter covers Turing compatibility, since it has the following capabilities:

• ✅ Conditional branching ("if-then-else" node)

• ✅ Ability to change arbitrary amounts of memory (variables in scopes)

• ✅ A form of loop (a directed graph has cycles)

Graph

The program structure flow is represented by a directed graph. The graph can have multiple starting points represented by Start Nodes. Similarly, there can be multiple End Nodes, representing various points where the program produces its final results.

The graph's structure is defined by the arrangement of Middle Nodes, which can be actions or control structures, influencing the program's flow and behavior.