thamugadi / semantic-preservationView external linksLinks
Attempt to prove semantic preservation (forward simulation) for a simple compiler.
☆12May 1, 2024Updated 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☆17Updated this week
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated last year
- Practical type inference for arbitrary-rank types☆11May 25, 2019Updated 6 years ago
- A command-line parser for Standard ML☆21Dec 29, 2025Updated last month
- Martin-Löf type theory + W-types implemented in C (WIP)☆27Aug 9, 2025Updated 6 months ago
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Apr 18, 2017Updated 8 years ago
- Zippers for cofree types☆13Dec 7, 2021Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Dec 2, 2025Updated 2 months ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Apr 3, 2023Updated 2 years ago
- ☆17Apr 4, 2024Updated last year
- Matita (proof assistant) with embedded elpi☆15Jan 30, 2018Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- ☆16Apr 19, 2022Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- GHC plugin to desugar ! into do-notation☆38Feb 4, 2026Updated last week
- dependent type theory experiment☆26Mar 1, 2024Updated last year
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆36Oct 25, 2024Updated last year
- Demo for dependent types + runtime code generation☆72Feb 18, 2025Updated 11 months ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆59Apr 15, 2021Updated 4 years ago
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆43Updated this week
- koneko - a concatenative not-quite-lisp for kittens☆25Aug 30, 2024Updated last year
- A proof tree viewer that works with Coq through Proof General☆28Jan 29, 2021Updated 5 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Jan 15, 2026Updated 3 weeks ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Dec 13, 2018Updated 7 years ago
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 6 months ago
- Cellular automata environment written in Common Lisp☆18Apr 17, 2021Updated 4 years ago
- A programming language that deduces code from tests☆30Jan 8, 2018Updated 8 years ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆12Dec 2, 2025Updated 2 months ago
- ☆12Feb 11, 2019Updated 7 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- higher order dependently typed logic programing☆173Aug 7, 2018Updated 7 years ago
- Formalizing nbe in agda☆32Nov 22, 2012Updated 13 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 3 months ago
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆14May 23, 2025Updated 8 months ago