Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

LISP [part λ f x. f (f x)]

Name: Anonymous 2008-01-31 8:38

LISP

Name: Anonymous 2008-02-19 19:38

>>760
ξ-reduction

Name: Anonymous 2008-02-20 7:16

LISP LISP LISP

Name: Anonymous 2008-02-20 9:30



LISP LIPS LSIP LSPI LPIS LPSI ILSP ILPS ISLP ISPL IPLS IPSL SLIP SLPI SILP SIPL SPLI SPIL PLIS PLSI PILS PISL PSLI PSIL


Name: Anonymous 2008-02-20 9:55

>>763
Done using
[[a,b,c,d] | a <- ['L', 'I', 'S', 'P'], b <- ['L', 'I', 'S', 'P'], c <- ['L', 'I', 'S', 'P'], d <- ['L', 'I', 'S', 'P']]-mode

Name: Anonymous 2008-02-20 9:57

>>764
LISP

Name: Anonymous 2008-02-20 10:01

Wait, these are permutations with repetition. How do I permute without repetition?

Name: Anonymous 2008-02-20 10:06

>>766
man uniq

Name: Anonymous 2008-02-20 10:21

>>764
actually no. it's from a c program i wrote that prints permutations.

Name: Anonymous 2008-02-20 10:22

>>766,768
lrn2lisp

Name: Anonymous 2008-02-20 10:28

>>768
Actually, no, it was an one-liner from standard Haskell library that prints permutations.

Name: Anonymous 2008-02-20 10:29

>>767
I mean in Haskell.

Name: Anonymous 2008-02-20 10:31

LISP

Name: Anonymous 2008-02-20 10:32

LISP

Name: Anonymous 2008-02-20 10:33

LISP

Name: Anonymous 2008-02-20 10:40

>>771
Pipe the output into uniq.

Name: Anonymous 2008-02-20 10:54

>>775
That ain't no Haskell then.

Name: Anonymous 2008-02-20 10:54

Oh, also chmod allow all GET.

Name: Anonymous 2008-02-20 11:16

>>777
$ chmod allow all
chmod: invalid mode: `allow'
Try `chmod --help' for more information.

Name: Anonymous 2008-02-20 12:12

>>778
$ chmod allow all
chmod: invalid mode: `allow'
Try `chmod --help' for more information.

chmod: invalid mode: `allow'
mode: `allow'
allow-mode

Name: Anonymous 2008-02-20 12:16

chmod: invalid mode: `allow'
invalid mode: `allow'
`allow'
`'

WRYYYYYYYYYYYYYYYYYY

Name: Anonymous 2008-02-20 12:17

>>780
What's the matter with char.properQuotes?

Name: Anonymous 2008-02-20 12:23

>>766
lexPerms [] = [[]]
lexPerms l = concatMap (\(x,y) -> map (x:) $ lexPerms y) $ cp [] l where
    cp p (x:xs) = (x,p++xs) : cp (p++[x]) xs
    cp p _ = []

Name: Anonymous 2008-02-20 12:53

>>782
I don't understand ;_;

Name: Anonymous 2008-02-20 13:08

>>783
READ SICP

Name: Anonymous 2008-02-20 13:10

>>784
Please explain the function.

Name: Anonymous 2008-02-20 13:49

LISP

Name: Anonymous 2008-02-20 17:31

LISP

Name: Anonymous 2008-02-20 19:47

>>1-787
LISP

Name: Anonymous 2008-02-20 19:49

Therefore, lisp

Name: Anonymous 2008-02-20 19:50

AD LISP

Name: Anonymous 2008-02-20 19:51

LISP >>= LISP -> LISP

Name: Anonymous 2008-02-20 19:54

LISP

Name: Anonymous 2008-02-20 23:26

L=P

Name: Anonymous 2008-02-21 1:22

LISP

Name: Anonymous 2008-02-21 2:02

>>791
LISP lisp => lisp -> lisp

Name: Anonymous 2008-02-21 4:00

I AM SAGING THIS THREAD FOR THE FOLLOWING REASONS:

Name: Anonymous 2008-02-21 4:10

>>796
LISP

Name: Anonymous 2008-02-21 4:24

>>1-797 is the same person and we have been trolled constantly.

Name: Anonymous 2008-02-21 4:28

LISP

Name: Anonymous 2008-02-21 4:29

LISP

Newer Posts