Alternatives and similar repositories for hakyll-agda

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

• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆16Updated 6 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
• dalaing / type-systems
  ☆23Updated 8 years ago
• ekmett / concurrent
  Yet another concurrent playground
  ☆33Updated 9 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 9 months ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated 10 months ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• dorchard / codo-notation
  Codo notation for programming with comonads in Haskell
  ☆25Updated 4 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆54Updated 6 months ago
• jwiegley / parsec-free
  ☆23Updated last year
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 7 years ago
• DanielSchuessler / th-expand-syns
  Expands type synonyms in Template Haskell ASTs
  ☆11Updated 10 months ago
• typeclasses / partial-semigroup
  A partial binary associative operator (appendMaybe :: a → a → Maybe a)
  ☆13Updated last year
• 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
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• sjoerdvisscher / free-functors
  Provides free functors that are adjoint to functors that forget class constraints.
  ☆29Updated last year
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 7 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated 5 months ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 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
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 8 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 3 years ago