|Grammars for future languages firstname.lastname@example.org (1995-10-22)|
|Grammar for future languages (2) email@example.com (Jacco van Muiswinkel) (1995-11-09)|
|What does the world want from a programming language? (Re: Grammar for firstname.lastname@example.org (1995-11-09)|
|Re: What does the world want from a programming language? (Re: Grammar email@example.com (1995-11-13)|
|From:||firstname.lastname@example.org (Jim Hill)|
|Organization:||biological <-- hey! a one-word oxymoron!|
|References:||95-10-103 95-11-040 95-11-081|
|Date:||Mon, 13 Nov 1995 13:22:02 GMT|
email@example.com (Torben AEgidius Mogensen) wrote:
>Another way is to provide very high level constructs in the language, ...
>Another way to decrease production time is (semi-)automatic
>configuration of code
I think these two are different views of the same thing. Specify the
operations you want to do on a collection (to avoid 'list') and let the
"compiler" use hints and feedback to dope out what structures and
algorithms to implement so the operations you use most go fast. Heavy
doses of this would I think produce source that looks a lot like database
languages, but databases don't typically rewrite layouts and boundaries to
match observed access patterns...
firstname.lastname@example.org PGPrint: 6B 85 76 D1 EF BA 2C 78 12 25 8A 5A BF F3 37 7E
Return to the
Search the comp.compilers archives again.