| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2026-02-21 | refactor bounded sampling | Justin Bedo | |
| 2026-02-20 | improve floating point random generation and include tree for stdgen | Justin Bedo | |
| 2026-01-13 | use skew heaps instead of sorting | Justin Bedo | |
| 2026-01-13 | sample without replacement | Justin Bedo | |
| 2026-01-13 | increase lazyness and add probilistic memoisation | Justin Bedo | |
| 2026-01-08 | drop hashing scheme and use infinite precision ints | Justin Bedo | |
| 2026-01-08 | add HLS and switch to qualified post | Justin Bedo | |
| 2025-03-07 | switch to hashmap based table | Justin Bedo | |
| Allows significant speed increase, memory reduction, and simpler single site mode. | |||
| 2025-02-27 | ssmh: minor optimisations | Justin Bedo | |
| 2025-02-26 | port prototype single site mh from lazyppl | Justin Bedo | |
| 2023-01-27 | rewrite tree mutation function to avoid leaking memory | Justin Bedo | |
| 2023-01-26 | reimplement sampler in streaming framework | Justin Bedo | |
| 2023-01-23 | add symmetry | Justin Bedo | |
| 2023-01-20 | add some strictness | Justin Bedo | |
| 2022-12-31 | init | Justin Bedo | |
 |
index : ppl.git | |
| Lazy probabilistic programming language reimplementation |
| aboutsummaryrefslogtreecommitdiff |