QuickChick / IFCLinks
Information Flow Control (IFC) case study for the QuickChick testing plugin for Coq. Includes verification of testing and some other Coq proofs.
☆13Updated 2 years ago
Alternatives and similar repositories for IFC
Users that are interested in IFC are comparing it to the libraries listed below
Sorting:
- Luck -- A Language for Property-Based Generators☆35Updated 4 months ago
- ☆29Updated 9 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated last month
- System POSIX bindings for Idris.☆36Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Constructive Galois connections☆32Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated last month
- System F in coq.☆19Updated 10 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- Type theory in type theory☆16Updated 13 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Dependently-typed structures for quantum physics in Idris☆12Updated 9 years ago
- Epic - a Supercombinator Compiler☆65Updated 10 years ago
- Software specification and verification system based on graph rewriting☆37Updated 2 years ago
- An empty code generator, to be used as a starting point for any new back ends.☆51Updated 7 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- ☆21Updated 7 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 7 months ago
- Generation of abstract binding trees☆28Updated 9 months ago