☆18Feb 20, 2024Updated 2 years ago
Alternatives and similar repositories for pipcore
Users that are interested in pipcore are comparing it to the libraries listed below
Sorting:
- Monadic effects and equational reasoning in Rocq☆74Dec 19, 2025Updated 2 months ago
- A compiler for Coq☆26Feb 22, 2013Updated 13 years ago
- VERified asSembler for cryptographic primitives☆12Jul 15, 2023Updated 2 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Derive editors for data types.☆28Oct 5, 2014Updated 11 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Jan 12, 2021Updated 5 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Dec 22, 2018Updated 7 years ago
- Library to drive Lego mindstorm NXT bricks from OCaml. Communication with the NXT brick is done through bluetooth.☆17Jul 25, 2023Updated 2 years ago
- Add UTF decoding support to the OCaml Stdlib☆16Sep 4, 2022Updated 3 years ago
- Combinatorial species in HoTT☆12May 23, 2015Updated 10 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- A tail-recursive list map with good performance for all list sizes. Not actually written in assembly.☆13Sep 23, 2021Updated 4 years ago
- A Haskell library for parsing, pretty-printing, and evaluating the Ninja build language.☆35Feb 6, 2018Updated 8 years ago
- Type-level assertion operators☆16Mar 20, 2018Updated 7 years ago
- A generic goal preprocessing tool for proof automation tactics in Coq☆16Feb 10, 2026Updated 3 weeks ago
- Selective applicative functors laws and theorems☆15Mar 12, 2020Updated 5 years ago
- ☆23Aug 20, 2011Updated 14 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- coinduction library for Coq☆24Nov 14, 2025Updated 3 months ago
- OCaml bindings for libusb-1.0☆16Oct 25, 2021Updated 4 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Apr 4, 2022Updated 3 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- A FUSE filesystem, written in Haskell, that allows one to mount NAR (Nix archive) files and expose them as a virtual Nix store.☆29Apr 17, 2016Updated 9 years ago
- A prototype implementation of the Frank programming language☆17Feb 11, 2016Updated 10 years ago
- SubML (prototype) language☆22Mar 20, 2022Updated 3 years ago
- A library for working with the PureScript functional core.☆24Jun 9, 2020Updated 5 years ago
- A categorical framework for circuit construction☆31Sep 27, 2016Updated 9 years ago
- A Dependently Typed Programming Language☆26Jul 24, 2020Updated 5 years ago
- A formalization of properties of a simple imperative, memory-safe language.☆20Sep 27, 2021Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- A Web Browser with a Formally Verified Kernel☆24Sep 8, 2013Updated 12 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Quick example of Eta on Android☆24May 24, 2017Updated 8 years ago
- A small library for coercion to primitive Erlang types.☆23Aug 8, 2017Updated 8 years ago