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:
- IO using sized types and copatterns☆36Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- OCaml backend for Idris2☆19Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Where my everyday research happens☆55Updated last week
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Compiler backend for generating Scheme code☆27Updated last year
- ☆12Updated 10 years ago
- Dependently typed elimination functions using singletons☆28Updated 9 months ago
- Category theory formalized in cubical agda☆21Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago