Alternatives and similar repositories for lens-algebra

Users that are interested in lens-algebra are comparing it to the libraries listed below

• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• conal / agda-cat-linear
  Linear map categories in Agda
  ☆5Updated 2 years ago
• taktoa / wasm-agda
  A typechecker for WebAssembly, written in Agda (WIP)
  ☆17Updated 7 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆16Updated 6 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 7 months ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated 8 months ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• effectfully / Eff
  Experiments with effect systems
  ☆12Updated 9 years ago
• shlevy / cat-fiat
  An attempt to formalize unix cat in fiat
  ☆12Updated 8 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• mrkgnao / pico
  The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)
  ☆15Updated 7 years ago
• michaelsproul / dblib-linear
  Formalisation of the linear lambda calculus in Coq
  ☆10Updated 6 years ago
• cocreature / zkboo-hs
  Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.
  ☆18Updated 6 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 7 years ago
• joom / direct-reflection-for-free
  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
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆27Updated last year
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 7 years ago
• cartazio / resin
  Resin: high performance variable binder and ast manipulation lib
  ☆13Updated 6 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆35Updated 5 years ago
• bitonic / hakyll-agda
  Hakyll support for Agda literate files
  ☆19Updated 4 years ago
• glaebhoerl / simplecompiler
  used to be something more ambitious, cut scope to just a simple compiler for thesis project
  ☆17Updated 6 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 7 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 7 years ago