agarret7 / modpplLinks
Experimental modular probabilistic programming language in Rust, with modeling and inference separated by a generative function trait interface.
☆12Updated 9 months ago
Alternatives and similar repositories for modppl
Users that are interested in modppl are comparing it to the libraries listed below
Sorting:
- GATlab: a computer algebra system based on generalized algebraic theories (GATs)☆27Updated last week
- Implementations of algebraic rewriting techniques like DPO, SPO, SqPO.☆30Updated 2 weeks ago
- egraph <-> json☆14Updated 8 months ago
- Pull your compiler up with abstract bootstraps.☆31Updated 2 years ago
- ACSets: Algebraic databases as in-memory data structures☆24Updated last month
- An LLVM interface for Lean 4. (WIP)☆21Updated last year
- NumLin: Linear Types for Linear Algebra☆23Updated 2 years ago
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆64Updated 3 years ago
- (early experiments toward) a version-control system for structured data☆17Updated last year
- A graphical editor for graph-like structures☆97Updated last year
- Numerical Optimisation Library☆16Updated last year
- ☆13Updated 3 years ago
- Examples of Automatic Differentiation (AD) in many different languages and systems☆27Updated 6 years ago
- Owl's Differential Equation Solvers☆35Updated 3 years ago
- A Futhark binding generator for Rust and OCaml☆29Updated last year
- A collection of Kanren implementations in Julia☆24Updated 8 years ago
- A Lean 4 package for heavy numerical computations☆18Updated 3 years ago
- Assorted s-expression utilities for Julia☆16Updated last year
- Template for Lean<->Rust FFI☆12Updated last year
- XLA (Accelerated Linear Algebra) bindings for OCaml☆30Updated this week
- Relational Algebra, now with more algebra!☆54Updated this week
- Prototype code for some Julia-OCaml bindings☆15Updated 4 years ago
- Lens.jl is a simple Julia library to inspect the runtime behaviour of your programs, with minimal interference to the program itself.☆23Updated 2 years ago
- Agda category theory library for denotational design☆51Updated last year
- collective tools for Julia SSA IR.☆29Updated last year
- Supplement of the ICFP'22 paper "‘do’ Unchained: Embracing Local Imperativity in a Purely Functional Language"☆13Updated 3 months ago
- a datastructure for scalable combinatorial syntax☆18Updated 3 months ago
- Simplicial sets and other combinatorial models of geometric spaces☆38Updated this week
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- A (parametrized) Rust SAT solver originally based on MiniSat☆31Updated 4 months ago