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
  ☆118Updated last year
• HigherOrderCO / Kindex
  Collection of Kind2 programs and proofs
  ☆11Updated 10 months ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆68Updated last month
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆70Updated 8 years ago
• engboris / stellogen
  An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax
  ☆99Updated 2 weeks ago
• inpla / inpla
  Inpla: Interaction nets as a programming language (the current version)
  ☆297Updated 5 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆56Updated 11 months ago
• gwaithimirdain / narya
  A proof assistant for higher-dimensional type theory
  ☆173Updated last week
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆170Updated 3 weeks ago
• HigherOrderCO / kindbook
  ☆46Updated 2 months ago
• fgdorais / lean4-parser
  Parser Combinator Library for Lean 4
  ☆47Updated last month
• polarity-lang / polarity
  A Language with Dependent Data and Codata Types
  ☆94Updated this week
• rzk-lang / sHoTT
  Formalisations for simplicial HoTT and synthetic ∞-categories.
  ☆48Updated 6 months ago
• szeiger / interact
  Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf
  ☆30Updated 11 months ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 4 years ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆258Updated 6 months ago
• barry-jay-personal / tree-calculus
  Proofs in Coq for the book Reflective Programs in Tree Calculus
  ☆168Updated 3 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• joelberkeley / spidr
  Accelerated machine learning with dependent types
  ☆92Updated this week
• axiomed / http
  🌐 | HTTP primitives for Lean 4
  ☆34Updated 5 months ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last month
• BartoszMilewski / DeepLearning
  Neural networks using parametric prelenses and Trimbara modules
  ☆33Updated last year
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated last month
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆62Updated 7 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated last week
• Anderssorby / SDL.lean
  SDL2 bindings for lean
  ☆21Updated last year
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆70Updated 4 months ago
• homotopy-io / homotopy-rs
  A Rust/WASM implementation of homotopy.io
  ☆96Updated this week
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆65Updated 2 weeks ago
• gelisam / klister
  an implementation of stuck macros
  ☆139Updated 2 weeks ago