Alternatives and similar repositories for idris-tparsec:

Users that are interested in idris-tparsec are comparing it to the libraries listed below

• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆121Updated 2 months ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 7 months ago
• jfdm / idris-containers
  Various data structures for use in the Idris Language.
  ☆95Updated 4 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• grin-compiler / idris-grin
  GRIN backend for Idris
  ☆51Updated 4 years ago
• ekmett / kan-extensions
  Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
  ☆79Updated last week
• ekmett / hask
  Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)
  ☆162Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• target / row-types
  A Haskell library for open records and variants using closed type families and type literals
  ☆112Updated 2 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated last year
• well-typed / generics-sop
  Generic Programming using True Sums of Products
  ☆161Updated 2 months ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆75Updated 6 years ago
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆57Updated 6 years ago
• tweag / capability
  Extensional capabilities and deriving combinators
  ☆214Updated 8 months ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆108Updated 2 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆79Updated last month
• dorchard / effect-monad
  Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.
  ☆99Updated last year
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆96Updated 5 months ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆89Updated 6 years ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆82Updated 3 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 11 years ago
• discus-lang / ddc
  The Disco Discus Compiler
  ☆174Updated 6 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆52Updated 7 years ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆90Updated 3 weeks ago
• tweag / linear-types
  Drafts, notes and resources for adding linear typing to GHC.
  ☆76Updated 4 years ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 3 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago