ekmett / bad
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
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 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
- ☆23Updated last year
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- ☆21Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 6 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- ☆14Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 weeks ago
- Paper and talk☆53Updated last year
- Category theory formalized in cubical agda☆20Updated 5 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- ☆18Updated 2 years ago
- ☆27Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago