From the bibliography of chapter 1 of the 1962 A Programming Language, I found this intriguingly concise description of a forward-Polish (Lukasiewicz) Logic Machine. And I think I'm with it up to this part on the Logic Function F:
What does (2a) mean? How is this a function?
Here's my implemen...
The mathematical formulation is nice and concise, but as I discovered, it doesn't translate straight into nice and concise programming. At least not if you're too literal.
Yeah. It took me quite a bit of time to crack it. What they were talking about.
But it was good exercise (for me).
More recently, I've actually read Lukasiewicz's book.
But there's some more documents in the early history of polish/reverse-polish syntax that I haven't gotten ahold of yet. Samelson and Brown, I think are their names. I wish I hadn't let my acm expire.
Basically, it's Lisp without parentheses. Because all the operators have a fixed number of parameters.