pigworker / potato
being an experiment with potato power
☆23Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for potato
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- Category theory formalized in cubical agda☆20Updated 4 years ago
- A usable type system for call by push-value☆28Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 5 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- Type Theory with Indexed Equality☆23Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Linear map categories in Agda☆5Updated last year
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 6 years ago
- Experiments with effect systems☆12Updated 8 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 weeks ago
- Formalization of Opetopes and Opetopic Sets in Agda☆17Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆15Updated 5 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- ☆23Updated 7 years ago