Path: utzoo!attcan!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!ukc!edcastle!cs.ed.ac.uk!cs.edinburgh.ac.uk!dts
From: dts@cs.edinburgh.ac.uk (Don Sannella)
Newsgroups: comp.lang.misc
Subject: Re: Complexity of syntax
Message-ID: <3823@skye.cs.ed.ac.uk>
Date: 19 Dec 90 21:49:35 GMT
References: <9012061208.AA08577@decpa.pa.dec.com> <1990Dec9.013923.14456@cs.umn.edu> <20@garth.UUCP> <27534.276e5bd3@kuhub.cc.ukans.edu>
Sender: nnews@cs.ed.ac.uk
Reply-To: dts@cs.edinburgh.ac.uk (Don Sannella)
Organization: Department of Computer Science, University of Edinburgh
Lines: 14

In article <27534.276e5bd3@kuhub.cc.ukans.edu>, kinnersley@kuhub.cc.ukans.edu (Bill Kinnersley) writes:
> ...  If you want a language with
> 1) Functions as first-class data (most applicative languages)
> 2) Arrays (mostly imperative languages)
> 3) Strong type system
> there's nothing left but Algol-68 and C.

... and ML.

Don Sannella
University of Edinburgh

P.S. Does C have a strong type system?  This must be some new development
I haven't heard about.