Alternatives and similar repositories for gpif-idris

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

• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• jwiegley / categorical
  Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work
  ☆19Updated 7 years ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• frerich / catamorphism
  A package exposing a function for generating catamorphisms.
  ☆28Updated 7 years ago
• glguy / generic-traverse
  Demonstration for how to build "traverse" using GHC.Generics efficiently
  ☆22Updated 6 years ago
• jwiegley / linearscan
  ☆17Updated 2 years ago
• osa1 / StrictCore
  An experimental intermediate language for GHC
  ☆36Updated 7 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• pigworker / Pivotal
  ☆31Updated 10 years ago
• gelisam / conway
  Demonstrating comonad transformers.
  ☆37Updated 8 years ago
• dorchard / codo-notation
  Codo notation for programming with comonads in Haskell
  ☆26Updated 4 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• SamuelSchlesinger / gaia
  An experiment in functional interface design
  ☆24Updated 8 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 5 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• acowley / BostonHaskell2015
  [Talk] Framing the Discussion with EDSLs
  ☆9Updated 10 years ago
• sinelaw / fresh
  ☆14Updated 7 years ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated last month
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 5 months ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• sjoerdvisscher / free-functors
  Provides free functors that are adjoint to functors that forget class constraints.
  ☆29Updated 9 months ago
• emilaxelsson / imperative-edsl
  Deep embedding of imperative programs with code generation
  ☆23Updated 3 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• gergoerdi / universe-of-syntax
  A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…
  ☆16Updated 7 years ago
• pigworker / WhatRTypes4
  being the materials from my YOW LambdaJam 2016 talk
  ☆10Updated 8 years ago
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆34Updated 3 years ago
• Lysxia / generic-recursion-schemes
  Folds for recursive types with GHC Generics
  ☆26Updated 5 years ago
• edwinb / Vars
  A small library for tracking mutable state in Idris programs
  ☆12Updated 8 years ago
• nomeata / ghcjs2gh-pages
  Example repository setup that deploys GHCJS programs to GitHub Pages
  ☆24Updated 6 years ago