Alternatives and similar repositories for recursion:

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

• tfausak / monadoc-5
  🔖 Better Haskell documentation.
  ☆17Updated 4 years ago
• llvm-hs / llvm-hs-typed
  Type Safe LLVM IR ( Experimental )
  ☆49Updated 6 years ago
• typesanitizer / edit
  Edit is a monad for rewriting things.
  ☆23Updated 4 years ago
• deech / LeftPad
  ☆23Updated 7 years ago
• mstone / soutei
  a logic-based trust-management system
  ☆19Updated 12 years ago
• syallop / Join-Language
  Haskell Join-calculus DSL
  ☆22Updated 6 years ago
• aherrmann / simply_llvm
  ☆41Updated 7 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 3 months ago
• dalaing / type-systems
  ☆23Updated 7 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• minad / persist
  Minimal binary serialization library with focus on performance
  ☆17Updated 4 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• fosskers / versions
  Haskell types and parsers for software version numbers.
  ☆20Updated last month
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆25Updated 7 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• LightAndLight / closure
  Closure calculus implementation
  ☆12Updated 5 years ago
• bitonic / hakyll-agda
  Hakyll support for Agda literate files
  ☆19Updated 3 years ago
• mcneissue / purescript-snap
  An approach to user interfaces based in denotational design.
  ☆26Updated 2 years ago
• kowainik / idris-patricia
  🌋 Idris implementation of patricia tree
  ☆22Updated 4 years ago
• reinerp / indexed
  Haskell98 indexed functors, monads, comonads
  ☆25Updated 3 years ago
• paf31 / purescript-leibniz
  Leibniz Equality
  ☆19Updated 6 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• omelkonian / rewrite-inspector
  A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…
  ☆21Updated 5 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆15Updated 5 years ago
• ekmett / structs
  Exploring how to make a strict imperative universe in the GHC runtime system.
  ☆48Updated 3 months ago
• i-am-tom / dagless
  A monadic interface for DAG construction.
  ☆24Updated 3 years ago
• kellino / microML
  a simple functional language for learners
  ☆30Updated 8 years ago
• diagrams / monoid-extras
  Miscellaneous constructions on monoids
  ☆18Updated last month
• thoughtpolice / asc
  Austin's supercompiler work
  ☆21Updated 5 years ago
• msprotz / proof-search-monad
  Tentative write-up of a neat trick used in the Mezzo type-checker
  ☆14Updated 9 years ago