boltzmann-brain
boltzmann-brain copied to clipboard
maciej-bendkowski
Analytic sampler compiler for combinatorial systems
Compilation breaks if the entry point of my grammar is named `S`, it seems to clash with some other type with the same identifier in the generated code. Minimal working...
`bb-build` fails to compile the following grammar: ``` @module Sampler @size 1000 @generate Tree Tree = Node [Tree]. ``` `bb-compile` runs smoothly but when trying to compile the generated module...
It seems that the current version of `boltzmann-brain` requires the development version of `paganini`. Running `bb-compile` with the most recently released version of paganini (`1.3.3`) fails with : ``` [ERR]...
I don't understand the syntax of rational grammars from the examples. How should I write the specification for `aaabb` or `aa*bb*` for instance ? I tried writing them in the...
Boltzmann brain rejects the binary tree example from the example folder with the following error message: ``` [ERR] (18-09-2020 13:40:32) Given system is not well-founded at zero. ``` The grammar...
The current paganini input specification is rather unpleasant and difficult to debug, especially for larger systems. Keeping track of appropriate indexes is not a task which should be delegated to...
Consider the following specification: > Nat = S Nat [0.3] | Z. > Term = App Nat [Term] | Var Nat. and the corresponding paganini specification generated by boltzmann-brain: >...
Using the `-f` flag it is possible to disable well-foundedness checks. Consequently, the constructed paganini specification might not be sensible. In one such case (see the `examples/ill-founded.in` example) the optimisation...
_Boltzmann brain_ should support the automatic generation of samplers for Pólya structures involving admissible constructors such as the `MSet` or `Cycle` constructions.
Metadata
Owner
Metadata
Analytic sampler compiler for combinatorial systems