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:
- OCaml backend for Idris2☆19Updated 4 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 2 weeks ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A priliminary backend for Idris that compiles to Clean.☆15Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Experiments with linear types☆14Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- Category theory formalized in cubical agda☆21Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- ☆18Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago