libera/#lisp - IRC Chatlog
Search
15:02:09
lisbeths
I want to make a version of schemes like this but I want it to be able to be purely reversible and so I have to give up tail call recursion optimization
15:02:41
lisbeths
I also want the interpreter of this to fit into the boot sector of a floppy like sector lisp or sector 4th and I can actually implement this in both sector list and in sector 4th
15:03:09
lisbeths
also this syntax is possible with pure untyped curried lambda calculus if you have the ability to make definitions
15:04:42
lisbeths
I think your example Jack Daniel would have to mean that the number one could take an argument otherwise what that would do is return one and then immediately begin calculating as if x were a function that needed to take an argument otherwise it would be a syntax error
15:24:22
White_Flame
the reverse one is of course more popular, but that's the term for nested expressions without any bounding syntax
15:25:48
White_Flame
and IMO the only reason to ever use forward polish notation is when you need something utterly simplistic to implement, because the code isn't that great to work with
15:37:05
lisbeths
also I think reverse Polish notation requires infix notation to do a definition doesn't it
15:39:35
Alfr
lisbeths, not really. Can think about it as putting things onto a stack and operators taking some of those and putting results back.
15:40:36
lisbeths
I have played with fourth and it does not feel as clean as what I am describing in ml curried syntax
15:56:30
lisbeths
One of the problems with this notion is that if data goes on the stack and if all that functions do is manipulate data then it creates a separation between data and functions