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:
- Self-contained repository for the eponymous paper☆30Updated 6 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 11 months ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- OCaml backend for Idris2☆20Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Template repo for theorem proving in Liquid Haskell☆32Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Experiments with sequent calculi☆28Updated 4 years ago
- ☆32Updated 7 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years 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
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆12Updated 10 years ago