letouzey / coq-minicalc
Toy demo of lexing/parsing in Coq
☆12Updated 5 years ago
Alternatives and similar repositories for coq-minicalc:
Users that are interested in coq-minicalc are comparing it to the libraries listed below
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Implementation of sprintf for Coq☆18Updated 4 years ago
- ☆17Updated 6 years ago
- ☆18Updated 2 years ago
- Tactic for polynomial manipulations☆10Updated last year
- Lenses in Coq☆17Updated 2 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- ☆11Updated 4 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
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 5 months ago
- A repository of MetaOCaml packages☆12Updated last year
- IO using sized types and copatterns☆33Updated 3 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 5 months ago
- ☆13Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last week
- Quasi-quoting library for agda☆17Updated 3 months 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
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Template project for Coq plugins using the Dune build system, showcasing some advanced features [maintainer=@ejgallego]☆18Updated last year