maciej-bendkowski / boltzmann-brainLinks
Analytic sampler compiler for combinatorial systems
☆31Updated 3 years ago
Alternatives and similar repositories for boltzmann-brain
Users that are interested in boltzmann-brain are comparing it to the libraries listed below
Sorting:
- A simple GUI for Agda☆31Updated 10 years ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆56Updated 3 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- Paper and talk☆55Updated 2 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- NbE course @ Chalmers☆28Updated last year
- An approach to higher algebra in type theory☆22Updated 5 years ago
- "Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct)☆41Updated 10 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Lecture material for DeepSpec Summer School 2017☆90Updated 4 years ago
- A place to collect work on dialectica categories.☆29Updated last month
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- Translation of, and commentary on, Joyal's classic paper "Une théorie combinatoire des séries formelles" (A combinatorial theory of forma…☆30Updated last year
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 6 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- ☆45Updated 6 years ago
- Agda programming with holes☆28Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- The multimode presheaf proof-assistant☆37Updated 2 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆36Updated 7 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- Categorical logic from a categorical point of view☆81Updated 2 years ago
- ☆23Updated 2 years ago