Alternatives and similar repositories for Interaction-Type-Theory

Users that are interested in Interaction-Type-Theory are comparing it to the libraries listed below

• HigherOrderCO / Kindex
  Collection of Kind2 programs and proofs
  ☆11Updated 11 months ago
• VictorTaelin / interaction-calculus-of-constructions
  A minimal proof checker.
  ☆74Updated 8 months ago
• inpla / inpla
  Inpla: Interaction nets as a programming language (the current version)
  ☆302Updated 6 months ago
• polarity-lang / polarity
  A Language with Dependent Data and Codata Types
  ☆104Updated last week
• gwaithimirdain / narya
  A proof assistant for higher-dimensional type theory
  ☆190Updated this week
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆72Updated 8 years ago
• HigherOrderCO / kindbook
  ☆47Updated 4 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆58Updated last year
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆68Updated 2 months ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆260Updated 8 months ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 2 months ago
• fgdorais / lean4-parser
  Parser Combinator Library for Lean 4
  ☆49Updated this week
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆172Updated last week
• barry-jay-personal / tree-calculus
  Proofs in Coq for the book Reflective Programs in Tree Calculus
  ☆173Updated 3 years ago
• faiface / par-lang
  Par (⅋) is an experimental concurrent programming language. It's an attempt to bring the expressive power of linear logic into practice.
  ☆237Updated this week
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 4 years ago
• argumentcomputer / yatima
  A zero-knowledge Lean4 compiler and kernel
  ☆132Updated 6 months ago
• VictorTaelin / Formality
  ☆40Updated 4 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated last week
• axiomed / http
  🌐 | HTTP primitives for Lean 4
  ☆38Updated 6 months ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆63Updated 7 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆72Updated 2 weeks ago
• luc-tielen / eclair-lang
  A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR
  ☆222Updated last year
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• plfa / plfl
  Programming Language Foundations in Lean
  ☆36Updated 3 weeks ago
• thehottgame / TheHoTTGame
  Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT
  ☆127Updated last year
• argumentcomputer / Megaparsec.lean
  Lean 4 port of Megaparsec
  ☆27Updated last year
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆98Updated 2 years ago
• rami3l / PLFaLean
  Learn Lean 4 with PLFA proofs.
  ☆72Updated last month
• engboris / stellogen
  An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax
  ☆102Updated this week