Alternatives and similar repositories for morphic

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

• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆54Updated 5 months ago
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆170Updated last month
• polarity-lang / polarity
  A Language with Dependent Data and Codata Types
  ☆107Updated this week
• iu-parfunc / gibbon
  A compiler for functional programs on serialized data
  ☆165Updated last month
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆177Updated 2 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• Storyyeller / cubiml-demo
  A simple ML-like programming language with subtyping and full type inference.
  ☆177Updated 8 months ago
• fir-lang / fir
  Fir programming language
  ☆63Updated this week
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆40Updated 7 months ago
• hkust-taco / mlscript
  The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…
  ☆195Updated 2 weeks ago
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆98Updated 3 years ago
• FrankBro / ordo
  Ordo: A minimalist language with row polymorphism
  ☆82Updated 3 months ago
• luc-tielen / eclair-lang
  A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR
  ☆222Updated last year
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆263Updated 10 months ago
• ayazhafiz / plts
  A collection of programming languages and type systems.
  ☆33Updated 2 months ago
• yallop / ocaml-flap
  A deterministic parser with fused lexing
  ☆73Updated 2 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆74Updated 8 years ago
• cu1ch3n / type-inference-zoo
  🦖 Implementations of various type inference algorithms. Online interactive playground is available at https://zoo.cuichen.cc/
  ☆145Updated last month
• dunhamsteve / newt
  A toy dependent typed language.
  ☆31Updated this week
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 5 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• wilbowma / pl-thesaurus
  ☆90Updated 3 years ago
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆72Updated 3 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆63Updated 8 years ago
• lexa-lang / lexa
  ☆35Updated 9 months ago
• VictorTaelin / Interaction-Type-Theory
  ☆119Updated last year
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 4 years ago
• zydeco-lang / zydeco
  a proof-of-concept programming language based on call-by-push-value
  ☆54Updated this week
• VictorTaelin / interaction-calculus-of-constructions
  A minimal proof checker.
  ☆75Updated 10 months ago
• thunderseethe / making-a-language
  Full Source Code for Making a Language series
  ☆50Updated last month