Name: Anonymous 2011-01-03 13:52
I CHOOSE YOU MEGATROLL
HAHAHAHA
YOU THINK YOURE THOUGH UH ?
I HAVE ONE WORD FOR YOU
THE FORCED INDENTATION OF THE CODE
GET IT ?
I DONT THINK SO
YOU DONT KNOW ABOUT MY OTHER CAR I GUESS ?
ITS A CDR
AND IS PRONOUNCED ``CUDDER''THIS IS /prog/
YOU ARE ALLOWED TO POST HERE ONLY IF YOU HAVE ACHIEVED SATORI
PROGRAMMING IS ALL ABOUT ``ABSTRACT BULLSHITE'' THAT YOU WILL NEVER COMPREHEND
I HAVE READ SICP
IF ITS NOT DONE YOU HAVE TO
TOO BAD RUBY ON RAILS IS SLOW AS FUCKBBCODEAND ((SCHEME)) ARE THE ULTIMATE LANGUAGES
ALSO
WELCOME TO /prog/
EVERY THREAD WILL BE REPLIED TO
NO EXCEPTION
"suddenly the standard". As if that happened as simple as that.
ifs and fors the language would be much better!
fac n -> n != 1 |> {true? -> n*(fac n-1)
false? -> 1}ifs at all.
#macro while (cond) { block }
@start: // @labels are hygienic.
{ block }
if (cond) goto @start;
#endmacro@start: if (!cond) goto @end; { block } goto @start; @end:
int fact_0(int n) { return 1; }
int fact_n(int n) { return n*fact(n-1); }
int (*fact_t)(int) = { fact_0, fact_n };
int fact(int n) { return fact_t[n<=1](n); }
x.{positive? -> 1
zero? -> 0
negative? -> ~1}
int ack(int,int);
static inline int ack_00(int m, int n) { return n+1; }
static inline int ack_10(int m, int n) { return ack(m-1, 1); }
static inline int ack_11(int m, int n) { return ack(m-1, ack(m, n-1)); }
int (*ack_t[][])(int,int) = { { ack_00, ack_00 }, { ack_10, ack_11 } };
int ack(int m, int n) { return ack_t[m>0][n>0](m,n); }
int f(int x);
static inline int f_00(int x) { return 0; }
static inline int f_10(int x) { return 1; }
static inline int f_11(int x) { return ~1; }
int (*f_t[][])(int,int) = { { f_00, f_00 }, { f_10, f_11 } };
int f(int x) { return f[x!=0][x<0](x); }
map fold)
delays it until you force it yourself!