Alternatives and similar repositories for interaction-calculus-of-constructions

Users that are interested in interaction-calculus-of-constructions are comparing it to the libraries listed below

• VictorTaelin / Interaction-Type-Theory
  ☆119Updated last year
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 2 months ago
• HigherOrderCO / Kindex
  Collection of Kind2 programs and proofs
  ☆11Updated last year
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆72Updated 8 years ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆59Updated last year
• engboris / stellogen
  An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax
  ☆103Updated this week
• barry-jay-personal / tree-calculus
  Proofs in Coq for the book Reflective Programs in Tree Calculus
  ☆173Updated 3 years ago
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆69Updated 2 months ago
• HigherOrderCO / kindbook
  ☆47Updated 4 months ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆172Updated last week
• polarity-lang / polarity
  A Language with Dependent Data and Codata Types
  ☆104Updated this week
• inpla / inpla
  Inpla: Interaction nets as a programming language (the current version)
  ☆302Updated 6 months ago
• gwaithimirdain / narya
  A proof assistant for higher-dimensional type theory
  ☆190Updated this week
• fgdorais / lean4-parser
  Parser Combinator Library for Lean 4
  ☆49Updated this week
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated this week
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated 2 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…
  ☆35Updated this week
• joelberkeley / spidr
  Accelerated machine learning with dependent types
  ☆95Updated this week
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆63Updated 7 years ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆260Updated 8 months ago
• axiomed / http
  🌐 | HTTP primitives for Lean 4
  ☆38Updated 6 months ago
• rzk-lang / sHoTT
  Formalisations for simplicial HoTT and synthetic ∞-categories.
  ☆49Updated 7 months ago
• HigherOrderCO / FormCoreJS
  A minimal pure functional language based on self dependent types.
  ☆73Updated 3 years ago
• tydeu / lean4-alloy
  Write C shims from within Lean code.
  ☆56Updated 5 months ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 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
• pamellies / models-of-programming-languages
  Slides and handwritten notes on the course on models of programming languages
  ☆51Updated 4 years ago