Alternatives and similar repositories for QFeldspar

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

• ilya-klyuchnikov / henk
  Pure Type Systems for Functional Programming
  ☆31Updated 4 years ago
• clf / celf
  ☆62Updated 6 years ago
• bmsherman / topology
  Formal topology (and some probability) in Coq
  ☆31Updated 6 years ago
• agda-attic / agda-frp-ltl
  An implementation of Functional Reactive Programming
  ☆40Updated 10 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 8 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 9 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆67Updated 11 years ago
• amosr / folderol
  machine fusion
  ☆16Updated 7 years ago
• arthuraa / poleiro
  A blog about Coq
  ☆46Updated 3 years ago
• QuickChick / Luck
  Luck -- A Language for Property-Based Generators
  ☆35Updated 8 months ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• osa1 / MANTI
  A pure subset of Prolog, implemented in Haskell
  ☆31Updated 12 years ago
• clf / lollimon
  Lollimon, a monadic concurrent linear logic programming language
  ☆28Updated 14 years ago
• jtobin / measurable
  An embedded DSL for creating, composing, and using probability measures.
  ☆42Updated 6 years ago
• gallais / agdARGS
  Dealing with Flags and Options
  ☆13Updated 4 years ago
• slindley / effect-handlers
  ☆84Updated last year
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 8 years ago
• mietek / research
  Work in progress
  ☆38Updated 4 months 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 5 years ago
• yallop / metaocaml-syb
  Scrap Your Boilerplate for MetaOCaml with modular implicits
  ☆17Updated 9 years ago
• iu-parfunc / lvars
  The LVish Haskell library
  ☆80Updated 3 years ago
• LaifsV1 / YUP
  YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…
  ☆36Updated 2 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 7 years ago
• mietek / formal-logic
  TODO
  ☆23Updated 10 years ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆31Updated 4 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• ilyasergey / monadic-cfa
  Generic implementation of different CFA families based on monadic decomposition
  ☆21Updated 12 years ago