bobatkey / system-f-parametricity-modelLinks
A Model of Relationally Parametric System F in Coq
☆22Updated 10 years ago
Alternatives and similar repositories for system-f-parametricity-model
Users that are interested in system-f-parametricity-model are comparing it to the libraries listed below
Sorting:
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- ☆18Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆17Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months 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
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 5 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- ☆12Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- ☆16Updated 3 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- ☆26Updated 8 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year