Skip to main content

Taking a little break from working on Potato to implement a playground of Henry G. Baker's Reversible Pointer Automata.

https://plover.com/~mjd/misc/hbaker-archive/ReverseGC.html

I think I might go ahead and implement Joy's linear combinators too.

http://tunes.org/~iepos/joy.html#linear

NREVERSAL of Fortune

plover.com
in reply to Devine Lu Linvega

Devine Lu Linvega
Devine Lu Linvega
• •
Looks like I'm implementing #joy afterall.
http://tunes.org/~iepos/joy.html#linear

The Theory of Concatenative Combinators

tunes.org
#joy
in reply to Devine Lu Linvega

opfez
opfez
• •
interested to see how joy's dynamic quotations will work in your implementation, since to me it looks like it requires a garbage collector?
in reply to opfez

Devine Lu Linvega
Devine Lu Linvega
• •
@opfez I'm following psi-lisp more than joy for the implementation and there is not GC in it.
@opfez
in reply to Devine Lu Linvega

Devine Lu Linvega
Devine Lu Linvega
• •
@opfez like linear lisp, every destruction will be explicit with something like (kill x)
@opfez
in reply to Devine Lu Linvega

opfez
opfez
• •
so it sort of has manual memory management? i'm sorry if i'm misunderstanding, i just haven't heard about this stuff before '^^
in reply to opfez

Devine Lu Linvega
Devine Lu Linvega
• •
@opfez yup! Psi-lisp designed so there's never any loss, every operation is reversible, so you can't get rid of "garbage" or you wouldn't be able to rewind the time. Here's a little primer on linear lisp, which is a lisp where each variable can only ever be referenced once:
https://plover.com/~mjd/misc/hbaker-archive/LQsort.html

ACM Sigplan Notices 29, 2 (Feb. 1994), 13-18.

plover.com
@opfez
in reply to Devine Lu Linvega

leah & nybbles & bytes, oh my!
leah & nybbles & bytes, oh my!
• •
@opfez presumably in psi-lisp that'll push x onto a stack, ready for revive to bring it back again?
@opfez
in reply to leah & nybbles & bytes, oh my!

Devine Lu Linvega
Devine Lu Linvega
• •
@millihertz @opfez possibly, right now i just roll the stack and never discard anything. I have started implementing something like unlit() which throws an error if the top of the stack is not equal to the value I'm trying to kill, but I might remove it altogether and just use super deep stacks.
@leah & nybbles & bytes, oh my! @opfez
Unknown parent

Devine Lu Linvega
Devine Lu Linvega
• •
@noa losangeles12 :mac:
Unknown parent

Devine Lu Linvega
Devine Lu Linvega
• •
@protodrew It's from LAST LOVE, I feel like it's probably the same producer, just a different name
@protodrew
Unknown parent

Devine Lu Linvega
Devine Lu Linvega
• •
@protodrew do you like JOST? https://www.youtube.com/watch?v=tgX22jdYzEw

wreckage

Provided to YouTube by Repost Networkwreckage · JÖST · kirxcywreckage℗ JÖST x kirxcyReleased on: 2021-06-16Auto-generated by YouTube.
YouTube
@protodrew
Unknown parent

Devine Lu Linvega
Devine Lu Linvega
• •
@protodrew :goose_honk:
@protodrew
in reply to Devine Lu Linvega

dethe
dethe
• •
This bit at the opening of Baker's (1992) paper makes me realize once again we are in the wrong timeline: "A physics revolution is brewing in computer science because many of the abstract models traditionally used have failed to provide deep insight into parallel and distributed computation."

Lo, thar be cookies on this site to keep track of your login. By clicking 'okay', you are CONSENTING to this.

⇧