Alternatives and similar repositories for comprog-hs:

Users that are interested in comprog-hs are comparing it to the libraries listed below

• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆36Updated 4 years ago
• aimyskk / competitive-haskell
  Snippets for competitive programming in Haskell
  ☆22Updated 7 years ago
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆154Updated 2 weeks ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆38Updated 4 years ago
• luc-tielen / llvm-codegen
  LLVM code generation in Haskell
  ☆53Updated 2 months ago
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆66Updated 3 months ago
• haskellfoundation / error-message-index
  A community-driven collection of documentation for Haskell error messages and warnings
  ☆104Updated 3 weeks ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆42Updated 2 months ago
• ekmett / placeholder
  todo and unimplemented, robustly implemented
  ☆33Updated 4 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆108Updated 2 years ago
• lexi-lambda / eff
  🚧 a work in progress effect system for Haskell 🚧
  ☆124Updated last year
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆57Updated last year
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆79Updated 8 months ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆117Updated 2 years ago
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆28Updated last year
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆56Updated 5 years ago
• agda / agda2hs
  Compiling Agda code to readable Haskell
  ☆182Updated this week
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 9 months ago
• ad-si / Brillo
  Painless 2D vector graphics, animations, and simulations powered by GLFW (Fork of gloss)
  ☆34Updated 3 weeks ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆60Updated 3 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆52Updated 7 years ago
• Bodigrim / linear-builder
  Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.
  ☆88Updated 5 months ago
• sheaf / if-instance
  GHC plugin to branch on whether a constraint is satisfied
  ☆30Updated last month
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆125Updated last year
• agda / cornelis
  agda-mode for neovim
  ☆137Updated this week
• well-typed / unfolder
  Repository with code snippets that accompany episodes of The Haskell Unfolder
  ☆87Updated this week
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆38Updated 3 years ago
• frex-project / idris-frex
  ☆47Updated last month
• tomjaguarpaw / bluefin
  ☆80Updated this week