Alternatives and similar repositories for lvca

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

• elpinal / modules-rs
  An interpreter of F-ing modules
  ☆19Updated 6 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• cdfa / frugel
  An error-tolerant live programming environment (my Master's thesis)
  ☆19Updated 2 years ago
• janestreet / higher_kinded
  A library with an encoding of higher kinded types in OCaml
  ☆40Updated last week
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• chessai / hsdatalog
  BDD-based implementation of Datalog
  ☆37Updated 5 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• owainlewis / bridge
  A type-safe, stack-based functional programming language
  ☆16Updated 4 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 3 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• dannywillems / RML
  ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.
  ☆37Updated 3 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• joom / dilim
  A structure editor for a simple functional programming language, with Vim-like shortcuts and commands.
  ☆15Updated last year
• vmchale / recursion
  Recursion schemes in ATS
  ☆9Updated 3 years ago
• seadynamic8 / ocaml-modern-docs
  Unofficial OCaml Standard Library Docs - Modern Theme
  ☆11Updated 6 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• ianthehenry / ocamlsyntax.com
  How do you do that recursive GADT thing again?
  ☆28Updated last year
• jkoppel / ecta
  ☆35Updated last year
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆52Updated 4 months ago
• jaredly / j3
  Another attempt to realize my programming language
  ☆23Updated 4 months ago
• eviefp / logic-in-haskell
  Classical Logic in Haskell
  ☆24Updated 2 months ago
• zinid / delimcc
  Delimited continuations in byte-code and native OCaml
  ☆27Updated 4 years ago