Alternatives and similar repositories for hakyll-agda

Users that are interested in hakyll-agda are comparing it to the libraries listed below

• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• dalaing / type-systems
  ☆23Updated 8 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
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 10 months ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆16Updated 6 years ago
• joom / direct-reflection-for-free
  using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell
  ☆15Updated 5 years ago
• dorchard / codo-notation
  Codo notation for programming with comonads in Haskell
  ☆25Updated 4 years ago
• jwiegley / parsec-free
  ☆23Updated 2 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• LightAndLight / parametricity-proofs
  Proofs of the number of inhabitants of polymorphic functions
  ☆23Updated 7 years ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 8 years ago
• ekmett / hyperfunctions
  playing with hyperfunctions
  ☆16Updated 4 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated 11 months ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• shlevy / cat-fiat
  An attempt to formalize unix cat in fiat
  ☆11Updated 8 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆54Updated 7 months ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 8 years ago
• ekmett / concurrent
  Yet another concurrent playground
  ☆33Updated 10 years ago
• ziman / itt
  Tiny dependent calculus with inference of irrelevance and erasure
  ☆15Updated 5 years ago
• Icelandjack / Capabilities
  A Haskell library providing separation of effects on the type level, effectively splitting up the monolithic IO-monad into more limited c…
  ☆27Updated 7 years ago
• ku-fpg / data-reify
  Reification of data structures using observable sharing
  ☆29Updated last year
• Lysxia / generic-recursion-schemes
  Folds for recursive types with GHC Generics
  ☆28Updated 3 months ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• phadej / idioms-plugins
  Hack idiom-brackets using GHC Source Plugin (8.6+)
  ☆25Updated 7 years ago
• jfischoff / are-mutable-references-in-haskell-fast
  Code to go along with the blog post "Are Mutable References in Haskell Fast?"
  ☆10Updated 8 years ago