Program transformations in a denotational setting
From MaRDI portal
Recommendations
Cited in
(22)- Reducing transformations for functional programs with assignment
- A security flow control algorithm and its denotational semantics correctness proof
- MetaML and multi-stage programming with explicit annotations
- Incorporating static analysis in a combinator-based compiler
- A Kripke logical relation for effect-based program transformations
- Abstract interpretation from a denotational-semantics perspective
- Hoare logic for disjunctive information flow
- Parallélisation sémantique
- A Framework for Point-Free Program Transformation
- Formal program construction by transformations-computer-aided, intuition-guided programming
- scientific article; zbMATH DE number 18537 (Why is no real title available?)
- Inverse-limit and topological aspects of abstract interpretation
- scientific article; zbMATH DE number 6823356 (Why is no real title available?)
- Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis†
- A new criterion for safe program transformations
- Using transformations in the implementation of higher-order functions
- Program transformation and rewriting
- scientific article; zbMATH DE number 234026 (Why is no real title available?)
- scientific article; zbMATH DE number 5033863 (Why is no real title available?)
- scientific article; zbMATH DE number 2242599 (Why is no real title available?)
- Program transformation system based on generalized partial computation
- Two-level semantics and abstract interpretation
This page was built for publication: Program transformations in a denotational setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3681904)