brunjlar / protopLinks
topos programming
☆31Updated 7 years ago
Alternatives and similar repositories for protop
Users that are interested in protop are comparing it to the libraries listed below
Sorting:
- Agda-style equational reasoning in Haskell☆54Updated 5 months ago
- Simple reflection of expressions☆34Updated 4 years ago
- An embedded probabilistic programming language.☆34Updated 8 years ago
- ☆32Updated 7 years ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated 2 weeks ago
- Provides a type-safe way of working with permutations in Idris☆37Updated 3 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Some tools for provability logic☆37Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 4 months ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- Constructs FAlgebras from typeclasses, making Haskell functions homoiconic☆18Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Haskell bindings to ArrayFire☆60Updated 9 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Sort any Traversable container☆41Updated 3 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 5 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated 6 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Type level lists, pairs, sums, their operations, and their properties.☆24Updated 6 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 4 months ago
- Free Algebras in Haskell☆37Updated last year