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:
- A dependently typed type checker for a TT with intervals☆24Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- ☆16Updated 11 months ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- being an experiment with potato power☆23Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- ☆17Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- ☆16Updated 4 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Mtac in Agda☆29Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- System F in coq.☆19Updated 11 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago