gallais / agdarkyLinks
Agda suffices: software written from A to Z in Agda
☆16Updated 6 years ago
Alternatives and similar repositories for agdarky
Users that are interested in agdarky are comparing it to the libraries listed below
Sorting:
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- ☆17Updated 7 years ago
- ☆23Updated 8 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Experiments with effect systems☆12Updated 9 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A dependently typed type checker for a TT with intervals☆24Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- being an experiment with potato power☆23Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 8 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Invertible parsing for S-expressions☆34Updated 9 months ago
- ☆23Updated 2 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- A usable type system for call by push-value☆33Updated 6 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
- ☆16Updated 11 months ago
- Mtac in Agda☆29Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago