Alternatives and similar repositories for coq-haskell:

Users that are interested in coq-haskell are comparing it to the libraries listed below

• antalsz / hs-to-coq
  Convert Haskell source code to Coq source code
  ☆280Updated 4 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 7 months ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆96Updated 5 months ago
• coq-community / corn
  Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]
  ☆113Updated last month
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆126Updated 6 months ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆99Updated 2 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated last year
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆92Updated last month
• snowleopard / hadrian
  Hadrian: a new build system for the Glasgow Haskell Compiler. Now merged into the GHC tree!
  ☆207Updated 6 years ago
• valis / hoq
  A language based on homotopy type theory with an interval
  ☆85Updated 9 years ago
• jonsterling / JonPRL
  An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …
  ☆110Updated 6 years ago
• IagoAbal / haskell-z3
  Haskell bindings to Microsoft's Z3 API (unofficial).
  ☆58Updated last year
• discus-lang / iron
  Coq formalizations of functional languages.
  ☆143Updated 4 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆89Updated 6 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆91Updated 7 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• RedPRL / sml-redprl
  The People's Refinement Logic
  ☆229Updated 2 years ago
• RobertHarper / hott-notes
  15-819 (Homotopy Type Theory) Lecture Notes
  ☆53Updated 4 years ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆117Updated 2 years ago
• UlfNorell / agda-summer-school
  Summer school on programming in Agda
  ☆68Updated last year
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• goldfirere / singletons
  Fake dependent types in Haskell using singletons
  ☆290Updated this week
• martinescardo / HoTT-UF-Agda-Lecture-Notes
  Lecture notes on univalent foundations of mathematics with Agda
  ☆224Updated 10 months ago
• HoTT-Intro / Agda
  Agda formalisation of the Introduction to Homotopy Type Theory
  ☆124Updated 3 years ago
• coq-io / io
  A library for effects in Coq.
  ☆64Updated 2 years ago
• simhu / cubical
  Implementation of Univalence in Cubical Sets
  ☆144Updated 9 years ago
• agda / agda2hs
  Compiling Agda code to readable Haskell
  ☆182Updated this week
• mikeshulman / catlog
  Categorical logic from a categorical point of view
  ☆77Updated last year