min-nguyen / prob-fx
A language for modular probabilistic modelling in Haskell based on effect handlers
☆16Updated 10 months ago
Related projects ⓘ
Alternatives and complementary repositories for prob-fx
- Formalizing linear algebra in Agda by representing matrices as functions☆25Updated 10 months ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Staged push/pull fusion with typed Template Haskell☆57Updated 11 months ago
- ☆28Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Library of categories, with categorical constructions on them☆54Updated last year
- Sort any Traversable container☆41Updated 2 years ago
- being the materials for Summer 2013's course☆110Updated last year
- Reimplementation of Parsley in Haskell, with improvements☆49Updated 8 months ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- Bidirectional programming in Haskell with monadic profunctors☆44Updated 2 years ago
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆83Updated last year
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆38Updated 2 years ago
- Toy language to show the conversion of embedded higher-order abstract syntax (HOAS)☆21Updated 11 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- Interpret Haskell programs into any cartesian closed category.☆57Updated last week
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- Fast equality saturation in Haskell☆77Updated 6 months ago
- Effects libraries in Haskell☆72Updated last year
- Tutorial series introducing Agda to the people at BCAM☆26Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last year
- A Haskell probabilistic programming library.☆17Updated 2 weeks ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- 🚧 a work in progress effect system for Haskell 🚧☆124Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆95Updated 2 years ago
- Normalise GHC.TypeLits.Nat equations☆43Updated 5 months ago
- Haskell embedding of PlusCal☆61Updated 2 years ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆42Updated last week