{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T02:19:12Z","timestamp":1772158752752,"version":"3.50.1"},"reference-count":2,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T00:00:00Z","timestamp":1415577600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2016,5]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1017\/s0960129514000280","type":"journal-article","created":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T12:05:06Z","timestamp":1415621106000},"page":"655-657","source":"Crossref","is-referenced-by-count":19,"title":["General conditions for full abstraction"],"prefix":"10.1017","volume":"26","author":[{"given":"JOACHIM","family":"PARROW","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,11,10]]},"reference":[{"key":"S0960129514000280_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68679-8_29"},{"key":"S0960129514000280_ref2","doi-asserted-by":"crossref","unstructured":"Gorla D. and Nestmann U. (2014) Full abstraction for expressiveness: History, myths and facts. In this issue of Mathematical Structures in Computer Scinece.","DOI":"10.1017\/S0960129514000279"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129514000280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T05:40:29Z","timestamp":1566020429000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129514000280\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,10]]},"references-count":2,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["S0960129514000280"],"URL":"https:\/\/doi.org\/10.1017\/s0960129514000280","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,10]]}}}