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
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- ☆23Updated last year
- Paper and talk☆53Updated last year
- Quasi-quoting library for agda☆17Updated 4 months ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 10 months ago
- being the materials for Summer 2013's course☆112Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- ☆21Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 2 months ago
- ☆18Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year
- IO using sized types and copatterns☆33Updated 4 years ago
- Category theory formalized in cubical agda☆20Updated 5 years ago
- ☆29Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago