letouzey / coq-minicalcLinks
Toy demo of lexing/parsing in Coq
☆12Updated 6 years ago
Alternatives and similar repositories for coq-minicalc
Users that are interested in coq-minicalc are comparing it to the libraries listed below
Sorting:
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Tactic for polynomial manipulations☆12Updated 5 months ago
- A reflection-based proof tactic for lattices in Coq☆22Updated 2 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 months ago
- Lenses in Coq☆17Updated 3 years ago
- ☆18Updated 3 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated last year
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- ☆17Updated 7 years ago
- ☆13Updated 5 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 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
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 6 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆34Updated 3 weeks ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 7 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago