ekmett / badLinks
a playground for working with fully static tensors and automatic differentiation
☆17Updated 4 years ago
Alternatives and similar repositories for bad
Users that are interested in bad are comparing it to the libraries listed below
Sorting:
- Paper and talk☆54Updated 2 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆84Updated 3 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- ☆48Updated last month
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- ☆23Updated last year
- ICFP tutorial☆39Updated 3 years ago
- ☆21Updated 3 years ago
- NbE course @ Chalmers☆28Updated 9 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 10 months ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- higher-kinded data☆30Updated 2 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 weeks ago