There are no reviews yet. Be the first to send feedback to the community and the maintainers!
SwiftSequence
A μframework of extensions for SequenceType in Swift 2.0, inspired by Python's itertools, Haskell's standard library, and other things.SwiftDataStructures
Data structures in Swift, including a Trie, Tree, List, and Dequeagda-ring-solver
A fast, easy-to-use ring solver for agda with step-by-step solutionsmonus-weighted-search
Efficient search weighted by an ordered monoid with monus.site
Source code for doisinkidney.comsemiring-num
library with a semiring class and some useful semiringsUsing-Protocols-to-Build-a-very-Generic-Deque
type-indexed-queues
Queues with verified and unverified versionsgroupBy
An example replacement for Data.List.groupByarity-generic-liftA
Provides an arity-generic version of the liftA2, liftA3... liftAn functionsagda-playground
finiteness-in-cubical-type-theory
masters-thesis
Monty-Hall
agda-avl
constrained-monads
A library for monads with constraints over the types they containbinary-tree
PretendDependSwift
A library for pretending that Swift is dependently typedagda-ring-solver-report
SwiftTrie
weighted
WeightedT monad transformer.strict-writer
Deprecated in favour of http://hackage.haskell.org/package/writer-cps-mtl-0.1.0.0verified-avl
hstrie
quickselect
implementation of introselect in haskellhakyll-series
Add Series Functionality to HakyllConstArray
difference-monoid
puzzles
bfs
agda-binary
Deques-Queues-and-Lists-in-Swift-with-indirect
levels-monad
agda-poly
generic-church
ContiguousDeque
mddoctest
Test code examples in markdown filesrecursion-schemes-extras
prob-presentation
SubSum
monadic-heap
pure-arrays
agda-indexed-fingertree
team-software-project
project-euler
Love Open Source and this site? Check out how you can help us