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 4 months ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆45Updated 3 weeks ago
- OCaml backend for Agda☆40Updated 6 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 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
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated this week
- Mtac in Agda☆28Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Library of Unix effects for Coq.☆24Updated 5 years ago
- secret project☆17Updated 7 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 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 bare-bones LCF-style proof assistant☆24Updated 6 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
- MixML prototype interpreter☆27Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Mechanizing Types and Programming Languages using Beluga☆19Updated 5 years ago
- ☆22Updated 9 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated 11 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago