bedrocksystems / coq-lens
Lenses in Coq
☆17Updated 2 years ago
Alternatives and similar repositories for coq-lens:
Users that are interested in coq-lens are comparing it to the libraries listed below
- a version of the 2048 game for Coq☆22Updated last year
- Implementation of sprintf for Coq☆18Updated 4 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated last month
- ☆18Updated 2 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 7 months ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- A Coq library providing tactics to deal with hypothesis☆21Updated 3 months ago
- Research material of Erik Palmgren (1963–2019)☆20Updated 2 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- A fornalisation of Grobner basis in ssreflect☆12Updated 3 months ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last week
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A style guide for Coq☆18Updated 3 years ago
- ModTT in Agda☆11Updated 3 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 3 months ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆22Updated last week
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- ☆17Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Mtac in Agda☆28Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- ☆11Updated 4 years ago