A tumblog by Fogus about the radical...
The officer, who has not been identified, approached and saw that the naked man was actually chewing the other man’s head, according to witnesses. The officer ordered the naked man to back away, and when he continued the assault, the officer shot him. The attacker continued to eat the man, despite being shot, forcing the officer to continue firing. Witnesses said they heard at least a half dozen shots.
a prolog in haskell

there were eight systems that I thought were really nifty and cried out to be unified somehow:

  1. Joss

  2. Lisp

  3. Logo — which was originally a unification of Joss and Lisp, but I thought more could be done in this direction).

  4. Planner — a big set of ideas (long before Prolog) by Carl Hewitt for logic programming and “pattern directed inference” both forward and backwards with backtracking)

  5. Meta II — a super simple meta parser and compiler done by Val Schorre at UCLA ca 1963

  6. IMP — perhaps the first real extensible language that worked well — by Ned Irons (CACM, Jan 1970)

  7. The Lisp-70 Pattern Matching System — by Larry Tesler, et al, with some design ideas by me

  8. The object and pattern directed extension stuff I’d been doing previously with the Flex Machine and afterwards at SAIL (that also was influenced by Meta II)

One of the schemes was to really make the pattern matching parts of this “work for everything” that eventually required “invocations and binding”. This was doable semantically but was a bear syntactically because of the different senses of what kinds of matching and binding were intended for different problems. This messed up the readability and desired “simple things should be simple”.

Examples I wanted to cover included simple translations of languages (English to Pig Latin, English to French, etc. some of these had been done in Logo), the Winograd robot block stacking and other examples done with Planner, the making of the language the child was using, message sending and receiving, extensions to Smalltalk-71, and so forth.

I think today the way to try to do this would be with a much more graphical UI than with text — one could imagine tiles that would specify what to match, and the details of the match could be submerged a bit.

More recently, both OMeta and several of Ian’s matchers can handle multiple kinds of matching with binding and do backtracking, etc., so one could imagine a more general language that could be based on this.

On the other hand, trying to stuff 8 kinds of language ideas into one new language in a graceful way could be a siren’s song of a goal.

Alan Kay on FONC
2 months ago
0 notes

How many lines of Java would it take…

… to do this?

obj.class.superclass.public_instance_methods(false).sort
4 months ago
16 notes
a search for 'chess' at MIT's DSpace

There is a lot of chess programming history to find.

4 days ago
0 notes
current status

current status

4 days ago
0 notes
Best zombie scene… evar!

Best zombie scene… evar!

4 months ago
4 notes
I am so clever that sometimes I don’t understand a single word of what I am saying.