dmurfet / polysemantics
Polynomial semantics of linear logic
☆13Updated 7 years ago
Alternatives and similar repositories for polysemantics:
Users that are interested in polysemantics are comparing it to the libraries listed below
- Haskell port of the Tensor Algebra COmpiler☆16Updated 5 years ago
- topos programming☆31Updated 6 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆20Updated 2 weeks ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- The Elements of Statistical Learning in Haskell☆13Updated 7 years ago
- ☆13Updated 3 years ago
- Haskell library of algebraic topology☆23Updated 13 years ago
- Clifford algebra for Haskell! :D☆15Updated 10 years ago
- Symbolic logic expressions☆14Updated 4 years ago
- Formal topology (and some probability) in Coq☆32Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Deep-embedded combinators for strategic rewriting.☆15Updated 3 years ago
- ☆10Updated 5 years ago
- Some numerical optimization methods implemented in Haskell☆47Updated 4 years ago
- Type theory in type theory☆16Updated 13 years ago
- Numerical optimization with support for stochastic optimization, mostly for my own experimental usage☆14Updated 4 years ago
- ☆26Updated 10 years ago
- An embedded DSL for creating, composing, and using probability measures.☆40Updated 5 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Formalization of Linear Logic in Coq☆14Updated last week
- Mathematical stories☆13Updated 4 years ago
- Combinatorial species in HoTT☆12Updated 9 years ago
- your dynamic optimization buddy☆27Updated 5 years ago
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Updated 5 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Agda-style equational reasoning in Haskell☆53Updated last week