Fully abstract compilation via universal embedding

DOI10.1145/2951913.2951941zbMath1361.68044OpenAlexW2514838807MaRDI QIDQ2982006

Amal Ahmed, Max New, William J. Bowman

Publication date: 10 May 2017

Published in: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

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

zbMATH Keywords

universal embeddinglogical relationsparametricityuniversal domainsecure compilationfully abstract compilationback-translation polymorphismmulti-language semantics

Mathematics Subject Classification ID

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

Related Items (2)

Linear capabilities for fully abstract compilation of separation-logic-verified code ⋮ StkTokens: Enforcing well-bracketed control flow and stack encapsulation using linear capabilities

This page was built for publication: Fully abstract compilation via universal embedding