Typed closure conversion preserves observational equivalence

DOI10.1145/1411204.1411227zbMATH Open1323.68350DBLPconf/icfp/AhmedB08OpenAlexW4242150334WikidataQ60142692 ScholiaQ60142692MaRDI QIDQ5178761FDOQ5178761

Authors: Amal Ahmed, Matthias Blume 

Publication date: 16 March 2015

Published in: Proceedings of the 13th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1411204.1411227

Recommendations

• An equivalence-preserving CPS translation via multi-language semantics
• Fully abstract compilation via universal embedding
• Fully-abstract compilation by approximate back-translation
• Modular, fully-abstract compilation by approximate back-translation
• scientific article; zbMATH DE number 1231621

zbMATH Keywords

full abstractionstep-indexed logical relationsequivalence-preserving compilationtyped closure conversion

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Cited In (11)

• Universal properties for universal types in bifibrational parametricity
• Observational program calculi and the correctness of translations
• Fully abstract compilation to JavaScript
• Modular, fully-abstract compilation by approximate back-translation
• An equivalence-preserving CPS translation via multi-language semantics
• Title not available (Why is that?)
• Parametric Polymorphism — Universally
• Title not available (Why is that?)
• Fully abstract compilation via universal embedding
• Fully-abstract compilation by approximate back-translation
• Fully Abstract and Robust Compilation

This page was built for publication: Typed closure conversion preserves observational equivalence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178761)