QuickChick / IFCLinks
Information Flow Control (IFC) case study for the QuickChick testing plugin for Coq. Includes verification of testing and some other Coq proofs.
☆12Updated 2 years ago
Alternatives and similar repositories for IFC
Users that are interested in IFC are comparing it to the libraries listed below
Sorting:
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated 3 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- ☆29Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Luck -- A Language for Property-Based Generators☆34Updated 3 months ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Constructive Galois connections☆32Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Type theory in type theory☆16Updated 13 years ago
- ☆21Updated 7 years ago
- Haskell typechecker☆39Updated 6 years ago
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- System F in coq.☆19Updated 10 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Work in progress☆34Updated last week
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 6 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 5 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago