pigworker / potatoLinks
being an experiment with potato power
☆23Updated 5 years ago
Alternatives and similar repositories for potato
Users that are interested in potato are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- ☆17Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- Category theory formalized in cubical agda☆21Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- ☆16Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago