thamugadi / semantic-preservationLinks
Attempt to prove semantic preservation (forward simulation) for a simple compiler.
☆12Updated 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:
- a self-hosting lambda calculus compiler☆37Updated 7 months ago
- Linearizability Hoare Logic☆14Updated 7 months ago
- A SKI combinators interpreter written in assembly☆19Updated 5 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A formalization of System Fω in Agda☆19Updated 8 months ago
- A simple λProlog interpreter☆20Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ☆17Updated last year
- ☆12Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- My Agda blog/lab/playground☆13Updated last month
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 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
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated 2 months ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated 2 months ago
- Formalization of type theory☆22Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- Classical Logic in Haskell☆24Updated 7 months ago