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:
- ☆17Updated 6 years ago
- ☆18Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- IO using sized types and copatterns☆35Updated 4 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- ☆16Updated 3 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 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
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- ☆12Updated 5 years ago
- ☆16Updated 4 months ago
- Agda to C compiler☆10Updated 2 years ago
- ☆11Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago