hablapps / LensAlgebraLinks
Towards Optic-Based Algebraic Theories: the Case of Lenses
☆17Updated 7 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☆36Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- ☆16Updated 9 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- ☆16Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Category theory and algebra☆26Updated 9 years ago
- System F in coq.☆19Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 weeks ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago
- ☆23Updated 8 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- 🌋 Idris implementation of patricia tree☆23Updated 5 years ago
- Coq library for handling names☆19Updated 3 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago