The interpreter implemetation is pretty bad. It's not very fast, it's not very good, and it's probably not very correct. But maybe there's some vaguely interesting programs you could write with it!
For example, the Y combinator:
λf. (λx. f (x x)) (λx. f (x x))
\` \`1 `0 0 \`1 `0 0Also, this is likely way more compact than Brainfuck, as the lambda calculus is written essentially as usual.
And seriously, very cool!
Also shouldn't the indexes be expressed as a repeated character? Like "---" would be index 3. Integer literals are decidedly non-brainfuck as well.
putchar I feel kind of weird about, it acting as an identity function with a side effect is kind of weird; I'm not sure changing it to take a second argument as a continuation would make it better or worse.
Regarding the de Bruijn indices, I don't think there's a huge distinction between writing 3 vs writing ---: it would still form a single lexical token, so I feel like --- is just more noise.
Perhaps a de Bruijn index register you could move around and dereference? e.g. from index 1, index 3 is >>*, then index 2 from there is <*. But that feels less functional, because you're now imperatively manipulating some hidden state.
I quite like the movable register idea but as you say that's no longer a "BF except lambda calculus" it's some other esolang at that point.
I think my objection about the lack of continuations was misplaced given that appears to be a BF take on the lambda calculus rather than a BF take on scheme.
Agreed on having too many characters though, I don't like that having numerical indices makes the syntax whitespace-sensitive, too.
And once I figure out how to write hello world, those character literals are gone!
call/cc& = \f. \k. f k k
Still, doesn't it throw the de bruijn indexes off? Or am I wrong about that as well?
Lambda calculus makes my head hurt.
``f`,\0`,\0
Note that it's also possible to do I/O without additional primitives, as demonstrated in [1].
And yup, the order of evaluation is leftmost innermost.
``\\0`,.`,.
Please share the interpreter’s code, however bad you feel it is.
Also, definition of de Bruijn index for those of us without formal education: https://en.m.wikipedia.org/wiki/De_Bruijn_index
Anyhow, This is far too clear and straightforward, the bf analog to scheme would probably be unlambda, an implementation of the lambda calculus without lambda forms.
I could guess the age of the author based on this. Seems like history gets rolled up to generalizations after a while.
I'm not sure if I would characterize Brainfuck as a stack language, but I suppose if you considered all the operators to be unary stack operations I could see it!
Good call! I got rid of all numbers above 2, I can't count that high anyway ;-)
90s_dev•21h ago
How do you get the hello world working?
I tried pasting ,--('\< into the code and if it walks like a lamb and quacks like a duck into the stdin field.
jorkingit•20h ago
Groxx•18h ago