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:
- Linearizability Hoare Logic☆14Updated 5 months ago
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- A formalization of System Fω in Agda☆19Updated 7 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ☆17Updated last year
- Zippers for cofree types☆13Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated last month
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- ☆12Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- 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.☆40Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- A simple functional programming language.☆22Updated 4 years ago
- My Agda blog/lab/playground☆13Updated this week
- Funny little Haskell impl☆18Updated 4 years ago