Alternatives and similar repositories for neskell:

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

• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 4 years ago
• aherrmann / simply_llvm
  ☆41Updated 7 years ago
• vmchale / atspkg
  Build tool for ATS.
  ☆41Updated 2 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 5 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 6 years ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated 3 months ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆32Updated 7 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆71Updated 2 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 7 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated last week
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 6 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• themattchan / core
  SPJ's tutorial on implementing functional languages
  ☆28Updated 5 years ago
• cmcl / franklyfrank
  A prototype implementation of the Frank programming language
  ☆17Updated 8 years ago
• ekmett / transients
  Clojure-style transients for Haskell
  ☆32Updated 2 years ago
• ChrisPenner / mad-props
  Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.
  ☆67Updated 2 years ago
• stepcut / idrOS
  An OS written in Idris (eventually...)
  ☆19Updated 9 years ago
• ekmett / structs
  Exploring how to make a strict imperative universe in the GHC runtime system.
  ☆48Updated last month
• wouter-swierstra / xmonad
  xmonad in Coq
  ☆43Updated 12 years ago
• esmolanka / sexp-grammar
  Invertible parsing for S-expressions
  ☆33Updated 4 months ago
• sheaf / acts
  Haskell library for semigroup actions and torsors
  ☆60Updated 11 months ago
• robrix / sequoia
  classical sequent calculus, embedded in Haskell
  ☆19Updated 2 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 12 years ago
• glguy / config-value
  Simple, layout-based, unambiguous configuration language implemented in Haskell
  ☆18Updated last month
• grin-compiler / idris-grin
  GRIN backend for Idris
  ☆51Updated 4 years ago
• lukemaurer / sequent-core
  Alternative Core language for GHC plugins
  ☆39Updated 8 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago