plaidfinch/Lazy-Combinatorics
Exploration of how to do fair traversals of simple combinatorial objects (e.g. powerset, cartesian product) in Clojure.
Binomial heaps with GADT-enforced shape constraints.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
Exploration of how to do fair traversals of simple combinatorial objects (e.g. powerset, cartesian product) in Clojure.
Work in progress on a semantically-aware diff tool for natural-language (e.g. English) prose.
A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comonads.
Experiments with type-safe encoding and translation of various mathematical objects which are counted by the Catalan numbers, such as Dyck paths, ordered trees, binary trees, and others.