I kind of like this :)
\[
\limit{P}{year \rightarrow (current\_year + 1)}
= Lisp_{1989} + (type\_inference)
\]
where $P$ = "any programming language not in the Lisp family".
And, of course, INTERCAL is still far superior to Common Lisp, not to
mention kwikkalkul (or whichever way you write it) :)
Cheers
--
Marco Antoniotti ===========================================
PARADES, Via San Pantaleo 66, I-00186 Rome, ITALY
tel. +39 - 06 68 10 03 17, fax. +39 - 06 68 80 79 26
http://www.parades.rm.cnr.it/~marcoxa
From: Tim Bradshaw
Subject: Re: Fundamental Theorem of Programming Languages...
Date:
Message-ID: <nkjlnd08zz3.fsf@tfeb.org>
Marco Antoniotti <·······@copernico.parades.rm.cnr.it> writes:
> I kind of like this :)
>
> \[
> \limit{P}{year \rightarrow (current\_year + 1)}
> = Lisp_{1989} + (type\_inference)
> \]
> where $P$ = "any programming language not in the Lisp family".
>
It is a simple matter to generalise this theorem to include some
languages in the lisp family. An existence proof is CMUCL.
--tim
From: Fernando Mato Mira
Subject: Re: Fundamental Theorem of Programming Languages...
Date:
Message-ID: <377B3C98.719DF04B@iname.com>
Marco Antoniotti wrote:
> \[
> \limit{P}{year \rightarrow (current\_year + 1)}
> = Lisp_{1989} + (type\_inference)
> \]
> where $P$ = "any programming language not in the Lisp family".
You cheat! What happens at Y2K? ;-)