QuickChick / LuckLinks
Luck -- A Language for Property-Based Generators
☆36Updated 11 months ago
Alternatives and similar repositories for Luck
Users that are interested in Luck are comparing it to the libraries listed below
Sorting:
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- An enhanced unification algorithm for Coq☆58Updated last week
- ☆29Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- The Ynot Project source code.☆22Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A mechanized proof of type safety for Featherweight Java using Coq☆16Updated 7 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 5 months ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 7 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- ☆86Updated 8 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- 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.☆36Updated 8 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- The Penn Locally Nameless Metatheory Library☆75Updated 10 months ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year