thamugadi / semantic-preservationLinks
Attempt to prove semantic preservation (forward simulation) for a simple compiler.
☆11Updated last year
Alternatives and similar repositories for semantic-preservation
Users that are interested in semantic-preservation are comparing it to the libraries listed below
Sorting:
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Linearizability Hoare Logic☆14Updated 3 months ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- ☆17Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- A simple λProlog interpreter☆20Updated 3 years ago
- A formalization of System Fω in Agda☆17Updated 5 months ago
- Normalization for Gödel's system T using a glueing model construction☆9Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- a self-hosting lambda calculus compiler☆36Updated 3 months ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- Small async library for idris2, inspired by purescript-aff☆8Updated 3 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- Zippers for cofree types☆12Updated 3 years ago
- Practical type inference for arbitrary-rank types☆11Updated 6 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Haskell bindings to Chez Scheme☆10Updated last year
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- A simple functional programming language.☆21Updated 4 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- ☆17Updated 6 years ago
- A toy dependent typed language.☆30Updated last week
- 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 supercompiler formally verified in Agda☆34Updated 8 years ago