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:
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆23Updated 8 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- ☆17Updated 7 years ago
- being an experiment with potato power☆23Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- Dependently typed elimination functions using singletons☆28Updated last month
- A dependently typed type checker for a TT with intervals☆24Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Invertible parsing for S-expressions☆34Updated last week
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- 🌋 Idris implementation of patricia tree☆23Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- A small NuPRL style proof assistant☆31Updated 7 years ago
- ☆23Updated 2 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- van Laarhoven lenses for Idris☆20Updated 8 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
- Experiments with linear types☆14Updated 7 years ago
- ☆12Updated 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