Typed closure conversion preserves observational equivalence

DOI10.1145/1411204.1411227zbMath1323.68350DBLPconf/icfp/AhmedB08OpenAlexW4242150334WikidataQ60142692 ScholiaQ60142692MaRDI QIDQ5178761

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

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)

Related Items (4)

Parametric Polymorphism — Universally ⋮ Universal properties for universal types in bifibrational parametricity ⋮ Unnamed Item ⋮ Observational program calculi and the correctness of translations

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