duplicates = multiple editions
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
| ## Principal type-schemes for functional programs | |
| **Luis Damas and Robin Milner, POPL '82** | |
| > module W where | |
| > import Data.List | |
| > import Data.Maybe | |
| > import Data.Function |
| (define (unify a b) | |
| (cond ((and (pair? a) | |
| (pair? b)) (cons (unify (car a) (car b)) | |
| (unify (cdr a) (cdr b)))) | |
| ((symbol? a) b) ; here i just return b, because a symbol matches anything. a more complex system would have a third argument | |
| ; , the environment, that tracks existing bindings for a, and prevents conflicts. then, instead of returning b | |
| ; we could update the environment with the binding for a = b, or issue a failure (in kanren language, #u) | |
| ((eq? a b) b) ; a and b trivially unify without updating any bindings. here I just return their mutual value |
| import sys; from PIL import Image; import numpy as np | |
| chars = np.asarray(list(' .,:;irsXA253hMHGS#9B&@')) | |
| if len(sys.argv) != 4: print( 'Usage: ./asciinator.py image scale factor' ); sys.exit() | |
| f, SC, GCF, WCF = sys.argv[1], float(sys.argv[2]), float(sys.argv[3]), 7/4 | |
| img = Image.open(f) | |
| S = ( round(img.size[0]*SC*WCF), round(img.size[1]*SC) ) | |
| img = np.sum( np.asarray( img.resize(S) ), axis=2) |
| """Pexpect is a Python module for spawning child applications and controlling | |
| them automatically. Pexpect can be used for automating interactive applications | |
| such as ssh, ftp, passwd, telnet, etc. It can be used to a automate setup | |
| scripts for duplicating software package installations on different servers. It | |
| can be used for automated software testing. Pexpect is in the spirit of Don | |
| Libes' Expect, but Pexpect is pure Python. Other Expect-like modules for Python | |
| require TCL and Expect or require C extensions to be compiled. Pexpect does not | |
| use C, Expect, or TCL extensions. It should work on any platform that supports | |
| the standard Python pty module. The Pexpect interface focuses on ease of use so | |
| that simple tasks are easy. |
Having read a few proofs that the halting problem is undecidable, I found that they were quite inaccessible, or that they glossed over important details. To counter this, I've attempted to re-hash the proof using a familiar language, JavaScript, with numerous examples along the way.
This famous proof tells us that there is no general method to determine whether a program will finish running. To illustrate this, we can consider programs as JavaScript function calls, and ask whether it is possible to write a JavaScript function which will tell us
| 13:15 <xQuasar> | HASKELL IS FOR FUCKIN FAGGOTS. YOU'RE ALL A BUNCH OF | |
| | FUCKIN PUSSIES | |
| 13:15 <xQuasar> | JAVASCRIPT FOR LIFE FAGS | |
| 13:16 <luite> | hello | |
| 13:16 <ChongLi> | somebody has a mental illness! | |
| 13:16 <merijn> | Wow...I suddenly see the error of my ways and feel | |
| | compelled to write Node.js! | |
| 13:16 <genisage> | hi | |
| 13:16 <luite> | you might be pleased to learn that you can compile | |
| | haskell to javascript now |
| type nat = Zero | Succ of nat | |
| let rec int_of_nat x = | |
| match x with | |
| | Zero -> 0 | |
| | Succ x' -> 1 + int_of_nat x' | |
| let rec nat_of_int x = | |
| match x with | |
| | 0 -> Zero |
| #!/usr/bin/env python | |
| # coding: utf-8 | |
| # http://musta.sh/2012-03-04/twisted-tcp-proxy.html | |
| import sys | |
| from twisted.internet import defer | |
| from twisted.internet import protocol | |
| from twisted.internet import reactor | |
| from twisted.python import log |