gusl: (Default)
[personal profile] gusl
Paul Graham says:
Peter Norvig found that 16 of the 23 patterns in Design Patterns were "invisible or simpler" in Lisp

(no subject)

Date: 2004-02-21 03:19 pm (UTC)
From: [identity profile] mathemajician.livejournal.com
"invisible"?

(yeah ((they)(where((((probably))(hidden((((((by)))((all))) the)) (parentheses)))))

:-)

Re:

Date: 2004-02-21 05:28 pm (UTC)

(no subject)

Date: 2004-02-21 05:33 pm (UTC)
From: [identity profile] gustavolacerda.livejournal.com
If you read the document, there's actually stuff about Lisp itself. The whole concept of freedom of abstraction is pretty damn cool. You can't really beat Lisp (I guess that's because it's universal). As Graham said, if he should have to use patterns that would mean he should be writing code-generating macros (any patterns => non-optimal coding). But in Lisp you never need that.

I've wondered about how to combine Kolmogorov Complexity with readable code. (i.e. what's NICEST SHORTEST program?) Perhaps I should define readable fragments of languages... (training the machine to compress readable code isn't enough).

Re:

Date: 2004-02-21 05:44 pm (UTC)
From: [identity profile] techstep.livejournal.com
I'm vaguely familiar with Kolmogorov complexity and programs, but I'm not sure about formal methods of determining "readablility". Seems too subjective for me.

(no subject)

Date: 2004-02-21 04:44 pm (UTC)
From: [identity profile] daoistraver.livejournal.com
no doubt.

(I have a plan... involving Lisp and India. Could be good. If more materializes on it, I'll let you know.)

Re:

Date: 2004-02-22 08:40 pm (UTC)
From: [identity profile] chronicfreetime.livejournal.com
Just call it "Visual Lisp".

February 2020

S M T W T F S
      1
2345678
9101112131415
16171819202122
23242526272829

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags