ccshan / prob-schoolLinks
Probabilistic Programming (Scottish Programming Languages and Verification Summer School 2019)
☆10Updated 5 years ago
Alternatives and similar repositories for prob-school
Users that are interested in prob-school are comparing it to the libraries listed below
Sorting:
- An embedded DSL for creating, composing, and using probability measures.☆40Updated 5 years ago
- Cohesive type theory☆19Updated 3 years ago
- Agda-style equational reasoning in Haskell☆53Updated 2 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Proposal for an Agda tutorial☆11Updated 6 years ago
- HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”☆15Updated 2 years ago
- TODO☆23Updated 9 years ago
- Haskell bindings to ArrayFire☆60Updated 5 months ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- Haskell port of the Tensor Algebra COmpiler☆16Updated 5 years ago
- Simple reflection of expressions☆33Updated 3 years ago
- A small profunctor library for idris☆17Updated 2 years ago
- Tutorial series introducing Agda to the people at BCAM☆26Updated 3 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Automated theorem prover for a linear logic-based calculus for molecular biology.☆12Updated last year
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated 6 months ago
- topos programming☆31Updated 6 years ago
- Monadic Constraint Programming framework☆28Updated 7 years ago
- Graded Dependent Type systems☆24Updated last year
- lean-related presentations☆16Updated last year
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- Implementation of Nuprl's type theory in Coq☆45Updated 6 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆27Updated 2 years ago
- Convert data to and from a natural number representation☆14Updated 4 years ago
- Deep-embedded combinators for strategic rewriting.☆15Updated 3 years ago
- ☆30Updated 7 years ago
- Coordinate-free hypersurfaces as Haskell types☆41Updated 2 months ago
- A talk☆28Updated 4 years ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago