probprog / anglican-examplesLinks
Examples for Probabilistic System Anglican
☆13Updated 6 years ago
Alternatives and similar repositories for anglican-examples
Users that are interested in anglican-examples are comparing it to the libraries listed below
Sorting:
- Unification of Directed Acyclic Graphs in Clojure☆21Updated 2 weeks ago
- A stack-based planning algorithm in Clojure for applying STRIPS-style operators.☆13Updated last year
- Autograd experiments in Clojure.☆17Updated 8 years ago
- a numerical computing library for Clojure☆23Updated 7 years ago
- Planning Network Visualization☆14Updated 3 years ago
- A 'Purely Functional' Weight Balanced Binary Tree for Clojure☆32Updated 10 years ago
- Multi-pass compiler and runtime for probabilistic programming.☆46Updated 3 weeks ago
- Automatic differentiation for Clojure☆18Updated 8 years ago
- automatic differentiation/integration of PDEs☆24Updated 7 years ago
- Faster computations with Generative Expressions☆39Updated 5 years ago
- ☆30Updated 7 years ago
- ☆20Updated 7 years ago
- Probabilistic Programming System Anglican☆143Updated last year
- Flexible genetic algorithms in Clojure☆23Updated 5 years ago
- Deodorant: Solving the problems of Bayesian Optimization☆16Updated 7 years ago
- Grammar of graphics plotting for Clojure☆33Updated 10 years ago
- Evolving mathematical expressions in Clojure☆19Updated 10 years ago
- Extensible Clojure☆107Updated 9 years ago
- Wave Function Collapse in Clojure☆25Updated 2 years ago
- clojure library for strategic term rewriting inspired by StrategoXT☆24Updated 8 years ago
- ☆11Updated 8 years ago
- Constraint Handling Rules in Clojure☆28Updated 14 years ago
- a small theorem prover in clojure☆18Updated 2 years ago
- Experiments with fast term-rewriting in clojure☆64Updated 10 years ago
- Library to ease use of the MASON ABM library with Clojure☆13Updated 2 years ago
- Graph inference library☆10Updated 2 years ago
- An embedded language for probabilistic programming and meta-programming.☆170Updated 3 years ago
- An L-system or Lindenmayer system is a parallel rewriting system, namely a variant of a formal grammar, most famously used to model the g…☆40Updated 7 years ago
- Deep Belief Network with Restricted Boltzmann Machines in Clojure☆33Updated 10 years ago
- kd-trees in Clojure☆57Updated 9 years ago