philzook58 / lens-algebraLinks
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
Sorting:
- ☆17Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 6 months ago
- Linear map categories in Agda☆5Updated 2 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- An attempt to formalize unix cat in fiat☆12Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Experimentation project☆16Updated 11 years ago
- ☆18Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Derive editors for data types.☆28Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆23Updated 7 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago