ayberkt / simplcLinks
A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
☆16Updated 5 years ago
Alternatives and similar repositories for simplc
Users that are interested in simplc are comparing it to the libraries listed below
Sorting:
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆17Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- ☆18Updated 3 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Mtac in Agda☆28Updated 4 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- 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
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- ☆16Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago