ayberkt / simplc
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
- ☆17Updated 6 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 11 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- ☆18Updated 2 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- Quasi-quoting library for agda☆17Updated 3 months ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- ☆11Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- Agda to C compiler☆10Updated last year
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Linear map categories in Agda☆5Updated 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
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- ☆16Updated 3 years ago
- ☆12Updated 5 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- ☆16Updated last month
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago