QuickChick / LuckLinks
Luck -- A Language for Property-Based Generators
☆35Updated 6 months ago
Alternatives and similar repositories for Luck
Users that are interested in Luck are comparing it to the libraries listed below
Sorting:
- Constructive Galois connections☆35Updated 7 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A mechanized proof of type safety for Featherweight Java using Coq☆16Updated 7 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- ☆29Updated 10 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- The Ynot Project source code.☆22Updated 11 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Type theory in type theory☆16Updated 13 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
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 7 years ago
- Formal topology (and some probability) in Coq☆32Updated 6 years ago
- Reference type checker for the Lean theorem prover☆62Updated 8 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- A framework for implementing and certifying impure computations in Coq☆52Updated last year
- Generation of abstract binding trees☆27Updated 10 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year