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 10 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- ☆16Updated 7 months ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- Category theory formalized in cubical agda☆21Updated 5 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 3 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆26Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- ☆16Updated 3 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago