msprotz / proof-search-monad
Tentative write-up of a neat trick used in the Mezzo type-checker
☆14Updated 9 years ago
Alternatives and similar repositories for proof-search-monad:
Users that are interested in proof-search-monad are comparing it to the libraries listed below
- A simple implementation of linear type theory☆38Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 7 years ago
- A Dependently Typed Programming Language☆27Updated 4 years ago
- Type Theory in Type Theory using Cubical Agda☆12Updated 6 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- ☆23Updated 7 years ago
- Edit is a monad for rewriting things.☆23Updated 4 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- 🌋 Idris implementation of patricia tree☆22Updated 4 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Types representing line and column positions and ranges in text files☆11Updated last year
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 4 years ago
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- Haskell port of the Tensor Algebra COmpiler☆16Updated 5 years ago
- Experiments with effect systems☆12Updated 8 years ago
- a logic-based trust-management system☆19Updated 12 years ago
- Linear map categories in Agda☆5Updated last year
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Recursion schemes in ATS☆9Updated 2 years ago