Alternatives and similar repositories for folderol:

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

• jwiegley / coq-cds4ltl
  A formalization of finite, constructive log analysis using linear temporal logic
  ☆20Updated this week
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆32Updated 3 years ago
• ekmett / codebruijn
  experiments with pext/pdep and codebruijn syntax
  ☆17Updated 5 years ago
• ekmett / hyperfunctions
  playing with hyperfunctions
  ☆16Updated 3 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 8 years ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 7 years ago
• pigworker / WhatRTypes4
  being the materials from my YOW LambdaJam 2016 talk
  ☆10Updated 8 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• LightAndLight / parametricity-proofs
  Proofs of the number of inhabitants of polymorphic functions
  ☆23Updated 6 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• andrewthad / packed
  Unpinned byte arrays in GHC haskell
  ☆22Updated 6 years ago
• osa1 / StrictCore
  An experimental intermediate language for GHC
  ☆36Updated 7 years ago
• laurmcarter / type-combinators
  Type level lists, pairs, sums, their operations, and their properties.
  ☆24Updated 6 years ago
• Lysxia / generic-recursion-schemes
  Folds for recursive types with GHC Generics
  ☆26Updated 5 years ago
• pigworker / Ming
  being the emperor of Mongo, but also a verb
  ☆15Updated 6 years ago
• phadej / bound-extras
  ScopeT and ScopeH
  ☆13Updated 8 months ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• jwiegley / linearscan
  ☆17Updated 2 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 3 months ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• bobatkey / sorting-types
  Typed DSLs for sorting
  ☆19Updated 7 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• MrChico / Reals-in-agda
  Constructive definition of real numbers implemented in agda.
  ☆10Updated 8 years ago
• haskell-works / hw-rankselect
  ☆18Updated last year
• nobrakal / tungsten
  Bring fusion to everyone
  ☆13Updated 5 years ago
• pigworker / Ohrid-Agda
  being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017
  ☆9Updated 7 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• thoughtpolice / asc
  Austin's supercompiler work
  ☆21Updated 5 years ago
• jmchapman / Relative-Monads
  Relative Monad Library for Agda
  ☆24Updated 5 years ago