Lambda the Ultimate

For those who like their PL History presented in avante guard beat poetry, a video of Steele & Gabriel's 50 in 50 speech at JAOO is made to order. Or as the link says:

A fun, artistic and enlightning presentation full of interesting facts - and who better to do it than Richard P. Gabriel and Guy L. Steele (the great Quux). Nothing more to say than the rallying cry; More cowbell!

Passing aside the Stephen Wright comic delivery of the two speakers, there are a lot of interesting thoughts, though very few are dwelled on. I think the most interesting things were the languages that they chose as expositions for the major ideas that they covered. Here's the ones that I picked out (though I ended up with only 49):

Do Loops	Fortran (Pascal,APL)	Guarded Commands	Algol-68
Array Origin	C, Fortan, Pascal, APL	Extensible Language	PPL
Domain Specific Language	APT	Structured Programming	BLISS, INTERCAL
Text vs. Environment	Algol-60, Lisp, Smalltalk	Language as Educational Tool	Logo
Stack Machines	Befunge (SECD Machine, Forth)	Formal Dynamic Semantics	SECD
Data Parallelism	APL	Enumerated Types	Pascal
Coercion	PL/I (Fortran-V)	Backtracking and Theorem Proving	Conniver (Prolog)
Hierarchical Records	COBOL	Argument Handling	Common Lisp, Ada, Python (VB, C#, Suneido, PL/pgSQ)
Pointers & Lists	IPL-V	Coding in Natural Language	Perligata (COBOL, Hypercard)
Parsing	Yacc (LR1, Recursive Descent)	Computational Drama	Shakespeare
Linked Records	AED	Reasoning	Prolog
Mathematical Syntax	MADCAP, MIRFAC, Kleerer-May System	Type Declarators	C
Line Numbers	Basic (Focal, APL)	Data Abstraction	CLU, Alphard
Visual Languages	Piet	Dynamic vs. Lexical Scoping	Scheme
Pattern Matching & Replacement	COMIT, SNOBOL	Knowledge Representation	KRL (Conniver, Microplanner)
Branding	Ada (COMIT, SNOBOL, TRAC)	Stream Processing	Lucid
Dynamic Languages	AMBIT/L	Generic Functions	Common Lisp
Program as Data	Lisp	Reflection	3-Lisp
Macro Processor	TRAC, ML/I, Limp, M4	Metacircular Interpreters	Lisp
Call By Name vs. Call By Value	C, Algol-60	Functional Programming	KRC
Dangling Else	Algol-60	Control Parallelism	Occam
Formal Static Semantics	Algol-68	Domain Specific Languages	HQ9+, MUMBLE
Algebraic Formula Manipulation	Formac (Macsyma, Mathematica)	Build Languages	Make, Ant, Rake (JCL)
Message Passing	Smalltalk (C++, C#, Java, Flavors, Common Loops, CLOS, Scheme, Dylan, Simula, Self)	Scripting	Perl
Objects	Simula (Smalltalk, C++, Java)

ABSTRACT

The Formalization of the OOP Paradigm: INHERITANCE OF ABSTRACT AUTOMATA
is devoted to discussion of the inheritance
relation on sets of Mealy automata. It continues study

Formalization of the OOP Paradigm

in which:

- the concept of abstract data type (or, what is the same, of a class)
is treated as an abstract automaton;

- relations of inheritance and polymorphism are introduced on sets of the Moore automata.

Proposed formalization of OOP notions significally differs from the
formalization of Luca Cardelli (see, for example, "A Semantics of Multiple Inheritance",
1988, Information and Computation 76, 138-164, 1988; http://lucacardelli.name/; ).