This is the Linux app named xorlisp whose latest release can be downloaded as xorlisp_0.1.0_continuationsAlmostWorking_runOnConsole_or_unzipToGetSource.jar. It can be run online in the free hosting provider OnWorks for workstations.
Download and run online this app named xorlisp with OnWorks for free.
Follow these instructions in order to run this app:
- 1. Downloaded this application in your PC.
- 2. Enter in our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.
- 3. Upload this application in such filemanager.
- 4. Start the OnWorks Linux online or Windows online emulator or MACOS online emulator from this website.
- 5. From the OnWorks Linux OS you have just started, goto our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.
- 6. Download the application, install it and run it.
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 pair of stack and queue. The stack is a linked list of pair of true or false and object pushed on the stack. The queue is also such a linked list but is paired oppositely so previous queue state goes on the left and next object queued on the right of the new pair, so when the queue is navigated in sequence of that astronomically long bitstring (thats exponential of reusing objects in the acyclicNet), the Nav32 (using linearForward and treeForward for random access) first sees the oldest object queued
- Not a working computing or data system yet, but nearly there
- provable lack of duplicate objects in the acyclic network of pairs
- so minimalist that you dont get variable names until deriving them from list of bits to represent unicode/UTF8 text. By not assuming variable names exist, we bypass the need to manage renaming during lambda calls.
- bit level spec for the entire system based on lambda being a queue automata like Rule110 is
- Designed for grid computing and GPUs, in future versions
Science/Research, Advanced End Users, Developers, Security Professionals
Web-based, Console/Terminal, Plugins
Java, Project is a programming language
This is an application that can also be fetched from https://sourceforge.net/projects/xorlisp/. It has been hosted in OnWorks in order to be run online in an easiest way from one of our free Operative Systems.