jtobin / deanieLinks
An embedded probabilistic programming language.
☆34Updated 8 years ago
Alternatives and similar repositories for deanie
Users that are interested in deanie are comparing it to the libraries listed below
Sorting:
- A suite of Haskell libraries for representing, manipulating, and sampling random variables☆43Updated last year
- Agda-style equational reasoning in Haskell☆54Updated 4 months ago
- Dependently typed convolutional neural networks☆35Updated 8 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- rewrite rules for type-level equalities☆62Updated last year
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Haskell bindings to ArrayFire☆60Updated 8 months ago
- ☆20Updated 2 years ago
- Generic random generators☆81Updated 2 years ago
- making data science easy and safe with data frames in haskell☆27Updated 8 years ago
- Grammatical parsers - combinator library for parsing general context-free grammars☆37Updated this week
- Ghosts of Departed Proofs☆61Updated 4 years ago
- Many-dimensional type-safe numeric ops☆46Updated 3 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- Classes for types where we know all the values☆39Updated 7 months ago
- A collection of Edward Kmett's packages in a single repository☆16Updated 4 years ago
- Open records for Haskell☆22Updated 7 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- An experiment in functional interface design☆24Updated 8 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- An experimental intermediate language for GHC☆36Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 3 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.☆70Updated 3 weeks ago
- Sort any Traversable container☆41Updated 3 years ago
- Dependently-typed finite maps (partial dependent products)☆66Updated 6 months ago
- Ties the knot on data structures that reference each other by unique keys☆47Updated last year
- Compositional type checking for Haskell☆37Updated 14 years ago
- Codo notation for programming with comonads in Haskell☆26Updated 4 years ago