An equivalence-preserving CPS translation via multi-language semantics

DOI10.1145/2034773.2034830zbMath1323.68088OpenAlexW4249824250WikidataQ60142680 ScholiaQ60142680MaRDI QIDQ5176993

Matthias Blume, Amal Ahmed

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

zbMATH Keywords

full abstractionlogical relationscontinuation-passing stylemulti-language semanticsback-translationequivalence-preserving compilation

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

Equational logic and categorical semantics for multi-languages ⋮ ANF preserves dependent types up to extensional equality ⋮ On multi-language abstraction. Towards a static analysis of multi-language programs ⋮ Fully abstract trace semantics for protected module architectures ⋮ Observational program calculi and the correctness of translations ⋮ 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