William Taysom wtaysom

Keybase proof

I hereby claim:

I am wtaysom on github.
I am wtaysom (https://keybase.io/wtaysom) on keybase.
I have a public key ASDhhgHIa18lWpOtSZzCPBm4S0H0Hl8_Ajn3mJAhNd6l9wo

To claim this, I am signing this object:

Hello Friends,

This elf begging to climb onto the web for Christmas began as a personal email, a review of Paul Graham's little Lisp Bel. He sprouted arms, legs, and in gingerstyle ran away. Arms for symbols, legs for conses: these primitives are the mark a Lisp — even more so than the parenthesis. What do we get when we remove these foundation stones: naming and pairing?

No pairs. No cons. No structure. Unordered. Chaos. Eve, a beautifully incomplete aspect oriented triple store. No need for legs when you can effortlessly transport to your destination. Lazy. Pure. Here and now, a retrospective.

No symbols. No names. No variables. Combinators. Forth. No need for arms when you can effortlessly push and pop your stack. No words. A world without words. Virtual worlds. Virtual reality. Space. Time. Motion. Action. Kinetic Programming, a proposal.

I apologize in advance. Checking my pocketwatch, I see I haven't t

	module Where
	class <<self
	attr_accessor :editor

	def is_proc(proc)
	source_location(proc)
	end

	def is_method(klass, method_name)
	source_location(klass.method(method_name))

	#!/usr/bin/env ruby -wKU

	## A response to <http://jacobian.org/writing/svn-usability/>.

	USAGE = <<USAGE
	usage: svnignore [--stop] [FILE...]
	Tells SVN to ignore each FILE.
	Recurses into directories as needed.
	--stop stops SVN from ignoring each FILE.
	USAGE

	require 'methodfinder'

	# _why's MethodFinder addition tweaked and revised.
	# <http://redhanded.hobix.com/inspect/stickItInYourIrbrcMethodfinder.html>

	class MethodFinder
	def self.with_redirected_streams
	redirect_streams
	yield
	ensure

	## _why inspired citizen428 delivered MethodFinder.

	require_relative 'methodfinder_what'

	## Pry Config

	Pry.config.pager = false
	Pry.config.editor = "mate -w"
	Pry.config.prompt = [proc{"? "}, proc{"\| "}]

	import Data.Maybe (isJust, isNothing, fromJust, fromMaybe)
	import Data.List (find)
	import Control.Applicative ((<\|>))

	--- Player ---

	data Player = P1 \| P2 deriving (Show, Eq)

	next :: Player -> Player
	next P1 = P2

	;;; Player

	(defn next [p]
	(if (= p :P1) :P2 :P1))

	;;; Game

	(defn winner [game]
	(if (= (:pile game) 0) (next (:player game)) nil))