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 4 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
• barry-jay-personal / tree-calculus
  Proofs in Coq for the book Reflective Programs in Tree Calculus
  ☆174Updated 4 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
• inpla / inpla
  Inpla: Interaction nets as a programming language (the current version)
  ☆306Updated 7 months ago
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆70Updated last week
• gwaithimirdain / narya
  A proof assistant for higher-dimensional type theory
  ☆200Updated this week
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆174Updated last month
• engboris / stellogen
  An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax
  ☆107Updated this week
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated 4 months ago
• polarity-lang / polarity
  A Language with Dependent Data and Codata Types
  ☆106Updated 2 weeks ago
• algebraic-dev / http
  🌐 | HTTP primitives for Lean 4
  ☆39Updated 8 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆53Updated 4 months ago
• BartoszMilewski / DeepLearning
  Neural networks using parametric prelenses and Trimbara modules
  ☆33Updated last year
• joelberkeley / spidr
  Accelerated machine learning with dependent types
  ☆95Updated 3 weeks ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆63Updated 8 years ago
• fgdorais / lean4-parser
  Parser Combinator Library for Lean 4
  ☆50Updated 2 weeks ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆114Updated 3 weeks ago
• HigherOrderCO / FormCoreJS
  A minimal pure functional language based on self dependent types.
  ☆73Updated 3 years ago
• HigherOrderCO / kindbook
  ☆50Updated 5 months ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• luc-tielen / eclair-lang
  A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR
  ☆222Updated last year
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated 4 months ago
• Gadersd / ic
  An interaction combinator runtime
  ☆17Updated 9 months ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆73Updated last month
• ollef / rock
  Build system
  ☆123Updated last year