Alternatives and similar repositories for no-ai

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

• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated 9 months ago
• jsiek / deduce
  A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.
  ☆118Updated last week
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆37Updated 2 months ago
• rzk-lang / hottbook
  HoTT Book formalisations in Rzk.
  ☆19Updated last year
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 7 months ago
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 8 months ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated this week
• Lapin0t / grothendieck-cern
  Alexander Grothendieck's 1972 talk at CERN, on scientific research
  ☆65Updated last year
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆65Updated 3 weeks ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 8 months ago
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆31Updated last year
• marvinborner / BLoC
  File format and optimizer for programs encoded in binary lambda calculus
  ☆17Updated last year
• etiamz / optiscope
  A Lévy-optimal lambda calculus reducer with a backdoor to C
  ☆39Updated last month
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆27Updated last month
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated last week
• lexa-lang / lexa
  ☆41Updated 3 months ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆33Updated this week
• gelisam / typechecker-combinators
  ☆17Updated last year
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• leanprover-community / con-nf
  A formal consistency proof of Quine's set theory New Foundations
  ☆75Updated 5 months ago
• 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…
  ☆38Updated last week
• Inria-Prosecco / StarMalloc
  A verified, modern, hardened memory allocator. [maintainer=@cmovcc]
  ☆39Updated last week
• blntk / sfpl
  A simple functional programming language.
  ☆22Updated 4 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 9 months ago
• cu1ch3n / type-inference-zoo
  🦖 Implementations of various type inference algorithms. The new project is now at https://github.com/cu1ch3n/type-inference-zoo-frontend…
  ☆152Updated 5 months ago
• etiamz / supercompilation-resources
  📚 A collection of resources about supercompilation
  ☆124Updated 4 months ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• jkoppel / ecta
  ☆37Updated last year
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 5 months ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago