QuickChick / LuckLinks
Luck -- A Language for Property-Based Generators
☆35Updated 9 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☆36Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- ☆29Updated 10 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- An enhanced unification algorithm for Coq☆58Updated last week
- A mechanized proof of type safety for Featherweight Java using Coq☆16Updated 7 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 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 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- System F in coq.☆19Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 4 months ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- The Ynot Project source code.☆22Updated 11 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 months ago
- Generation of abstract binding trees☆27Updated 2 months ago
- The Evolution of a Typechecker☆54Updated 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
- IO using sized types and copatterns☆36Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- MetaML and MetaOCaml bibliography☆97Updated last year