pigworker / MingLinks
being the emperor of Mongo, but also a verb
☆15Updated 6 years ago
Alternatives and similar repositories for Ming
Users that are interested in Ming are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆35Updated 4 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Mtac in Agda☆28Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 9 years ago
- Where my everyday research happens☆54Updated 2 months ago
- Deferring the Details and Deriving Programs☆14Updated 6 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago