pi8027 / stablesortLinks
Stable sort algorithms and their stability proofs in Rocq
☆25Updated 2 months 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☆36Updated 10 months ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆44Updated last month
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- Mtac in Agda☆29Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 5 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated last month
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- ☆31Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 2 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- # A simple variable binding library based on well-scoped indices and environments☆29Updated 3 months ago
- Constructive Galois connections☆36Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated 3 weeks ago
- NbE course @ Chalmers☆28Updated last year
- being a particular fragment of Haskell, extended to a proof system☆43Updated 2 months ago
- a version of the 2048 game for Coq☆22Updated last week
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated 2 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆87Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago