bobatkey / system-f-parametricity-model
A Model of Relationally Parametric System F in Coq
☆22Updated 9 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
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆18Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 4 months ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- ☆12Updated 5 years ago
- ☆17Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ☆16Updated 3 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- ☆11Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- STLC-related snippets in Agda☆16Updated 11 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- ☆12Updated 5 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 10 months ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated last year
- Agda code for experimenting with internal models of cubical type theory☆13Updated 7 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 library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago