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☆45Updated 5 months 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.☆32Updated 6 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Reflection library for Coq☆12Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 2 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Coq with native compilation, as well as machine integers and arrays !☆62Updated 7 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Implementation of sprintf for Coq☆18Updated 5 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
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- MixML prototype interpreter☆27Updated 5 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated this week
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago