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 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- ☆18Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 weeks ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 11 months ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 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
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- ☆16Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last month
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- Agda to C compiler☆10Updated 2 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago