letsbreelhere/stack-unification
A toy program for learning how to perform type inference in a stack-based language like Cat.
n Booleans = 1 Integer, saves columns and migrations.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
A toy program for learning how to perform type inference in a stack-based language like Cat.
A gem for using a single integer column as a set of booleans, with bitfield-style storage.
A ZMachine emulator in Haskell.
Public repository.