stonebuddha / eoplLinks
Essentials of Programming Languages, with OCaml implementations & Coq proofs
☆32Updated 8 years ago
Alternatives and similar repositories for eopl
Users that are interested in eopl are comparing it to the libraries listed below
Sorting:
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- Kleene algebra modulo theories☆27Updated 2 years ago
- The LLVM tutorial using OCaml☆60Updated 5 years ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Compiler for Tiger language from "Modern Compiler Implementation in ML"☆16Updated last year
- A splay tree implementation.☆14Updated 3 weeks ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 9 months ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Monad-based linear types in OCaml, with a few syntax extensions☆37Updated 6 years ago
- A Deductive Verification Tool for OCaml Programs☆75Updated 3 weeks ago
- Experimental model finder/SMT solver for functional programming.☆23Updated 3 years ago
- EGraphs in OCaml☆77Updated last year
- Tiny verified SAT-solver☆30Updated 3 years ago
- Algebraic structures in OCaml.☆25Updated 3 weeks ago
- A pretty-printing combinator library for OCaml☆51Updated last year
- OCaml code for Compiler Construction course at University of Cambridge☆43Updated 4 years ago
- A proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superpos…☆27Updated 2 years ago
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2021☆18Updated 4 years ago
- An OCaml library providing a C parser and lexer☆42Updated 11 months ago
- A deterministic parser with fused lexing☆73Updated 2 years ago
- Compiler for a subset of the ML (really OCaml) language. LLVM is used as a backend.☆31Updated 4 years ago
- Experimental model checker for testing concurrent algorithms☆39Updated 10 months ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆21Updated last year
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 5 months ago
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Updated 5 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Updated 2 years ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆38Updated 2 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago