Skip to content

SteeleDynamics

Ryan Steele λ

@SteeleDynamics

Husband, Dad, Computer Science, PL Theory, Compilers, Nerd. Here's the Y-Combinator: Y = λf.(λx.f (x x)) (λx.f (x x))

Pittsburgh, PA

Public Apps

knapsack9 months ago
"dynamic-0-1-knapsack" algorithm from CLRS 3ed Selected Solutions impl'd in Scheme
Chez Scheme1 year ago
Chez Scheme Template
1 fork
fleascheme (fork)3 years ago
An experimentation in linear logic.
query-evaluator3 years ago
SICP §4.4.3 - Is Logic Programming Mathematical Logic? Exercise 4.67 (deductive loop detection) Exercise 4.68 ('reverse' rules) Exercise 4.69 ('(great . ?rel)' rules) SICP §4.4.4 - Implementing the Query System Exercise 4.74 ('simple-stream-flatmap', 'simple-flatten') Exercise 4.75 ('unique' special form)
analyzing-evaluator3 years ago
SICP Exercise 4.24
lazy-evaluator3 years ago
SICP Exercise 4.34
1 fork
nondeterministic-evaluator3 years ago
SICP Exercise 4.44
2 forks
cps3 years ago
Continuation-Passing Style in Scheme
trev3 years ago
tail-recursive reverse procedure (iterative process), no build-up of stack
y-combinator3 years ago
Y-Combinator in Scheme