be5invis / idris-dictLinks
A Dict k v in Idris
☆15Updated 4 years ago
Alternatives and similar repositories for idris-dict
Users that are interested in idris-dict are comparing it to the libraries listed below
Sorting:
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- ☆16Updated 7 months ago
- ☆84Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- xmonad in Coq☆46Updated 13 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 2 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 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
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Where my everyday research happens☆55Updated 3 months ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 9 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Multimode simple type theory as an Agda library.☆23Updated last year
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago