nomeata / haskell-for-readers

Related projects ⓘ

Alternatives and complementary repositories for haskell-for-readers

• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 6 years ago
• kowainik / treap
  Efficient implementation of the implicit treap data structure
  ☆63Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• vrom911 / Rum
  Compiler for the Rum language
  ☆26Updated 5 years ago
• llvm-hs / llvm-hs-typed
  Type Safe LLVM IR ( Experimental )
  ☆49Updated 6 years ago
• llelf / icfp2019-papers
  ICFP 2019 preprints/papers
  ☆44Updated 5 years ago
• haskell-perf / graphs
  ☆39Updated 4 years ago
• well-typed / ixset-typed
  More strongly typed variant of the ixset Haskell package
  ☆23Updated 3 months ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆67Updated last month
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 4 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 4 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• hedgehogqa / haskell-hedgehog-classes
  Hedgehog will eat your typeclass bugs
  ☆56Updated 2 months ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆36Updated 13 years ago
• obsidiansystems / dependent-map
  Dependently-typed finite maps (partial dependent products)
  ☆63Updated 5 months ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆28Updated 4 years ago
• SuperpowersCorp / refactorio
  Refactorio is a tool with which you build and maintain software.
  ☆19Updated 5 months ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆57Updated 5 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 9 years ago
• conal / agda-cat-linear
  Linear map categories in Agda
  ☆5Updated last year
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 9 years ago
• idris-hackers / idris-posix
  System POSIX bindings for Idris.
  ☆36Updated 5 years ago
• typesanitizer / edit
  Edit is a monad for rewriting things.
  ☆23Updated 4 years ago
• danr / hipspec
  A hip inductive theorem prover!
  ☆88Updated 3 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆51Updated 6 months ago
• UlfNorell / x86-agda
  Inline, type safe X86-64 assembly programming in Agda
  ☆66Updated 5 years ago
• dalaing / type-systems
  ☆23Updated 7 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated 5 months ago