Search Results for "xorlisp"

Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a...

... xorlisp which is also in progress, immutable binary forest nodes, so if millions of people build that together nobody can damage or change anyone else's data since its all constant. You dont change variables. You create new data that points at existing constant data, as deep as you need it. I have mindmap lists, definitions, and 2 editable properties working that way with 2 kinds of event listeners that work locally. Its not a networked system yet, but the datastructs are ready to scale with it.