Alternatives and similar repositories for ill

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

• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆85Updated 4 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆55Updated last week
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆115Updated 5 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 5 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆92Updated 4 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆55Updated 5 months ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆70Updated 2 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• Helium4Haskell / helium
  The Helium compiler, Helium-as-a-library, and the texthint interpreter
  ☆98Updated last year
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated 2 years ago
• mgrabmueller / AlgorithmW
  Example implementation of Algorithm W for Hindley-Milner type inference
  ☆81Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• ollef / rock
  Build system
  ☆131Updated 2 months ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆57Updated last year
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• evertedsphere / shorshe
  freshly-fermented, dependently-typed mustard, with a substructural aftertaste
  ☆30Updated 5 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆69Updated 3 months ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆46Updated 3 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆55Updated 8 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• oinoom / Core
  compile your own functional language
  ☆36Updated 6 years ago
• gallais / aGdaREP
  Implementing grep in Agda
  ☆33Updated 4 years ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆30Updated 6 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated 11 months ago
• j-mie6 / ParsleyHaskell
  Reimplementation of Parsley in Haskell, with improvements
  ☆60Updated last month
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆45Updated 7 months ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆128Updated last year