ernius / mergesort
Merge sort correctness proof
☆11Updated 9 years ago
Alternatives and similar repositories for mergesort:
Users that are interested in mergesort are comparing it to the libraries listed below
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- STLC-related snippets in Agda☆16Updated 11 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Various interesting topics I'm looking at☆13Updated 15 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- ☆16Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- being an experiment with potato power☆23Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Machine-checked Agda formalization for the ILC project☆15Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- The Prettiest Printer☆34Updated last year
- being bits and pieces I'm inclined to leave lying around☆49Updated 4 months ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago