Alternatives and similar repositories for tagless

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

• david-christiansen / derive-all-the-instances
  Work on type class deriving with elaboration reflection
  ☆32Updated 6 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆65Updated 6 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago
• goldfirere / effects
  A Haskell translation of Idris's original algebraic effects library
  ☆41Updated 8 years ago
• dorchard / effect-monad
  Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.
  ☆100Updated 2 years ago
• edwinb / IdrisApp
  An extensible IO-like monad-like thing for Idris, with support for including linear subprograms
  ☆22Updated 5 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• cohomolo-gy / homotopy-type-theory-notes
  HoTT Note-taking action
  ☆25Updated 6 years ago
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆46Updated 3 months ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 4 years ago
• sellout / dada
  A total recursion scheme library for Dhall
  ☆66Updated 2 months ago
• grin-compiler / idris-grin
  GRIN backend for Idris
  ☆50Updated 5 years ago
• inanna-malick / mononoke
  Toy version of Git/Mercurial built using recursion schemes. Implements lazy diffing and merging of merkle dir trees. Solves toy versions …
  ☆3Updated 3 years ago
• jameshaydon / smproc
  A well-typed symmetric-monoidal category of concurrent processes
  ☆24Updated 6 years ago
• ChrisPenner / astar-monad
  A smart A* search monad transformer which supports backtracking user-state!
  ☆81Updated 3 years ago
• ekmett / kan-extensions
  Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
  ☆80Updated last month
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated last year
• patrickt / fastsum
  A fast open-union type, suitable for 100+ contained alternatives.
  ☆99Updated last year
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 3 years ago
• gonzaw / extensible-records
  Extensible records for Idris
  ☆25Updated 4 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• sellout / caterwaul
  Wailing into the primordial ooze of category theory
  ☆55Updated 2 months ago
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆81Updated last year
• syallop / Join-Language
  Haskell Join-calculus DSL
  ☆24Updated 6 years ago
• sellout / yaya
  Yet another yet another recursion scheme library in Haskell.
  ☆89Updated last week
• sinelaw / hmf
  A copy of Daan Leijen's reference implementation of HMF (type inference)
  ☆18Updated 9 years ago
• tweag / linear-types
  Drafts, notes and resources for adding linear typing to GHC.
  ☆78Updated 5 years ago
• david-christiansen / idris-type-providers
  Type provider library for Idris
  ☆94Updated 7 years ago
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆58Updated 6 years ago
• composewell / streaming-benchmarks
  Benchmarks to compare Haskell streaming library performance
  ☆106Updated 8 months ago