Alternatives and similar repositories for pipcore

Users that are interested in pipcore are comparing it to the libraries listed below

• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆45Updated 9 months ago
• uwplse / CoqAST
  Fun plugin to play with the Gallina AST.
  ☆38Updated 6 years ago
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 7 years ago
• agda-attic / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 7 years ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆49Updated 6 months ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 3 years ago
• rossberg / mixml
  MixML prototype interpreter
  ☆27Updated 6 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• jkoppel / thermometer-continuations
  Examples from our paper "Capturing the Future by Replaying the Past"
  ☆23Updated last year
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆55Updated 8 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆39Updated 8 years ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆18Updated 7 years ago
• coq-io / system
  Library of Unix effects for Coq.
  ☆23Updated 6 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 7 years ago
• rocq-prover / ltac2
  A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.
  ☆32Updated 6 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆29Updated 4 years ago
• michaelsproul / dblib-linear
  Formalisation of the linear lambda calculus in Coq
  ☆10Updated 7 years ago
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 5 years ago
• YouyouCong / type-preserving-cps
  Type-preserving CPS translation for simply- and dependently-typed lambda calculi
  ☆19Updated 8 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆25Updated 6 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 7 years ago
• rlepigre / subml
  SubML (prototype) language
  ☆22Updated 3 years ago
• pedagand / MPRI-2.4-DTP
  MPRI-2.4 Dependently-typed Functional Programming
  ☆32Updated 5 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆56Updated 2 weeks ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 2 months ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago