Alternatives and similar repositories for intuitionistic:

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

• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 7 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆67Updated 7 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆61Updated 5 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆45Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆55Updated 9 months ago
• joelonsql / reason-re-nfa
  ReasonML code to construct an NFA from a regular expression
  ☆23Updated 5 years ago
• ankitku / TAL0
  Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
  ☆21Updated 8 years ago
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆29Updated 4 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆63Updated 10 years ago
• pdarragh / parsing-with-zippers-paper-artifact
  The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.
  ☆27Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• MPLLang / mpllib
  Grab-bag library for the MPL compiler (https://github.com/mpllang/mpl)
  ☆16Updated 2 weeks ago
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆86Updated last month
• yallop / ocaml-re-nfa
  OCaml code to construct an NFA from a regular expression
  ☆50Updated 4 years ago
• coq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆30Updated 3 years ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 8 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• ashinkarov / heh
  A programming language with infinite arrays
  ☆31Updated 5 years ago
• thery / hanoi
  Hanoi tower in Coq
  ☆24Updated last month
• webyrd / linear-logic-multiset-rewriting
  Logic for story telling!
  ☆33Updated 6 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆57Updated 3 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆80Updated 4 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆101Updated last year
• JohnReppy / compiling-pattern-guards
  Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
  ☆25Updated 2 years ago