thamugadi / semantic-preservation
Attempt to prove semantic preservation (forward simulation) for a simple compiler.
☆10Updated 10 months ago
Alternatives and similar repositories for semantic-preservation:
Users that are interested in semantic-preservation are comparing it to the libraries listed below
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated last year
- A SKI combinators interpreter written in assembly☆19Updated 4 years ago
- A formalization of System Fω in Agda☆16Updated last month
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- ☆17Updated 11 months ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- Haskell bindings to Chez Scheme☆10Updated last year
- a self-hosting lambda calculus compiler☆35Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Zippers for cofree types☆12Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Linear map categories in Agda☆5Updated last year
- ☆12Updated 6 years ago
- A Teeny Type Theory☆26Updated 2 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A simple functional programming language.☆21Updated 3 years ago
- Small async library for idris2, inspired by purescript-aff☆8Updated 3 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
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆30Updated last month
- Label dependent dependent session types☆15Updated 10 months ago
- A toy dependent typed language.☆28Updated this week
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year