fzaiser / genferLinks
Tool for Bayesian inference on discrete models expressed as probabilistic programs, via generating functions
☆25Updated last year
Alternatives and similar repositories for genfer
Users that are interested in genfer are comparing it to the libraries listed below
Sorting:
- A Haskell probabilistic programming library.☆21Updated 3 weeks ago
- A formalization of ML kernel languages☆36Updated last week
- I/O utilities and datasets for algebraic-graphs☆14Updated 3 years ago
- Verifying encodings into propositional logic in Lean☆14Updated 2 years ago
- Haskell library for representing and manipulating Symbolic Regression Tree☆16Updated this week
- Intrinsic Verification of Formal Grammar Theory☆27Updated last month
- ☆16Updated last year
- egraph <-> json☆15Updated last week
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- ☆16Updated 2 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- ☆13Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Two-Level Type Theory☆28Updated 6 years ago
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- Reversible programming in Agda☆13Updated 2 years ago
- Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic☆38Updated 3 years ago
- Monadic Constraint Programming framework☆28Updated 7 years ago
- An arbitrary-precision differentiable programming language.☆36Updated 2 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆55Updated last month
- Git repository for the course Logika v računalništvu☆15Updated 3 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated last month
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Updated 5 years ago
- Effective Algebraic Topology in Haskell☆90Updated last year
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆72Updated last year
- Template for Lean<->Rust FFI☆14Updated last year
- Theory and Applications of Lenses and Optics☆56Updated 3 years ago