Alternatives and similar repositories for loxomotive

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

• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated this week
• llvm-hs / llvm-hs-kaleidoscope
  Kaleidoscope Tutorial using llvm-hs
  ☆85Updated 4 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆64Updated 8 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated 2 months ago
• bynect / algorithm-w
  Type inference implementation in OCaml using Algorithm W
  ☆10Updated 4 years ago
• Superstar64 / aith
  [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…
  ☆69Updated last year
• cronokirby / haskell-in-haskell
  Trying to write an understandable implementation of Haskell, in Haskell
  ☆125Updated 4 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆74Updated 3 years ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆60Updated 4 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated 2 weeks ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• Innf107 / vega-prototype
  Prototype for https://github.com/Innf107/vega
  ☆19Updated last year
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 4 months ago
• unnohideyuki / Tiger-in-Haskell
  "Modern compiler implementation" in Haskell!
  ☆28Updated 10 years ago
• re-xyr / speff
  Fast higher-order effect handlers with evidence passing
  ☆21Updated last year
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆97Updated 7 months ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆61Updated 3 months ago
• ebresafegaga / tina
  Tina, a programming language with typed algebraic effects and handlers.
  ☆13Updated 4 years ago
• llvm-hs / llvm-hs-examples
  Examples for Haskell bindings to LLVM
  ☆73Updated 4 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆55Updated 4 years ago