@wim_v12e If you're interested in scratching at this problem, here's this sample Joy program ported to Uxntal as an example:
LIT BRK LIT DUP LIT POP SWP ( i ) [ #00 STR $1 ] ( i ) [ #00 STR $1 ]
@wim_v12e The Church bools and AND operator in uxntal:
( true #02 ) LIT POP
( false #03 ) LIT NIP
( and ) DUP [ #00 STR $1 ]
@neauoire The ( i ) had me puzzled but it's just an inline comment, isn't it?
I think I will change my quoting approach to be more in line with Joy, that might be a good starting point. Then I can implement cat in my system.
What does the $1 do in your AND operation?
@neauoire I was looking at lambda functions, not at the lambda calculus. I was mainly curious to see if I could have anonymous functions and quoting.
I'll have a look though as it is interesting. But you seem to have already done it?
@wim_v12e no, not completely, I have a draft of some things, but I haven't been able to add 2 church numbers together in uxntal yet :<
@neauoire The main difference with Joy is that in Uxntal you can't have quoted lists on the stack. You could of course put them in memory and that is the approach I've taken, but I imagine that is not what to had in mind, because the list manipulation involves counting so it kind of defeats the purpose. Otoh, the VM also needs to count to manage the stack ...
Revel in the marvels of the universe. We are a collective of forward-thinking individuals who strive to better ourselves and our surroundings through constant creation. We express ourselves through music, art, games, and writing. We also put great value in play. A warm welcome to any like-minded people who feel these ideals resonate with them.