Alternatives and similar repositories for Geisha

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

• owo-lang / MLPolyR
  The MLPolyR programming language, revived
  ☆25Updated 4 years ago
• xnning / TypeInfer
  Type inference for 'type level computation one step at a time'
  ☆12Updated 7 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
• bitonic / tog
  ☆26Updated 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
• haskell / hoopl
  Higher-order optimization library
  ☆74Updated last year
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• thautwarm / RSolve
  Ask for solutions.
  ☆19Updated 5 years ago
• ice1k / ConsHoTT
  Constructive Interpretations of HoTT
  ☆36Updated 4 years ago
• umazalakain / CoContextualPi
  ☆11Updated 3 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆45Updated 2 years ago
• ralsei / six-eyes
  A work-in-progress structure editor for the cooltt proof assistant.
  ☆18Updated 2 years ago
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated last week
• LightAndLight / idris-but-its-c
  Idris, but it's C
  ☆24Updated 7 years ago
• Trebor-Huang / agda-linear
  An implementation of a Zeilberger-style linear type theory.
  ☆11Updated 3 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
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• re-xyr / hina
  Very simple, explicit parameters-only dependent type elaborator.
  ☆10Updated 4 years ago
• SchrodingerZhu / LeanGccBackend
  Lean4 backend using `libgccjit`!
  ☆11Updated last year
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 6 months ago
• nachivpn / k
  Meta-theory and normalization for Fitch-style modal lambda calculi
  ☆18Updated last year
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆53Updated 3 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
• Guest0x0 / trebor
  an implementation of Observational Type Theory (OTT) and more
  ☆26Updated 2 years ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 4 months ago
• be5invis / idris-dict
  A Dict k v in Idris
  ☆15Updated 4 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago