I wonder if micro-PROLOG isn't worth revisiting by someone:
You get pattern matching, backtracking and a nicer syntax than Prolog.
It's easy enough to extend with IsA and notions of classes of objects.
On 15/03/2012 13:01, Ryan Mitchley wrote:
It still doesn't fit well with a procedural model, in common with
Although, it has to be said that a procedural approach can be faked with
a combination of assertion and forward chaining.
IsASquare(X, Y) iff line(X, blah),
WRT: patterns, I wonder if the list is aware of the work by Barry Jay with
his Pattern Calculus http://www-staff.it.uts.edu.au/~cbj/patterns/,
wherein he introduces patterns as first class citizens at the lambda level.
On Thu, Mar 15, 2012 at 8:23 AM, Alan Kay alan.n...@yahoo.com wrote:
On Mar 14, 2012, at 17:17 , Jecel Assumpcao Jr. wrote:
Alan Kay wrote on Wed, 14 Mar 2012 05:53:21 -0700 (PDT)
No matter what Apple says, the reasons clearly stem from strategies and
of economic exclusion.
So I agree with Max that the iPad at present is really the anti-Dynabook
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
On Thu, Mar 15, 2012 at 5:23 AM, Alan Kay alan.n...@yahoo.com wrote:
You don't want to use assert because it doesn't get undone during
backtracking. Look at the Alex Warth et al Worlds paper on the Viewpoints
site to see a better way to do this. (This is an outgrowth of the labeled
It's in the book Semantic Information Processing that Marvin Minsky put
together in the mid 60s. I will get it scanned and send around (it is paired
with the even more class Advice Taker paper that led to Lisp ...
From: Wesley Smith
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.
My language pattern matching language which I call amethyst starts
coming close to generic tool for pattern matching.
For example it is easy to write generic highligther as I did for
On Thu, Mar 15, 2012 at 05:20:52AM
Alan Kay wrote on Wed, 14 Mar 2012 16:44:33 -0700 (PDT)
The CRISP was too slow, and had other problems in its details. Sakoman liked
Thanks for the information! Just looking at the papers about it I had
the impression that it would be reasonably faster than an ARM at the
The other two physical ideas were
-- via head mounted display (in glasses a la Ivan Sutherland's goggles -- ca.
1968 -- but invisible)
-- as embodied in the environment (a la Nicholas Negroponte's and Dick Bolt's
Dataland and Spatial Data Management System of the 70s).
In the late 60s, many
The theory Algebra of Communicating Processes (ACP)
offers non-determinism (as in Meta II) plus concurrency.
I will present a paper on extending Scala with ACP
next month at Scala Days 2012. For an abstract, see
A non-final version of the paper is at
Regarding these quotes from the early history of smalltalk re ST 71:
I had originally made the boast because McCarthy’s self-describing LISP
interpreter was written in itself. It was about “a page”, and as far as
power goes, LISP was the whole nine-yards for functional languages. I was
Mail list logo