Alternatives and similar repositories for FormCoreJS:

Users that are interested in FormCoreJS are comparing it to the libraries listed below

• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆58Updated last year
• VictorTaelin / Formality
  ☆38Updated 4 years ago
• Soonad / Base.fm
  Standard library for the Formality language
  ☆18Updated 5 years ago
• VictorTaelin / interaction-calculus-of-constructions
  A minimal proof checker.
  ☆74Updated 7 months ago
• kindelia-archive / LambdaVM
  A next-gen, massively parallel, beta-optimal functional runtime.
  ☆10Updated 3 years ago
• AshleyYakeley / Truth
  Changes and Pinafore projects. Pull requests not accepted.
  ☆33Updated this week
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆70Updated 8 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• VictorTaelin / absal-rs
  ☆35Updated 6 years ago
• T-Brick / lean2wasm
  Tool for compiling Lean to WASM
  ☆19Updated last year
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 2 months ago
• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆26Updated 2 years ago
• Soonad / FormalityFM
  Formality in itself
  ☆20Updated 4 years ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆45Updated 2 months ago
• VictorTaelin / ultimate-calculus
  ☆36Updated 3 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• HigherOrderCO / Kindex
  Collection of Kind2 programs and proofs
  ☆11Updated 11 months ago
• grain-lang / binaryen.ml
  OCaml bindings for Binaryen.
  ☆49Updated last month
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 4 years ago
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆63Updated 3 years ago
• jkoppel / ecta
  ☆35Updated last year
• VictorTaelin / calculus-of-constructions
  Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.
  ☆112Updated 7 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• ayazhafiz / plts
  A collection of programming languages and type systems.
  ☆33Updated 8 months ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated 2 months ago
• Soonad / Moonad
  An upcoming operating system built on Type-Theory
  ☆43Updated 4 years ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆41Updated 2 years ago
• codedot / lambda
  Macro Lambda Calculus
  ☆49Updated 6 years ago
• SPY / idris-codegen-wasm
  WebAssembly Code Generation Backend for Idris Compiler
  ☆82Updated 6 years ago