Alternatives and similar repositories for Interaction-Type-Theory

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

• VictorTaelin / interaction-calculus-of-constructions
  A minimal proof checker.
  ☆75Updated 10 months ago
• HigherOrderCO / Kindex
  Collection of Kind2 programs and proofs
  ☆12Updated last year
• inpla / inpla
  Inpla: Interaction nets as a programming language (the current version)
  ☆309Updated 9 months ago
• polarity-lang / polarity
  A Language with Dependent Data and Codata Types
  ☆107Updated last week
• marvinborner / interaction-net-resources
  Interaction net resources
  ☆22Updated this week
• luc-tielen / eclair-lang
  A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR
  ☆222Updated last year
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 4 years ago
• algebraic-dev / http
  🌐 | HTTP primitives for Lean 4
  ☆43Updated 9 months ago
• gwaithimirdain / narya
  A proof assistant for higher-dimensional type theory
  ☆206Updated this week
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆72Updated last week
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆177Updated 2 months ago
• HigherOrderCO / kindbook
  ☆52Updated 7 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• leanprover / fp-lean
  Functional Programming in Lean
  ☆101Updated this week
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 5 months ago
• engboris / stellogen
  An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax
  ☆110Updated 2 weeks ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆74Updated 8 years ago
• barry-jay-personal / tree-calculus
  Proofs in Coq for the book Reflective Programs in Tree Calculus
  ☆178Updated 4 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.
  ☆426Updated this week
• kmill / lean4-raytracer
  A simple raytracer written in Lean 4
  ☆140Updated last year
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆263Updated 11 months ago
• homotopy-io / homotopy-rs
  A Rust/WASM implementation of homotopy.io
  ☆101Updated this week
• fgdorais / lean4-parser
  Parser Combinator Library for Lean 4
  ☆55Updated last week
• argumentcomputer / yatima
  A zero-knowledge Lean4 compiler and kernel
  ☆138Updated 8 months ago
• rami3l / PLFaLean
  Learn Lean 4 with PLFA proofs.
  ☆80Updated 3 months ago
• brendanzab / language-garden
  A garden of small programming language implementations 🪴
  ☆276Updated this week
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆170Updated last month
• leanprover / lake
  **(Deprecated: Merged into Lean 4)** Lean 4 build system and package manager with configuration files written in Lean.
  ☆99Updated last year
• RedPRL / cooltt
  😎TT
  ☆231Updated last year
• digama0 / lean-type-theory
  LaTeX code for a paper on lean's type theory
  ☆141Updated 3 years ago