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
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- ☆23Updated 8 years ago
- ☆17Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Experiments with effect systems☆12Updated 9 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Mtac in Agda☆28Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 10 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- Hakyll support for Agda literate files☆19Updated 4 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 4 months ago
- Dependently typed elimination functions using singletons☆28Updated 8 months ago
- System F implemented in Haskell☆24Updated 13 years ago
- A semantic highlighter for Idris code☆14Updated 7 years ago