• Stars
    star
    3
  • Rank 3,963,521 (Top 79 %)
  • Language
    Clojure
  • License
    MIT License
  • Created over 11 years ago
  • Updated about 11 years ago

Reviews

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

Repository Details

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.

More Repositories

1

ComonadSheet

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

myxine

Get a GUI fast in any language under the sea!
Haskell
47
star
3

GQFC

Source material for "Functional Pearl: Getting a Quick Fix on Comonads"
Haskell
44
star
4

StrictCheck

Keep your laziness in check!
Haskell
32
star
5

hopscotch

A FIFO queue for efficiently hopping and skipping between tagged items
Rust
9
star
6

Presburger

Implementation of Presburger arithmetic solver
Haskell
8
star
7

Pronunciations

Parser for the CMU pronouncing dictionary and simple homophone REPL
Haskell
5
star
8

Euler14-Optimization

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

data-kiln

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

NestedFunctor

Nested composition of functors with a type index tracking nesting.
Haskell
3
star
11

GCBP

Gordon Complementary Bijection Principle
TeX
3
star
12

no-exit

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

Tape

Bidirectionally infinite streams, akin to the tape of a Turing machine.
Haskell
2
star
14

text-diagram

Haskell
2
star
15

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.
Haskell
2
star
16

Systematic

Teaching network programming & distributed systems, with lots of types
Haskell
2
star
17

ProseDiff

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

Infinitable

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

PeanoWitnesses

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

cogoldrust-rustbridge-2019

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

TABA-AWHA

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

binomial-heaps

Binomial heaps with GADT-enforced shape constraints.
Haskell
1
star
23

IndexedList

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

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.
Haskell
1
star