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
- being an experiment with potato power☆23Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- ☆16Updated 6 months ago
- ☆16Updated 3 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Deferring the Details and Deriving Programs☆14Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- ☆17Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- System F implemented in Haskell☆24Updated 13 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago