Alternatives and similar repositories for little-languages:

Users that are interested in little-languages are comparing it to the libraries listed below

• glaebhoerl / simplecompiler
  used to be something more ambitious, cut scope to just a simple compiler for thesis project
  ☆17Updated 6 years ago
• themattchan / haskell-tiger
  Modern compiler implementation in ML, in Haskell
  ☆16Updated 7 years ago
• serokell / time-warp
  Distributed systems execution emulation
  ☆18Updated 6 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• goldfirere / th-desugar
  Desugars Template Haskell abstract syntax to a simpler format without changing semantics
  ☆20Updated 4 months ago
• dreixel / generic-deriving
  ☆44Updated last month
• quchen / show-prettyprint
  Robust prettyprinter for output of auto-generated Show instances
  ☆17Updated 5 years ago
• bitonic / hakyll-agda
  Hakyll support for Agda literate files
  ☆19Updated 3 years ago
• rudymatela / express
  Dynamically-typed Haskell expressions involving applications and variables.
  ☆22Updated 2 months ago
• iokasimov / apart
  Get all your structure and rip it apart.
  ☆31Updated 6 years ago
• ekmett / perhaps
  A monad, perhaps.
  ☆32Updated 5 years ago
• iand675 / hs-brotli
  ☆20Updated 6 years ago
• minad / persist
  Minimal binary serialization library with focus on performance
  ☆17Updated 4 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• well-typed / ixset-typed
  More strongly typed variant of the ixset Haskell package
  ☆24Updated 8 months ago
• lortabac / ariel
  A simple, purely-functional programming language
  ☆25Updated 2 years ago
• byteverse / posix-api
  haskell posix bindings
  ☆18Updated last month
• i-am-tom / dagmore
  Less Type, more Typeable.
  ☆14Updated 6 years ago
• taktoa / wasm-agda
  A typechecker for WebAssembly, written in Agda (WIP)
  ☆17Updated 7 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
• ekmett / codex
  UI experiments for coda
  ☆66Updated 3 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• nikita-volkov / record-preprocessor
  Compiler preprocessor introducing a syntactic extension for anonymous records
  ☆12Updated 8 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• oofp / Beseder
  Beseder: make impossible state transitions impossible
  ☆31Updated 5 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 7 years ago
• mstksg / mutable
  Automatic piecewise-mutable references for your types
  ☆42Updated 4 years ago
• diagrams / monoid-extras
  Miscellaneous constructions on monoids
  ☆18Updated 2 months ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 years ago
• pepeiborra / gc-benchmarks
  Benchmarks using the non-moving incremental GHC garbage collector
  ☆22Updated 5 years ago