4 ms·
I've been working on a guaranteed-terminating language in the vein of APL/J. Primitive recursion is possible, but with the looping all implicit due to array sha
by kd0amg 14y ago
I've been working on a guaranteed-terminating language in the vein of APL/J. Primitive recursion is possible, but with the looping all implicit due to array shape, infinite looping is impossible. The issue I'm not sure how to handle is that some algorithms take the form, "repeat the following until convergence: ..." with no obvious way for a machine to prove that convergence will eventually happen.
- tomrod 14y agoI thought this might be the APL language. Now I'm not so sure... But it is, there looks to be some loops here http://www.apl.jhu.edu/~hall/Lisp-Notes/Loop-Summary.html http://www.apl.jhu.edu/~hall/Lisp-Notes/Loop-Summary.html
- kd0amg 14y agoI guess "APL" in that context means "Applied Physics Laboratory."