| /*Robert*/R,y,a,n;main(z,t){for(y=-15;15/*[email protected]*/ | |
| >y++;puts(""))for(a=-60;a++<25;putchar(32+z))for(R=n=z=0; | |
| z++<90&&R*R+n*n<1e4;R=t)t=(R*R-n*n)/50+a*2,n=R*n/25+y*4;} |
| /* ------------------------------------------------------------------- | |
| PROGRAM: SNAKE (ASSEMBLY & ELF HACK) | |
| TARGET: Linux (x86 32-bit) | |
| AUTHOR: Robert Ryan(gh@RYSF13) | |
| [COMPILE COMMAND] | |
| as --32 snake.asm -o s.o && \ | |
| ld -m elf_i386 --oformat binary -Ttext 0x08048000 s.o -o snake && \ | |
| rm -f s.o && chmod +x snake && ./snake | |
| ------------------------------------------------------------------- */ |
| // R01-hash | |
| r01h(d,l)char*d;{int h=0x9E3779B1;for(i=0;i<l;i++)h=(h<<5)|(h>>27),h^= | |
| d[i],h+=(h<<12)^(h>>22),h*=0xCC9E2D51;h^=h>>17;h*=0x1B873593;h^=h>>3;} |
| a=1e3,b,c=1413,d,f[1414],n=800,k;main(){for(;b<c; | |
| f[b++]=14);for(;n--;d+=*f*a,printf("%02d",d/a),*f | |
| =d%a)for(d=0,k=c;--k;d/=b,d*=2*k-1)f[k]=(d+=f[k]* | |
| a)%(b=100*k);}/* √2 2333 digits - Robert Ryan */ |
| main(){while(!fork())printf("Catch me if you can!"),sleep(1);} |
In mathematical logic, the lambda calculus (also written as
lλbmdλ cλlculus?
λ-calculus consists of constructing lambda terms and performing reduction operations on them. A term is defined as any valid lambda calculus expression. In the simplest form of lambda calculus, terms are built using only the rules below.
This is just about the untyped λ-calculus.
