plaidfinch/data-kiln
Sculpt mutable recursive data with reference equality; bake it using a data kiln into an immutable lazy structure
Discovered public repositories for plaidfinch in the GitHub catalog.
Sculpt mutable recursive data with reference equality; bake it using a data kiln into an immutable lazy structure
Binomial heaps with GADT-enforced shape constraints.
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.
Progressively optimized versions (in Haskell) of a solution to Problem 14 from Project Euler.
Indenting fold (ifold) is a replacement for the UNIX fold command, which indents every wrapped line by the same amount that the original line was indented. This is useful, e.g. for converting plain-text documents into other formats.
Library providing a datatype and instances for possibly-infinite numbers, designed to wrap any unbounded numeric type.
Persistent associative datatypes with more features than Clojure's built-in maps, including bijective maps, key-attribute-value maps, bipartite graphs, and directed graphs with arbitrary node and edge attributes.