Alternatives and similar repositories for eopl:

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

• mgree / kmt
  Kleene algebra modulo theories
  ☆27Updated 2 years ago
• c-cube / mc2
  [research] A modular SMT solver in OCaml, based on mcSAT
  ☆39Updated last year
• fpottier / pprint
  A pretty-printing combinator library for OCaml
  ☆51Updated 9 months ago
• mit-frap / spring21
  Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2021
  ☆18Updated 3 years ago
• keigoi / linocaml
  Monad-based linear types in OCaml, with a few syntax extensions
  ☆37Updated 5 years ago
• xavierleroy / cdf-program-logics
  Companion Coq development for Xavier Leroy's 2021 lectures on program logics
  ☆40Updated 4 years ago
• dhil / ocaml-multicont
  multi-shot continuations in OCaml
  ☆48Updated 2 months ago
• mgrabovsky / fm-notes
  Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on
  ☆22Updated last year
• kayceesrk / cs6225_s21_iitm
  Course Website for CS6225: Programs and Proofs @ IIT Madras
  ☆11Updated 4 years ago
• adamrk / llvm-ocaml-tutorial
  The LLVM tutorial using OCaml
  ☆61Updated 5 years ago
• rocq-community / atbr
  Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]
  ☆23Updated 6 months ago
• c-cube / sidekick
  A modular library for CDCL(T) SMT solvers, with [wip] proof generation.
  ☆24Updated 3 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• AD1024 / dtlc
  Dependently typed lambda calculus - A Simple Proof Assistant
  ☆12Updated 4 years ago
• thery / hanoi
  Hanoi tower in Coq
  ☆25Updated 4 months ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• janestreet / splay_tree
  A splay tree implementation.
  ☆13Updated last week
• 4y8 / combo
  A simple parser combinator library for Ocaml
  ☆30Updated 3 years ago
• rocq-community / hoare-tut
  A Tutorial on Reflecting in Coq the generation of Hoare proof obligations [maintainer=@k4rtik]
  ☆21Updated 3 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆46Updated 5 years ago
• Lysxia / coq-ceres
  Coq library for serialization to S-expressions
  ☆19Updated last year
• uwplse / cheerios
  Formally verified Coq serialization library with support for extraction to OCaml
  ☆23Updated last year
• tchajed / iris-simp-lang
  We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …
  ☆51Updated 2 months ago
• Mtac2 / Mtac2
  ☆55Updated last month
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 6 years ago
• cmaes / miniml
  Compiler for a subset of the ML (really OCaml) language. LLVM is used as a backend.
  ☆31Updated 4 years ago
• tmcgilchrist / tiger
  Compiler for Tiger language from "Modern Compiler Implementation in ML"
  ☆16Updated 9 months ago
• witan-org / witan
  An ocaml implementation of conflict-driven reasoning
  ☆14Updated 6 years ago
• mmcco / verified-parser-example
  A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.
  ☆20Updated 10 years ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆28Updated 3 months ago