5 ms·
has tree calculus been used to prove something interesting about something that is not tree calculus?
by orangea 4d ago
has tree calculus been used to prove something interesting about something that is not tree calculus?
- MelonUsk 3d agoIt basically has 3 rules: the first two are K (“deletion”) and S combinator (“copying/spreading”), the 3rd is F: That is like “selection/choosing” of the 1, 2 or 3 node structure to operate on, if I understood correctly: / or \ (think 0 or 1) 2 nodes: / \ Or \ / 3 nodes: \ /\ Or / /\ The whole program in binary calculus is not just a mess of zeros and ones in a binary form but has structure, so you can visually see lists, iteration, recursion, etc You can theoretically code GTA-6 or the universe very much like ours using a binary tree ;-) This language also has types and as far as I understood it was already implemented in itself - the whole parser/compiler fits on a book page Better to hear from the author himself: https://youtu.be/aer5fH-OxeE https://youtu.be/aer5fH-OxeE