gallais / pearl-binary-searchLinks
Functional Pearl: Certified Binary Search in a Read-Only Array
☆29Updated 4 years ago
Alternatives and similar repositories for pearl-binary-search
Users that are interested in pearl-binary-search are comparing it to the libraries listed below
Sorting:
- Session types in Idris2!☆27Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- OCaml backend for Idris2☆20Updated 5 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 4 months ago