be5invis / idris-dictLinks
A Dict k v in Idris
☆15Updated 5 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:
- ☆16Updated 9 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- ☆84Updated 8 years ago
- Sucessor: https://github.com/thautwarm/Quick-Backend☆24Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 4 months ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆27Updated last month
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Multimode simple type theory as an Agda library.☆23Updated last year
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- Session types in Idris2!☆27Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- TODO☆23Updated 10 years ago
- xmonad in Coq☆46Updated 13 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- ☆16Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- a little category theory in Idris☆10Updated 9 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago