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
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- ☆23Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- ☆17Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- ☆23Updated 2 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 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
- Invertible parsing for S-expressions☆34Updated 6 months ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- Dependently typed elimination functions using singletons☆28Updated 10 months ago
- Experimental normalisation via scheme☆12Updated 4 years ago