Alternatives and similar repositories for inet-js:

Users that are interested in inet-js are comparing it to the libraries listed below

• cicada-lang / inet-cute
  An implementation of interaction nets in JS.
  ☆132Updated 3 months ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆45Updated 2 months ago
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆63Updated 3 years ago
• VictorTaelin / interaction-calculus-of-constructions
  A minimal proof checker.
  ☆74Updated 7 months ago
• VictorTaelin / Interaction-Type-Theory
  ☆119Updated last year
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆70Updated 8 years ago
• cicada-lang / inet-forth
  An implementation of interaction nets as a forth-like language.
  ☆33Updated last week
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆68Updated last month
• inpla / inpla
  Inpla: Interaction nets as a programming language (the current version)
  ☆300Updated 6 months ago
• Innf107 / polaris
  A functional programming language with shell scripting capabilities
  ☆114Updated 4 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• marvinborner / bruijn
  Programming with pure lambda calculus
  ☆106Updated 2 weeks ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆171Updated 2 weeks ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 2 months ago
• cicada-lang / cicada-plct
  Cicada Language (PLCT little team)
  ☆92Updated 4 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆72Updated last week
• HigherOrderCO / FormCoreJS
  A minimal pure functional language based on self dependent types.
  ☆72Updated 2 years ago
• UberPyro / prowl
  WIP stack language that uses regex for control flow
  ☆42Updated last year
• tnelson / Forge
  Forge: A Tool and Language for Teaching Formal Methods
  ☆75Updated last week
• luc-tielen / eclair-lang
  A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR
  ☆222Updated last year
• engboris / stellogen
  An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax
  ☆101Updated last week
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆260Updated 8 months ago
• glossopoeia / boba
  A general purpose statically-typed concatenative programming language.
  ☆54Updated 2 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆58Updated last year
• polarity-lang / polarity
  A Language with Dependent Data and Codata Types
  ☆102Updated this week
• ayazhafiz / plts
  A collection of programming languages and type systems.
  ☆33Updated 8 months ago
• jkoppel / ecta
  ☆35Updated last year
• ncihnegn / miranda
  Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…
  ☆57Updated 11 months ago
• standardml / twelf
  The Twelf Programming Language
  ☆128Updated 3 months ago