Alternatives and similar repositories for folderol:

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

• ekmett / codebruijn
  experiments with pext/pdep and codebruijn syntax
  ☆17Updated 5 years ago
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆32Updated 2 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 3 months ago
• jwiegley / coq-cds4ltl
  A formalization of finite, constructive log analysis using linear temporal logic
  ☆20Updated 2 weeks ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• Lysxia / generic-recursion-schemes
  Folds for recursive types with GHC Generics
  ☆26Updated 5 years ago
• laurmcarter / type-combinators
  Type level lists, pairs, sums, their operations, and their properties.
  ☆24Updated 6 years ago
• ecaustin / haskhol-core
  The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.
  ☆2Updated 8 years ago
• simonmar / haxlbuild
  An experimental build system based on the Haxl library
  ☆8Updated 6 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• LightAndLight / parametricity-proofs
  Proofs of the number of inhabitants of polymorphic functions
  ☆23Updated 6 years ago
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 7 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 3 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 4 months ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated last month
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆52Updated 3 months ago
• thoughtpolice / asc
  Austin's supercompiler work
  ☆21Updated 5 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 6 years ago
• jtobin / deanie
  An embedded probabilistic programming language.
  ☆34Updated 8 years ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 4 years ago
• osa1 / StrictCore
  An experimental intermediate language for GHC
  ☆36Updated 7 years ago
• nobrakal / tungsten
  Bring fusion to everyone
  ☆13Updated 5 years ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• jmchapman / Relative-Monads
  Relative Monad Library for Agda
  ☆24Updated 5 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• jwiegley / categorical
  Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work
  ☆19Updated 7 years ago
• dmwit / pi-eta-epsilon
  An interpreter for the language described in "The Two Dualities of Computation: Negative and Fractional Types"
  ☆23Updated 12 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago