2xs / pipcoreLinks
☆18Updated last year
Alternatives and similar repositories for pipcore
Users that are interested in pipcore are comparing it to the libraries listed below
Sorting:
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆45Updated 3 weeks ago
- OCaml backend for Agda☆40Updated 6 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- 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
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- SubML (prototype) language☆23Updated 3 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated 10 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆16Updated 2 months ago
- Mtac in Agda☆28Updated 4 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- secret project☆17Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated 2 months ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Mechanizing Types and Programming Languages using Beluga☆18Updated 5 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 9 months ago