A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
☆16Dec 10, 2019Updated 6 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☆22May 27, 2015Updated 10 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 5 months ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Implementation of sprintf for Coq☆19Apr 6, 2020Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- ☆16Feb 18, 2025Updated last year
- An Agda formalisation of the theory of directed containers☆12Apr 25, 2025Updated 10 months ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Martin-Löf Extensible Specification and Simulator☆29Jul 1, 2015Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Oct 8, 2020Updated 5 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Typing the linear pi calculus in Agda☆29Mar 15, 2022Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated last month
- A usable type system for call by push-value☆33Dec 16, 2019Updated 6 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Jul 27, 2019Updated 6 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago