2xs / pipcore
☆18Updated last year
Alternatives and similar repositories for pipcore:
Users that are interested in pipcore are comparing it to the libraries listed below
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last month
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- 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
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 weeks ago
- Mtac in Agda☆28Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- OCaml backend for Agda☆39Updated 6 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Formalising session types in Coq☆17Updated 5 years ago
- Reflection library for Coq☆12Updated 5 years ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 7 years ago
- ☆11Updated 4 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- ☆13Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 4 months ago
- ☆55Updated 3 weeks ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A discouraging story.☆15Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago