Alternatives and similar repositories for Geisha

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

• haskell / hoopl
  Higher-order optimization library
  ☆74Updated 2 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆54Updated 5 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 3 years ago
• owo-lang / MLPolyR
  The MLPolyR programming language, revived
  ☆25Updated 4 years ago
• andreasabel / java-adt
  A tool to create immutable algebraic data structures and visitors for Java (such as abstract syntax trees).
  ☆16Updated 4 months ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆45Updated 2 years ago
• umazalakain / CoContextualPi
  ☆11Updated 3 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• xnning / TypeInfer
  Type inference for 'type level computation one step at a time'
  ☆13Updated 7 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 11 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• agda / agda-spec
  Specification of Agda.
  ☆25Updated 6 years ago
• wouter-swierstra / xmonad
  xmonad in Coq
  ☆46Updated 13 years ago
• sinelaw / hmf
  A copy of Daan Leijen's reference implementation of HMF (type inference)
  ☆18Updated 9 years ago
• bgamari / the-thoralf-plugin
  This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.
  ☆21Updated 3 years ago
• gallais / aGdaREP
  Implementing grep in Agda
  ☆33Updated 4 years ago
• csgordon / cayenne
  Resurrecting Lennart Augustsson's implementation of Cayenne
  ☆38Updated 11 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 years ago
• thautwarm / RSolve
  Ask for solutions.
  ☆19Updated 5 years ago
• kino3 / Mini-TT
  mirror of A simple type-theoretic language: Mini-TT
  ☆39Updated 8 years ago
• lambda-pi-plus / lambda-pi-plus
  A simple Depdently-Typed Language for Research and Learning
  ☆57Updated 8 years ago
• m-yac / agda-knots
  An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory
  ☆13Updated 6 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated last month
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• nojb / mlpolyr
  MLpolyR
  ☆7Updated 9 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆30Updated 2 months ago