Martin Baldan writes:
> I have a little off-topic question.
> Why are there so few programming languages with true Polish syntax? I
> mean, prefix notation, fixed arity, no parens (except, maybe, for
> lists, sequences or similar). And of course, higher order functions.
> The only example I can t
On 3/19/2012 5:24 AM, Martin Baldan wrote:
but, hmm... one could always have 2 stacks: create a stack over the stack,
in turn reversing the RPN into PN, and also gets some "meta" going on...
Uh, I'm afraid one stack is one too many for me. But then again, I'm
not sure I get what you mean.
in t
>
> but, hmm... one could always have 2 stacks: create a stack over the stack,
> in turn reversing the RPN into PN, and also gets some "meta" going on...
Uh, I'm afraid one stack is one too many for me. But then again, I'm
not sure I get what you mean.
>
> + 2 * 3 4 => 24
Wouldn't that be "+ 2
On 3/18/2012 6:54 PM, Martin Baldan wrote:
BGB, please see my answer to shaun. In short:
_ I'm not looking for stack-based languages. I want a Lisp which got
rid of (most of the) the parens by using fixed arity and types,
without any loss of genericity, homoiconicity or other desirable
features.
BGB, please see my answer to shaun. In short:
_ I'm not looking for stack-based languages. I want a Lisp which got
rid of (most of the) the parens by using fixed arity and types,
without any loss of genericity, homoiconicity or other desirable
features. REBOL does just that, but it's not so good r
Hi, shaun, sorry for the delay.
Ambi is apparently a concatenative, stack-based language, similar to
Cat. Those are interesting for their own reasons (and they also have
their own problems) but it's not exactly what I'm thinking of.
REBOL is much closer, but I would like to have more diversity of
On 3/15/2012 9:21 AM, Martin Baldan wrote:
I have a little off-topic question.
Why are there so few programming languages with true Polish syntax? I
mean, prefix notation, fixed arity, no parens (except, maybe, for
lists, sequences or similar). And of course, higher order functions.
The only exam
This looks interesting: https://code.google.com/p/ambi/ - instead of
supporting infix it supports both polish and reverse polish. Can you give
some examples of what your ideal syntax would look like which illustrates
the "spoken language" aspect you touched on? -Shaun
On Thu, Mar 15, 2012 at 10:21
I have a little off-topic question.
Why are there so few programming languages with true Polish syntax? I
mean, prefix notation, fixed arity, no parens (except, maybe, for
lists, sequences or similar). And of course, higher order functions.
The only example I can think of is REBOL, but it has other
