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:
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Experimentation project☆16Updated 11 years ago
- ☆17Updated 6 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Dependent hash maps☆14Updated 2 months ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- Experiments with effect systems☆12Updated 9 years ago
- ☆18Updated 3 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Demystifying the magic of supertactics☆13Updated 3 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago