Saizan / parametric-demoLinks
☆12Updated 6 years ago
Alternatives and similar repositories for parametric-demo
Users that are interested in parametric-demo are comparing it to the libraries listed below
Sorting:
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years 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 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- An Agda formalisation of the theory of directed containers☆12Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 months ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- ☆16Updated 3 years ago
- ☆17Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- ☆18Updated 3 years ago
- ☆19Updated 11 months ago
- ☆31Updated 10 years ago