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 tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- ☆17Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ☆18Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆12Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Quasi-quoting library for agda☆17Updated 8 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- ☆16Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago