plaidfinch/TABA-AWHA

Stars
1
Language
Haskell
License
MIT License
Created almost 9 years ago
Updated almost 7 years ago

plaidfinch/TABA-AWHA

plaidfinch

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Slides and such from my talk at Compose '16: "There and Back Again" and What Happened After

ComonadSheet

A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comonads.

myxine

Get a GUI fast in any language under the sea!

GQFC

Source material for "Functional Pearl: Getting a Quick Fix on Comonads"

StrictCheck

Keep your laziness in check!

hopscotch

A FIFO queue for efficiently hopping and skipping between tagged items

Presburger

Implementation of Presburger arithmetic solver

Pronunciations

Parser for the CMU pronouncing dictionary and simple homophone REPL

Euler14-Optimization

Progressively optimized versions (in Haskell) of a solution to Problem 14 from Project Euler.

data-kiln

Sculpt mutable recursive data with reference equality; bake it using a data kiln into an immutable lazy structure

NestedFunctor

Nested composition of functors with a type index tracking nesting.

linkaj

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.

GCBP

Gordon Complementary Bijection Principle

no-exit

Source for guest lecture on existential types and purely functional data structures at Hendrix College, April 7, 2016

Tape

Bidirectionally infinite streams, akin to the tape of a Turing machine.

text-diagram

Catalan-Isomorphisms

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.

Systematic

Teaching network programming & distributed systems, with lots of types

ProseDiff

Work in progress on a semantically-aware diff tool for natural-language (e.g. English) prose.

Infinitable

Library providing a datatype and instances for possibly-infinite numbers, designed to wrap any unbounded numeric type.

PeanoWitnesses

GADT-style type witnesses for the Peano naturals. Useful in dependent-types-ish kind of situations.

cogoldrust-rustbridge-2019

Lecture notes and exercises for the RustBridge workshop from CO Gold Rust conference 2019

binomial-heaps

Binomial heaps with GADT-enforced shape constraints.

IndexedList

Length-indexed and "conic" lists, along with functions to convert between them.

ifold

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.