hablapps / LensAlgebraLinks
Towards Optic-Based Algebraic Theories: the Case of Lenses
☆17Updated 6 years ago
Alternatives and similar repositories for LensAlgebra
Users that are interested in LensAlgebra are comparing it to the libraries listed below
Sorting:
- 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
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆16Updated 3 years ago
- ☆16Updated 5 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 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
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- ☆17Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Mtac in Agda☆28Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Derivation of Optimized Definitions Based on Specs☆15Updated 5 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- ☆18Updated 3 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- being a programming language for sequential circuits☆20Updated 8 months ago