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
  ☆18Updated 5 years ago
• cdfa / frugel
  An error-tolerant live programming environment (my Master's thesis)
  ☆18Updated 2 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• Soonad / Base.fm
  Standard library for the Formality language
  ☆18Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆28Updated 5 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• xran-deex / ats-http
  An epoll-based HTTP library for ATS2
  ☆14Updated 2 years ago
• reactiveml / rml
  ReactiveML: a programming language for implementing interactive systems.
  ☆20Updated 2 years ago
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆37Updated 6 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• VictorTaelin / optimul
  Multiplication on optimal λ-calculus reducers
  ☆22Updated 4 years ago
• janestreet / higher_kinded
  A library with an encoding of higher kinded types in OCaml
  ☆40Updated 3 months ago
• vmchale / recursion
  Recursion schemes in ATS
  ☆9Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 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
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆30Updated 6 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 2 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• joom / dilim
  A structure editor for a simple functional programming language, with Vim-like shortcuts and commands.
  ☆15Updated last year
• ianthehenry / ocamlsyntax.com
  How do you do that recursive GADT thing again?
  ☆27Updated 11 months ago