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
- ☆17Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 weeks ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- ☆18Updated 3 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- ☆16Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- ☆16Updated 5 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 8 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago