An equivalence-preserving CPS translation via multi-language semantics
DOI10.1145/2034773.2034830zbMATH Open1323.68088OpenAlexW4249824250WikidataQ60142680 ScholiaQ60142680MaRDI QIDQ5176993FDOQ5176993
Authors: Amal Ahmed, Matthias Blume 
Publication date: 5 March 2015
Published in: Proceedings of the 16th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2034773.2034830
Recommendations
full abstractionlogical relationscontinuation-passing stylemulti-language semanticsback-translationequivalence-preserving compilation
Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cited In (12)
- CPS-translation as adjoint
- On multi-language abstraction. Towards a static analysis of multi-language programs
- Fully abstract trace semantics for protected module architectures
- Equational logic and categorical semantics for multi-languages
- Observational program calculi and the correctness of translations
- Modular, fully-abstract compilation by approximate back-translation
- Fully abstract compilation via universal embedding
- Fully-abstract compilation by approximate back-translation
- Fully Abstract and Robust Compilation
- Typed closure conversion preserves observational equivalence
- ANF preserves dependent types up to extensional equality
- StkTokens: enforcing well-bracketed control flow and stack encapsulation using linear capabilities
This page was built for publication: An equivalence-preserving CPS translation via multi-language semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176993)
