Alternatives and similar repositories for lollipop:

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

• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 9 years ago
• aherrmann / simply_llvm
  ☆41Updated 7 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 13 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• rampion / kinder-functor
  An alternate definition of Haskell's Functor typeclass
  ☆42Updated 5 years ago
• esengie / fpl-exploration-tool
  Diploma work (if this is still here contact me if you need details)
  ☆13Updated 7 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 6 years ago
• taktoa / wasm-agda
  A typechecker for WebAssembly, written in Agda (WIP)
  ☆17Updated 7 years ago
• ekmett / structs
  Exploring how to make a strict imperative universe in the GHC runtime system.
  ☆48Updated 3 months ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆52Updated 2 months ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• cmcl / franklyfrank
  A prototype implementation of the Frank programming language
  ☆17Updated 9 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• sinelaw / hmf
  A copy of Daan Leijen's reference implementation of HMF (type inference)
  ☆16Updated 8 years ago
• emilaxelsson / imperative-edsl
  Deep embedding of imperative programs with code generation
  ☆23Updated 2 years ago
• haskell-perf / graphs
  ☆40Updated 5 years ago
• jwiegley / z3cat
  Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations
  ☆38Updated 7 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• llvm-hs / llvm-hs-typed
  Type Safe LLVM IR ( Experimental )
  ☆49Updated 6 years ago
• hurryabit / pukeko
  A toy compiler based on SPJ's "The Implementation of Functional Programming Languages"
  ☆25Updated 9 months ago