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
- Haskell implementation of the Edinburgh Logical Framework☆32Updated last month
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 5 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Mtac in Agda☆29Updated 4 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- NbE course @ Chalmers☆28Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 2 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- ☆31Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆44Updated last month
- being a particular fragment of Haskell, extended to a proof system☆43Updated 2 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆87Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- Logical relations proof in Agda☆27Updated 10 years ago
- ☆23Updated last year
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- ☆21Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- ☆17Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated 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