A verified compiler for an impure functional language
From MaRDI portal
Recommendations
Cited in
(14)- Proving correctness of a compiler using step-indexed logical relations
- Safe functional systems through integrity types and verified assembly
- Observational program calculi and the correctness of translations
- Biorthogonality, step-indexing and compiler correctness
- Calculating certified compilers for non-deterministic languages
- A linear first-order functional intermediate language for verified compilers
- Pilsner: a compositionally verified compiler for a higher-order imperative language
- Programming inductive proofs. A new approach based on contextual types
- A verified runtime for a verified theorem prover
- scientific article; zbMATH DE number 2079040 (Why is no real title available?)
- A provably correct compilation of functional languages into scripting languages
- The verified CakeML compiler backend
- The correctness of a code generator for a functional language
- A verified framework for higher-order uncurrying optimizations
This page was built for publication: A verified compiler for an impure functional language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255065)