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:
- 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 8 months ago
- a self-hosting lambda calculus compiler☆37Updated 8 months 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 simple λProlog interpreter☆20Updated 4 years ago
- A formalization of System Fω in Agda☆20Updated 9 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- ☆12Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Zippers for cofree types☆13Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- ☆17Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Classical Logic in Haskell☆24Updated 3 weeks ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- Formalization of type theory☆22Updated 4 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated 2 weeks ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 4 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 4 years ago