Alternatives and similar repositories for fomega:

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

• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆87Updated 6 years ago
• agda / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 6 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆101Updated last year
• slindley / effect-handlers
  ☆82Updated 10 months ago
• Ekdohibs / joujou
  A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …
  ☆89Updated 6 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• keigoi / session-ocaml
  An implementation of binary session types in OCaml
  ☆36Updated 5 years ago
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆43Updated 2 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆91Updated 7 years ago
• andgate / type-theory-compiler
  Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…
  ☆43Updated 5 years ago
• yallop / higher
  Higher-kinded programming in OCaml
  ☆181Updated last year
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆43Updated 2 weeks ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆105Updated 9 years ago
• plclub / cis670-16fa
  Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016
  ☆42Updated 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
• protz / mezzo
  The language of the future!
  ☆72Updated last year
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• fpottier / pprint
  A pretty-printing combinator library for OCaml
  ☆49Updated 7 months ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• Mtac2 / Mtac2
  ☆54Updated 3 weeks ago
• haskell / hoopl
  Higher-order optimization library
  ☆74Updated last year
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• Gbury / mSAT
  A modular sat/smt solver with proof output.
  ☆99Updated last year
• rlepigre / ocaml-bindlib
  Efficient binder representation in OCaml
  ☆40Updated 8 months ago
• tchajed / iris-simp-lang
  We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …
  ☆50Updated 3 weeks ago
• pleiad / Refinements
  Experiments in formalizing refinement type systems in Coq
  ☆17Updated 9 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆81Updated 3 years ago