ayberkt / simplc
A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
☆16Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for simplc
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 7 months ago
- ☆17Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- ☆18Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Quasi-quoting library for agda☆17Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Multimode simple type theory as an Agda library.☆22Updated 2 months ago
- Agda to C compiler☆10Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Experimental normalisation via scheme☆12Updated 3 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- ☆16Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ☆12Updated 5 years ago
- ☆11Updated 4 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- A bare-bones LCF-style proof assistant☆21Updated 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…☆19Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago