letouzey / coq-minicalcLinks
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
Sorting:
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆17Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 8 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
- Tactic for polynomial manipulations☆10Updated 2 weeks ago
- ☆18Updated 3 years ago
- A repository of MetaOCaml packages☆12Updated 2 weeks ago
- Formalising session types in Coq☆17Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- ☆13Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- ☆11Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 weeks ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 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
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago