Alternatives and similar repositories for TypeInfer:

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

• bitonic / tog
  ☆26Updated 8 years ago
• csabahruska / p4f-control-flow-analysis
  Haskell implementation of P4F Control-Flow Analysis
  ☆21Updated 2 years ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆50Updated 3 years ago
• AliasQli / tactics
  ☆16Updated 3 years ago
• thautwarm / RSolve
  Ask for solutions.
  ☆19Updated 5 years ago
• nachivpn / k
  Meta-theory and normalization for Fitch-style modal lambda calculi
  ☆18Updated 10 months ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago
• sinelaw / hmf
  A copy of Daan Leijen's reference implementation of HMF (type inference)
  ☆16Updated 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
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• ice1k / ConsHoTT
  Constructive Interpretations of HoTT
  ☆36Updated 4 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 6 months ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 4 years ago
• re-xyr / hina
  Very simple, explicit parameters-only dependent type elaborator.
  ☆10Updated 4 years ago
• owo-lang / MLPolyR
  The MLPolyR programming language, revived
  ☆24Updated 4 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 4 months ago
• andreasabel / java-adt
  A tool to create immutable algebraic data structures and visitors for Java (such as abstract syntax trees).
  ☆16Updated 2 months ago
• ziman / ttstar
  Dependently typed core calculus with erasure
  ☆19Updated 3 years ago
• kino3 / Mini-TT
  mirror of A simple type-theoretic language: Mini-TT
  ☆38Updated 8 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
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆24Updated last year
• geisha-lang / Geisha
  A naive θ..θ programming language
  ☆27Updated 6 years ago
• be5invis / idris-dict
  A Dict k v in Idris
  ☆15Updated 4 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
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• L-TChen / ModalTypeTheory
  ☆21Updated 3 years ago
• HarrisonGrodin / agda-modtt
  ModTT in Agda
  ☆11Updated 3 years ago