http://www.paulgraham.com/paulgraham/avg.html
I wonder how Haskell compares in this regard.
I loved Graham's characterization of the hierarchy of power in
programming languages:
- Languages less powerful than the one you understand look impoverished
- Languages more powerful than the
- Original Message -
From: Norman Ramsey [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Sent: Thursday, May 03, 2001 7:16 AM
Subject: Re: Interesting: Lisp as a competitive advantage
http://www.paulgraham.com/paulgraham/avg.html
I wonder how Haskell compares in this regard.
I loved
Subject: Re: Interesting: Lisp as a competitive advantage
Date: Thu, 03 May 2001 10:16:37 -0400
From: Norman Ramsey [EMAIL PROTECTED]
http://www.paulgraham.com/paulgraham/avg.html
I wonder how Haskell compares in this regard.
I loved Graham's characterization of the
On Thu, May 03, 2001 at 04:25:45PM -0400, Alan Bawden wrote:
Here's a macro I use in my Scheme code all the time. I write:
(assert ( x 3))
Which macro expands into:
(if (not ( x 3))
(assertion-failed '( x 3)))
Where `assertion-failed' is a procedure that generates an
Norman Ramsey wrote:
I would love to hear from a real Lisp macro hacker who has also done
lazy functional progrmaming.
I am such a person.
Lisp macros are a way to extend the Lisp compiler. Dylan's example
shows why this reflective power is sometimes useful. Here is another
example. I
Tim Sauerwein wrote:
I once wrote a macro to help express pattern-matching rules.
In these rules, variables that began with a question mark were treated
specially.
David Gifford's Programming Languages class at MIT uses Scheme+, a variant
of MIT Scheme with datatypes and pattern
