pi8027 / stablesortLinks
Stable sort algorithms and their stability proofs in Rocq
☆25Updated last month
Alternatives and similar repositories for stablesort
Users that are interested in stablesort are comparing it to the libraries listed below
Sorting:
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- Mtac in Agda☆28Updated 4 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 5 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 3 weeks ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆33Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- being a particular fragment of Haskell, extended to a proof system☆39Updated 2 months ago
- Mechanizing Types and Programming Languages using Beluga☆21Updated 5 years ago
- ☆30Updated 2 years ago
- A style guide for Coq☆18Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- NbE course @ Chalmers☆28Updated last year
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated last week
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- ☆48Updated last month
- ☆13Updated 5 years ago
- A cost-aware logical framework, embedded in Agda.☆66Updated last week