Fully abstract compilation via universal embedding

New, Max S.; Bowman, William J.; Ahmed, Amal

doi:10.1145/3022670.2951941

Cited by 6 publications

(1 citation statement)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also build on multi-languages used for compiler correctness [2,20,22] which embed the source (higher-level) and target (lower-level) languages of a compiler, though none of that work considers interoperability with a language as low-level as assembly.…”

Section: Related Workmentioning

confidence: 99%

FunTAL: reasonably mixing a functional language with assembly

et al. 2017

Self Cite

View full text Add to dashboard Cite

We present FunTAL, the first multi-language system to formalize safe interoperability between a high-level functional language and low-level assembly code while supporting compositional reasoning about the mix. A central challenge in developing such a multi-language is bridging the gap between assembly, which is staged into jumps to continuations, and high-level code, where subterms return a result. We present a compositional stack-based typed assembly language that supports components, comprised of one or more basic blocks, that may be embedded in high-level contexts. We also present a logical relation for FunTAL that supports reasoning about equivalence of high-level components and their assembly replacements, mixed-language programs with callbacks between languages, and assembly components comprised of different numbers of basic blocks.

show abstract

Section: Related Workmentioning

confidence: 99%

FunTAL: reasonably mixing a functional language with assembly

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

Computation focusing

Rioux

Zdancewic

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Focusing is a technique from proof theory that exploits type information to prune inessential nondeterminism from proof search procedures. Viewed through the lens of the Curry-Howard correspondence, a focused typing derivation yields terms in normal form. This paper explores how to exploit focusing for reasoning about contextual equivalences and full abstraction. We present a focused polymorphic call-by-push-value calculus and prove a computational completeness result: for every well-typed term, there exists a focused term that is-equivalent to it. This completeness result yields a powerful way to refine the context lemmas for establishing contextual equivalences, cutting down the set that must be considered to just focused contexts. The paper demonstrates the application of focusing to establish program equivalences, including free theorems. It also uses focusing to prove full abstraction of a translation of the pure, total call-by-push-value language into a language with divergence and simple effect types, yielding a novel solution to a simple-to-state, but hitherto difficult to solve problem.

show abstract

Fully abstract from static to gradual

Jacobs

Timany

Devriese

2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

What is a good gradual language? Siek et al. have previously proposed the refined criteria, a set of formal ideas that characterize a range of guarantees typically expected from a gradual language. While these go a long way, they are mostly focused on syntactic and type safety properties and fail to characterize how richer semantic properties and reasoning principles that hold in the static language, like non-interference or parametricity for instance, should be upheld in the gradualization. In this paper, we investigate and argue for a new criterion previously hinted at by Devriese et al.: the embedding from the static to the gradual language should be fully abstract. Rather than preserving an arbitrarily chosen interpretation of source language types, this criterion requires that all source language equivalences are preserved. We demonstrate that the criterion weeds out erroneous gradualizations that nevertheless satisfy the refined criteria. At the same time, we demonstrate that the criterion is realistic by reporting on a mechanized proof that the property holds for a standard example: GTLC µ , the natural gradualization of STLC µ , the simply typed lambda-calculus with equirecursive types. We argue thus that the criterion is useful for understanding, evaluating, and guiding the design of gradual languages, particularly those which are intended to preserve source language guarantees in a rich way.

show abstract

Fully abstract compilation via universal embedding

Cited by 6 publications

References 49 publications

FunTAL: reasonably mixing a functional language with assembly

FunTAL: reasonably mixing a functional language with assembly

Computation focusing

Fully abstract from static to gradual

Contact Info

Product

Resources

About