General conditions for full abstraction

作者:Parrow Joachim*
来源:Mathematical Structures in Computer Science, 2016, 26(4): 655-657.
DOI:10.1017/S0960129514000280

摘要

Full abstraction, i.e. that a function preserves equivalence from a source to a target, has been used extensively as a correctness criterion for mappings between models of computation. I here show that with fixed equivalences, fully abstract functions almost always exist. Also, with the function and one of the equivalences fixed the other equivalence can almost always be found.

  • 出版日期2016-5