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

IVE READ SICP

Name: Anonymous 2007-05-02 8:07 ID:A1TytIIg

http://i13.tinypic.com/63ijdck.jpg
NOW THAT I HAVE READ SICP I AM AN EXPERT PROGRAMMER

Name: Anonymous 2007-05-02 8:12 ID:A1TytIIg

Roses are red,
Violets are blue,
ive read SICP,
have you?

Name: Anonymous 2007-05-02 8:16 ID:OijS/EIv

>>1
>>2
Does that have anything to do with the topic, or is that just your way of saying 'I've read SICP'?

Name: Anonymous 2007-05-02 9:21 ID:EuOfee22

car = exp true
cdr = exp false

POINTFREE

Name: Anonymous 2007-05-02 12:10 ID:A1TytIIg

ONE WORD, IVE READ SICP, THREAD OVER

Name: Anonymous 2007-05-02 20:25 ID:sCppwNk5

>>5
Does that have anything to do with the topic, or is that just your way of saying "I've read SICP"?

Name: Anonymous 2007-05-02 22:14 ID:CatptRb7

Awesome

Name: Anonymous 2007-05-02 22:36 ID:A1TytIIg

IVE READ SICP ━━━( ゚∀゚ )━(∀゚ )━(゚  )━(  )━(  ゚)━( ゚∀)━( ゚∀゚ )━━━!!!!

Name: Anonymous 2007-05-03 2:25 ID:Heaven

YOU MIGHT HAVE READ SICP
BUT YOU CLEARLY HAVE NO EYE FOR VISUAL BEAUTY
CODE IS ART
THEREFORE, YOU ARE NOT AN EXPERT PROGRAMMER

Name: Anonymous 2007-05-03 2:48 ID:PQ7Rpk1A

>>9
;_;

i hope your joking
:(

Name: Anonymous 2007-05-03 3:23 ID:tT98w50p

>>9
What you say? That picture is a magnificent piece of art.

Name: Anonymous 2007-05-03 4:04 ID:PQ7Rpk1A

>>11
Hah! THANK YOU!@ (ive read sicp)

Name: Anonymous 2007-05-03 4:06 ID:hTjJxaXr

>>1
CODE HAS BEEN FORCIBLY INDENTED BY PROGRAMMING PRACTICE, THREAD OVER.

Name: Anonymous 2007-05-03 4:44 ID:PQ7Rpk1A

>>13
ONE COMPARISON, FORCIBLY BUT NOT FORCED, YOU OVER

Name: Anonymous 2007-05-03 8:33 ID:rpWfW5uU

SICP READ ME

Name: Anonymous 2007-05-03 14:22 ID:aPYoqLEx

>>12
is that even relevant to the topic or is this just your way of saying "ive read SICP"?

Name: Anonymous 2007-05-03 18:19 ID:PQ7Rpk1A

sicp?!

Name: Anonymous 2007-05-04 2:19 ID:DAu/lhKC

ONE SEGFAULT, THE FORCED ACCESS OF MEMORY, "EXPERT PROGRAMMER" OVER.

Name: Anonymous 2007-05-04 9:21 ID:+VD6NKoD

>>18
lollol

Name: Anonymous 2007-05-04 9:53 ID:1rCA1Ovu

>>18
ONE SEGFAULT, THE FORCED ACCESS OF MEMORY, THE BIRTH OF AN "EXPERT PROGRAMMER".

Name: Anonymous 2007-05-04 10:33 ID:+VD6NKoD

>>20
explain yourself, NOW.

Name: Anonymous 2007-05-04 12:09 ID:dRVX7DTH

>>21
I don't have to give reasons for anything I say, because I am an EXPERT PROGRAMMER.

Name: Anonymous 2007-05-04 12:11 ID:1rCA1Ovu

>>21
You can't claim to be an EXPERT PROGRAMMER unless all your code randomly segfaults.

Name: Anonymous 2007-05-04 12:58 ID:3sRJYHaM

>>23
sorry but EXPERT PROGRAMMERS use type safe languages and prove that thier programs terminate.

Name: Anonymous 2007-05-04 13:55 ID:HNZ1Q9Iz

>>24
sorry but TYPE SAFE LANGUAGES are not enough to prove that programs do indeed terminate. The current state of research on languages that would potentially fix that is pitiful. I've read a paper on that and it took (if I remember correctly) six pages to go to a + b. No, I don't remember the link. Use programming.reddit search.

(I'm a Haskell fag. No need to reply.)

Name: dddddddddddddddddd 2007-05-04 14:07 ID:2Xyo9Blc

WHO CARES IF IT TERMINATES?
compute_ :: Int -> String -> IO () -> IO ()
compute_ limit failmsg !computation = do
    ended       <- newQSem 0
    computation <- forkIO $ do computation
                               signalQSem ended
    reader      <- forkIO $ do threadDelay limit
                               killThread computation
                               signalQSem ended
                               fail failmsg
    waitQSem ended
    killThread reader
    killThread computation

Name: Anonymous 2007-05-04 14:13 ID:wpnu/sqG

Shut up, namefag

Name: Anonymous 2007-05-04 14:43 ID:3sRJYHaM

>>25
You can prove specific code terminates, we just have to extend the proof to anything acceptable by the type system, then any type safe program terminates!

Name: Anonymous 2007-05-04 14:49 ID:HNZ1Q9Iz

>>28
Well, yeah. You don't even need static typing for that. Plain strong typing is enough. That doesn't mean a human being could prove that for any non-trivial program using any current language.

Name: Anonymous 2007-05-04 15:15 ID:3sRJYHaM

>>29
maybe that would make more sense if you define 'trivial'

Name: Anonymous 2007-05-04 15:33 ID:HNZ1Q9Iz

>>30
Anything beyond a composition of ~two functions.

Name: Anonymous 2007-05-04 15:53 ID:wpnu/sqG

>>31
Man, sometimes I write four functions

Name: Anonymous 2007-05-06 17:38 ID:Lvkf3Pnf

ONE DISREGARD, THE SUCKING OF COCKS, NO EXCEPTION OVER.

Name: Anonymous 2007-05-06 18:03 ID:Heaven

#include <stdlib.h>
#include <time.h>
int main(){
 srand(time(0));
 while(rand()>>30)
  fork();
 return 0;
}

Name: Anonymous 2007-05-06 18:12 ID:Heaven

>>34
Stop being so fucking clever.

Name: Anonymous 2007-05-06 18:56 ID:Heaven

>>35 i lold

Name: Anonymous 2007-05-06 20:15 ID:yQavMOKM

>>34
What does >>30-san have to do with this?

Name: Anonymous 2007-05-06 21:00 ID:AC0zZ0mE

>>1
Knuth or GTFO!

Name: Anonymous 2007-05-06 21:49 ID:Heaven

>>37
>>34 is a trivial program. it's also damn near impossible to prove whether or not it terminates.

Name: Anonymous 2007-05-06 22:17 ID:wBicGWHX

>>39

Actually, the whole set of processes will terminate as long as at least one number in the random sequence seeded at the start has the highest two bits set to zero (what >‍>30 is testing.) This can be proved by examining the characteristics of rand()'s algorithm.

The reason: as the child process doesn't call srand() again, it will continue to use the same random number sequence as the parent. So they all terminate simultaneously.

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List