catalin-hritcu / fstar-courseLinks
Program verification with F* course materials
☆12Updated 6 years ago
Alternatives and similar repositories for fstar-course
Users that are interested in fstar-course are comparing it to the libraries listed below
Sorting:
- ☆29Updated 9 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- Choice operator in OCaml, providing a backtracking monad☆26Updated 3 years ago
- 🌳 Generate a fresh bonsai in your terminal☆28Updated 3 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 4 months ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Higher-order FRP compiler☆15Updated 3 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated 11 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Updated last year
- An extended typed Lambda Calculus☆21Updated last year
- OCaml syntax extension for synchronous programming...☆32Updated 2 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Partial Commutative Monoids☆28Updated 2 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- New version of the PML language and (classical) proof assistant☆20Updated 3 years ago
- ☆13Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A Pretty Printer, based on Philip Wadler's "A prettier printer". But heavily modified to be efficient in a strict language.☆19Updated 4 years ago
- Formalization of the Truly Stateless Concurrency Model Checker in Coq☆13Updated 3 years ago
- αProlog☆18Updated 2 years ago