notes icon indicating copy to clipboard operation
notes copied to clipboard

Published 20 hours ago • verified publisher icon void4

DAG maps

Open void4 opened this issue 7 years ago • 0 comments

Consider a language in which program code, data and runtime state could be represented as a Directed Acyclic Graph (DAG). If that language was required to be deterministic, unique DAG -> DAG mappings would be necessary.

How can one describe such mappings? Can the mapping itself be a DAG?

If this is possible I propose calling this "tree" language "Entish".

void4 avatar Sep 01 '17 10:09 void4