Alternatives and similar repositories for no-ai

Users that are interested in no-ai are comparing it to the libraries listed below

• etiamz / supercompilation-resources
  📚 A collection of resources about supercompilation
  ☆115Updated 3 weeks ago
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆36Updated last week
• medovina / natty
  Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…
  ☆36Updated 3 weeks ago
• jsiek / deduce
  A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.
  ☆114Updated this week
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆54Updated 6 months ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆70Updated 5 months ago
• leanprover-community / con-nf
  A formal consistency proof of Quine's set theory New Foundations
  ☆73Updated last month
• ralsei / types.pl
  The glitch-soc/Mastodon fork running on types.pl
  ☆25Updated last month
• eashanhatti / konna
  ☆16Updated 3 years ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 5 months ago
• rzk-lang / hottbook
  HoTT Book formalisations in Rzk.
  ☆20Updated last year
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• cu1ch3n / type-inference-zoo
  🦖 Implementations of various type inference algorithms. Online interactive playground is available at https://zoo.cuichen.cc/
  ☆147Updated last month
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 4 months ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated this week
• fir-lang / fir
  Fir programming language
  ☆63Updated this week
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆19Updated 3 months ago
• marvinborner / BLoC
  File format and optimizer for programs encoded in binary lambda calculus
  ☆15Updated last year
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆17Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆33Updated last week
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆30Updated 11 months ago
• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆29Updated 3 months ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆36Updated 4 months ago
• brendanzab / lean-holes
  Interactive holes for Lean 4
  ☆22Updated last year
• shwestrick / smlfmt
  A custom parser/auto-formatter for Standard ML
  ☆79Updated 3 months ago
• engboris / stellogen
  An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax
  ☆111Updated 3 weeks ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 2 years ago