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 10 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
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- An extended typed Lambda Calculus☆21Updated last year
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- ☆21Updated 9 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- An encyclopedia of proofs☆64Updated last year
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 8 months ago
- New version of the PML language and (classical) proof assistant☆20Updated 3 years ago
- Example code demonstrating how SML modules, in particular functors, can be used for structuring a web framework.☆14Updated 11 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Two-Level Type Theory☆28Updated 6 years ago
- A framework for implementing and certifying impure computations in Coq☆53Updated last year