Alternatives and similar repositories for Formality

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

• HigherOrderCO / Kindex
  Collection of Kind2 programs and proofs
  ☆12Updated last year
• kindelia-archive / Kindelia
  A minimal decentralized computer.
  ☆117Updated 3 years ago
• HigherOrderCO / FormCoreJS
  A minimal pure functional language based on self dependent types.
  ☆73Updated 3 years ago
• VictorTaelin / interaction-calculus-of-constructions
  A minimal proof checker.
  ☆78Updated last year
• VictorTaelin / Interaction-Type-Theory
  ☆120Updated 2 years ago
• inpla / inpla
  Inpla: Interaction nets as a programming language (the current version)
  ☆318Updated 3 weeks ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆41Updated 2 years ago
• mlatu-lang / mlatu
  A declarative concatenative programming language
  ☆170Updated 4 months ago
• argumentcomputer / yatima
  A zero-knowledge Lean4 compiler and kernel
  ☆142Updated last year
• luc-tielen / eclair-lang
  A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR
  ☆227Updated 2 years ago
• hkust-taco / mlscript
  The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…
  ☆213Updated last week
• Soonad / Moonad
  An upcoming operating system built on Type-Theory
  ☆43Updated 5 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆83Updated 8 years ago
• SPY / idris-codegen-wasm
  WebAssembly Code Generation Backend for Idris Compiler
  ☆82Updated 7 years ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆271Updated last year
• Centril / refl
  Provides a Refl encoding in Rust
  ☆68Updated 2 years ago
• Storyyeller / cubiml-demo
  A simple ML-like programming language with subtyping and full type inference.
  ☆187Updated last year
• argumentcomputer / Wasm.lean
  A WebAssembly implementation in Lean4
  ☆40Updated 2 years ago
• barry-jay-personal / tree-calculus
  Proofs in Coq for the book Reflective Programs in Tree Calculus
  ☆180Updated 4 years ago
• polarity-lang / polarity
  A language with dependent data and codata types
  ☆125Updated last week
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆187Updated 8 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆64Updated last year
• FrankBro / ordo
  Ordo: A minimalist language with row polymorphism
  ☆85Updated 9 months ago
• engboris / stellogen
  An experimental language exploring computation and meaning through term unification, with logic-agnostic types.
  ☆124Updated last week
• githwxi / ATS-Xanadu
  Bootstrapping ATS3
  ☆242Updated this week
• Soonad / Whitepaper
  Moonad: a Peer-to-Peer Operating System
  ☆101Updated 6 years ago
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆77Updated 4 years ago
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆79Updated last month
• kindelia-archive / LambdaVM
  A next-gen, massively parallel, beta-optimal functional runtime.
  ☆10Updated 4 years ago
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆173Updated 2 months ago