pi8027 / stablesortLinks
Stable sort algorithms and their stability proofs in Rocq
☆25Updated 2 weeks ago
Alternatives and similar repositories for stablesort
Users that are interested in stablesort are comparing it to the libraries listed below
Sorting:
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 4 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- a version of the 2048 game for Coq☆22Updated last year
- NbE course @ Chalmers☆28Updated 11 months ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- ☆18Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- ☆13Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- ☆16Updated 2 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A style guide for Coq☆18Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 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
- ☆29Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago