{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:06Z","timestamp":1725664026977},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578802"},{"type":"electronic","value":"9783540483762"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57880-3_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:36:56Z","timestamp":1330263416000},"page":"454-468","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fully abstract translations and parametric polymorphism"],"prefix":"10.1007","author":[{"given":"Peter W.","family":"O'Hearn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon G.","family":"Riecke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"30_CR1","unstructured":"S. Abramsky, R. Jagadeesan, and P. Malacaria. Games and full abstraction for PCF: preliminary announcement. Unpublished, 1993."},{"issue":"10","key":"30_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(90)90151-7","volume":"70","author":"S. Bainbridge","year":"1990","unstructured":"S. Bainbridge, P. J. Freyd, A. Scedrov, and P. J. Scott. Functorial polymorphism. Theoretical Computer Science, 70(10):35\u201364, 1990. Corrigendum in 71(3):431, 1990.","journal-title":"Theoretical Computer Science"},{"key":"30_CR3","first-page":"346","volume-title":"Extensional PERs","author":"P. J. Freyd","year":"1990","unstructured":"P. J. Freyd, P. Mulry, G. Rosolini, and D. S. Scott. Extensional PERs. In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 346\u2013354, Philadelphia, PA, 1990. IEEE Computer Society Press, Los Alamitos, California."},{"key":"30_CR4","first-page":"444","volume-title":"Functorial parametricity","author":"P. J. Freyd","year":"1992","unstructured":"P. J. Freyd, E. P. Robinson, and G. Rosolini. Functorial parametricity. In Proceedings, 7th Annual IEEE Symposium on Logic in Computer Science, pages 444\u2013452, Santa Cruz, California, 1992. IEEE Computer Society Press, Los Alamitos, California."},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/169701.169696","volume":"15","author":"R. Harper","year":"1993","unstructured":"R. Harper and J. C. Mitchell. On the type structure of standard ML. ACM Trans. Programming Languages and Systems, 15:211\u2013252, 1993.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"A. Jung and J. Tiuryn. A new characterization of lambda definability. In Typed Lambda Calculi and Applications, volume 664 of Lect. Notes in Computer Sci., pages 245\u2013257. Springer-Verlag, 1993.","DOI":"10.1007\/BFb0037110"},{"key":"30_CR7","unstructured":"A. F. Lent. The category of functors from state shapes to bottomless CPOs is adequate for block structure. Master's thesis, Massachusetts Institute of Technology, 1992."},{"key":"30_CR8","series-title":"volume 598 of Lecture Notes in Computer Science","first-page":"1","volume-title":"Mathematical Foundations of Programming Semantics","author":"Q. Ma","year":"1992","unstructured":"Q. Ma and J. C. Reynolds. Types, abstraction, and parametric polymorphism, part 2. In S. Brookes et al., editors, Mathematical Foundations of Programming Semantics, volume 598 of Lecture Notes in Computer Science, pages 1\u201340. Springer-Verlag, Berlin, 1992. Proceedings of the 1991 Conference."},{"key":"30_CR9","first-page":"191","volume-title":"Towards fully abstract semantics for local variables: preliminary report","author":"A. R. Meyer","year":"1988","unstructured":"A. R. Meyer and K. Sieber. Towards fully abstract semantics for local variables: preliminary report. In Conf. Record 15th ACM Symp. on Principles of Programming Languages, pages 191\u2013203. ACM, New York, 1988."},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner. Fully abstract models of typed \u03bb-calculi. Theoretical Computer Science, 4:1\u201322, 1977.","journal-title":"Theoretical Computer Science"},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A theory of type polymorphism in programming. J. of Computer and System Sciences, 17:348\u201375, 1978.","journal-title":"J. of Computer and System Sciences"},{"key":"30_CR12","first-page":"28","volume-title":"The essence of Ml","author":"J. C. Mitchell","year":"1988","unstructured":"J. C. Mitchell and R. Harper. The essence of Ml. In Conf. Record 15th ACM Symp. on Principles of Programming Languages, pages 28\u201346. ACM, New York, 1988."},{"key":"30_CR13","series-title":"volume 177 of London Mathematical Society Lecture Note Series","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1017\/CBO9780511525902.013","volume-title":"Applications of Categories in Computer Science","author":"P. W. O'Hearn","year":"1992","unstructured":"P. W. O'Hearn and R. D. Tennent. Semantics of local variables. In M. P. Fourman, P. T. Johnstone, and A. M. Pitts, editors, Applications of Categories in Computer Science, volume 177 of London Mathematical Society Lecture Note Series, pages 217\u2013238. Cambridge University Press, Cambridge, England, 1992."},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"P. W. O'Hearn and R. D. Tennent. Parametricity and local variables. Technical Report SU-CIS-93-30, Syracuse University, 1993. Preliminary version appeared in Conf. Record 20th ACM Symp. on Principles of Programming Languages, pages 171\u2013184, Charleston, South Carolina, 1993. ACM, New York.","DOI":"10.1145\/158511.158624"},{"key":"30_CR15","volume-title":"Ph.D. thesis","author":"F. J. Oles","year":"1982","unstructured":"F. J. Oles. A Category-Theoretic Approach to the Semantics of Programming Languages. Ph.D. thesis, Syracuse University, Syracuse, N.Y., 1982."},{"key":"30_CR16","unstructured":"L. Ong and M. Hyland. Dialogue games and innocent strategies: An approach to intensional full abstraction to PCF (preliminary announcement). Unpublished, 1993."},{"key":"30_CR17","first-page":"366","volume-title":"Effective domains and intrinsic structure","author":"W. K. Phoa","year":"1990","unstructured":"W. K. Phoa. Effective domains and intrinsic structure. In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 366\u2013379, Philadelphia, PA, 1990. IEEE Computer Society Press, Los Alamitos, California."},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"A. Pitts and I. Stark. On the observable properties of higher-order functions that dynamically create local names (preliminary report). In ACM SIGLPLAN Workshop on State in Programming Languages, pages 31\u201345, 1993. Available as Yale Technical Report YALEU\/DCS\/RR-968.","DOI":"10.1007\/3-540-57182-5_8"},{"key":"30_CR19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. D. Plotkin","year":"1977","unstructured":"G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223\u2013255, 1977.","journal-title":"Theoretical Computer Science"},{"key":"30_CR20","unstructured":"U.S. Reddy. Global states considered unnecessary. In ACM SIGLPLAN Workshop on State in Programming Languages, 1993. Available as Yale Technical Report YALEU\/DCS\/RR-968."},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"J. H. Reppy. CML: A higher-order concurrent language. In Proceedings of the SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 293\u2013305, June 1991.","DOI":"10.1145\/113446.113470"},{"key":"30_CR22","first-page":"408","volume-title":"volume 19 of Lecture Notes in Computer Science","author":"J. C. Reynolds","year":"1974","unstructured":"J. C. Reynolds. Towards a theory of type structure. In Proc. Colloque sur la Programmation, volume 19 of Lecture Notes in Computer Science, pages 408\u2013425, Berlin, 1974. Springer-Verlag."},{"key":"30_CR23","first-page":"345","volume-title":"Algorithmic Languages","author":"J. C. Reynolds","year":"1981","unstructured":"J. C. Reynolds. The essence of Algol. In J. W.de Bakker and J. C. van Vliet, editors, Algorithmic Languages, pages 345\u2013372. North-Holland, Amsterdam, 1981."},{"key":"30_CR24","first-page":"513","volume-title":"Information Processing 83","author":"J. C. Reynolds","year":"1983","unstructured":"J. C. Reynolds. Types, abstraction and parametric polymorphism. In R. E. A. Mason, editor, Information Processing 83, pages 513\u2013523. North Holland, Amsterdam, 1983."},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"J. G. Riecke. Fully abstract translations between functional languages. Mathematical Structures in Computer Science, 1993. To appear.","DOI":"10.1017\/S0960129500000293"},{"key":"30_CR26","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF01876321","volume":"15","author":"V. Sazonov","year":"1976","unstructured":"V. Sazonov. Expressibility of functions in D. Scott's LCF language. Algebra i Logika, 15:308\u2013330, 1976. Russian.","journal-title":"Algebra i Logika"},{"key":"30_CR27","unstructured":"K. Sieber. New steps towards full abstraction for local variables. In ACM SIGLPLAN Workshop on State in Programming Languages, pages 88\u2013100, 1993. Available as Yale Technical Report YALEU\/DCS\/RR-968."},{"key":"30_CR28","volume-title":"Fundamental Concepts in Programming Languages","author":"C. Strachey","year":"1967","unstructured":"C. Strachey. Fundamental Concepts in Programming Languages. Unpublished lecture notes, International Summer School in Computer Programming, Copenhagen, August 1967."},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"P. Wadler. Comprehending monads. In Proceedings of the ACM Conference on LISP and Functional Programming, pages 61\u201378, Nice, 1990.","DOI":"10.1145\/91556.91592"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems \u2014 ESOP '94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57880-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:50:35Z","timestamp":1640929835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57880-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578802","9783540483762"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-57880-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}