maya

@maya.zenmaya.xyz

28 Followers 55 Following

they, them | fan of bytes | hater of dortmund

Free variables. In all innocence, James R. Slagle programmed the following LISP function definition and complained when it didn't work right. testr[x, p, f, u] � if p[x] then f[x] else if atom[x] then u [ ] else testr[cdr[x], p, f, ft.: testr[car[x], p, f, u]].
These included the cond notation for conditional ex pressions , which leads to an unnecessary depth of parentheses , and the use of the number zero to denote the empty list NIL and the truth value false. Besides encouraging porno graphic programming, giving a special interpretation to the address 0 has caused difficul ties in all subsequent implementations .
These simplifications made LISP into a way of describing computable functions much neater than the Turing machines or the general recursive definitions used in recursive function theory . The fact that Turing machines constitute an awkward programming lan guage doesn't much bother recursive function theorists, because they almost never have any reason to write particular recursive definitions, since the theory concerns recursive functions in general