How to convert source code into a textbook. Prompts and exemplars
for generating "genetic stanza" REPL
tutorials: source files that read top-to-bottom as a short paper
and load top-to-bottom as code, narrated by numbered REPL traces
([1]> ... [48]>). Includes the authoring prompt, a worked
example (Lisp data mining), and the K&R tone
Tim Menzies timm
lithp is less library: the smallest set of Common Lisp
add-ons that measurably shrinks application code — five plain
constructs plus a handful of utilities, ~130 lines total, no
luk is the .luk language: a tiny indentation-based dialect that transpiles to Lua via luk.lua (~100-line module). luk.lua returns a single function: `local lua_src = r
Standard fairness-benchmark CSVs in fft column-suffix format. Adult, German, Bank, COMPAS. Each has a sensitive attribute (race / sex / age) and a binary klass. Use with fft.
# install and test
git clone http://tiny.cc/fairnez && git clone http://tiny.cc/fft fft
c
Example multi-objective optimization datasets: 100+ CSV files with self-describing headers — column names encode type and goal, so no separate schema files are needed. Topics span software config, hyper-parameter tuning, process models, health, finance, sales, and RL. Data only, no code.
tricks for sampling lasrge space of inductive bias.
Portable, self-erasing boilerplate for all my gists: one Makefile
(help, doctor, lint, push, pdf, tuned shells/editors/mux), one
bashrc, init.lua + init.el, one tmux.conf, plus isolated nvim/micro
configs. A project repo is just knobs plus include $(KONFIG)/Makefile.
Every file these tools generate i
A fast-and-frugal tree (FFT) makes urgent binary choices via a few yes/no questions, deliberately ignoring most of the data: fast since little computation, frugal since it often stops after one or two cues. Here: fft.py is the core (one pass = 16 candidate trees, one per bias string, fr
timm
/ ,Ranger.md
Last active
June 12, 2026 06:12
RANGER: Rapid ANalysis and Generation of Explainable Rules
timm
/ ,Preci0us.md
Last active
June 6, 2026 16:58