Alternatives and similar repositories for QFeldspar

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

• pigworker / shonky
  being some experiments, working towards some equipment I wish I had
  ☆37Updated 9 years ago
• ilya-klyuchnikov / henk
  Pure Type Systems for Functional Programming
  ☆31Updated 4 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• clf / celf
  ☆60Updated 6 years ago
• QuickChick / Luck
  Luck -- A Language for Property-Based Generators
  ☆35Updated 5 months ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• amosr / folderol
  machine fusion
  ☆16Updated 6 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆65Updated 11 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 8 years ago
• gallais / agdARGS
  Dealing with Flags and Options
  ☆13Updated 3 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• arthuraa / poleiro
  A blog about Coq
  ☆46Updated 3 years ago
• mietek / research
  Work in progress
  ☆37Updated 2 months ago
• bmsherman / topology
  Formal topology (and some probability) in Coq
  ☆32Updated 6 years ago
• clf / lollimon
  Lollimon, a monadic concurrent linear logic programming language
  ☆28Updated 13 years ago
• agda-attic / agda-frp-ltl
  An implementation of Functional Reactive Programming
  ☆40Updated 10 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• FranckS / RingIdris
  Ring solver for Idris
  ☆20Updated 6 years ago
• ericfinster / opetopic
  Web based opetopic editor
  ☆35Updated 9 months ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• jonsterling / agda-effectful-forcing
  Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…
  ☆12Updated 4 years ago
• mietek / formal-logic
  TODO
  ☆23Updated 9 years ago
• halfaya / BayHac
  ☆11Updated 7 years ago
• GaloisInc / lean-haskell-bindings
  Haskell Bindings to the Lean Theorem Prover http://leanprover.github.io/
  ☆21Updated 7 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• bitonic / tog
  ☆26Updated 8 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆174Updated 7 years ago
• msullivan / typecoin
  Typecoin: Massively Multiplayer Online Linear Logic
  ☆18Updated 8 years ago
• osa1 / MANTI
  A pure subset of Prolog, implemented in Haskell
  ☆31Updated 12 years ago