philzook58 / lens-algebra
Type level algebraic "proofs" using lens combinators
☆19Updated 5 years ago
Alternatives and similar repositories for lens-algebra:
Users that are interested in lens-algebra are comparing it to the libraries listed below
- Linear map categories in Agda☆5Updated last year
- ☆17Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- ☆18Updated 2 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Experimentation project☆16Updated 11 years ago
- Agda suffices: software written from A to Z in Agda☆15Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Dependent hash maps☆14Updated 2 weeks ago
- ☆23Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆15Updated 6 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Haskell port of the Tensor Algebra COmpiler☆16Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- A package Index for agda libraries☆12Updated 4 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago