{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:15:44Z","timestamp":1725459344218},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565178"},{"type":"electronic","value":"9783540475866"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/bfb0037109","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:21:36Z","timestamp":1138184496000},"page":"230-244","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Studying the fully abstract model of PCF within its continuous function model"],"prefix":"10.1007","author":[{"given":"Achim","family":"Jung","sequence":"first","affiliation":[]},{"given":"Allen","family":"Stoughton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,28]]},"reference":[{"key":"16_CR1","unstructured":"S. Abramsky. The lazy lambda calculus. In D. L. Turner, editor, Research Topics in Functional Programming, pages 65\u2013116. Addison-Wesley, 1990."},{"key":"16_CR2","unstructured":"G. Berry, P.-L. Curien and J.-J. L\u00e9vy. Full abstraction for sequential languages: the state of the art. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, pages 89\u2013132. Cambridge University Press, 1985."},{"key":"16_CR3","unstructured":"P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science. Pitman\/Wiley, 1986."},{"key":"16_CR4","unstructured":"A. Jung and J. Tiuryn. A new characterization of lambda definability. In this proceedings, 1993."},{"key":"16_CR5","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":"16_CR6","unstructured":"K. Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, 1987."},{"key":"16_CR7","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\u2013256, 1977.","journal-title":"Theoretical Computer Science"},{"key":"16_CR8","unstructured":"G.D. Plotkin. Lambda-definability in the full type hierarchy. In J. Seldin and J. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 363\u2013374. Academic Press, 1980."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"K. Sieber. Reasoning about sequential functions via logical relations. In M. P. Fourman, P. T. Johnstone and A. M. Pitts, editors, Applications of Categories in Computer Science, volume 177 of LMS Lecture Note Series, pages 258\u2013269. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511525902.015"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.2307\/2273377","volume":"47","author":"R. Statman","year":"1982","unstructured":"R. Statman. Completeness, invariance and \u03bb-definability. Journal of Symbolic Logic, 47:17\u201326, 1982.","journal-title":"Journal of Symbolic Logic"},{"key":"16_CR11","unstructured":"A. Stoughton. Fully Abstract Models of Programming Languages. Research Notes in Theoretical Computer Science. Pitman\/Wiley, 1988."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"A. Stoughton. Equationally fully abstract models of PCF. In M. Main, A. Melton, M. Mislove and D. Schmidt, editors, Fifth International Conference on the Mathematical Foundations of Programming Semantics, volume 442 of Lecture Notes in Computer Science, pages 271\u2013283. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0040262"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:08:57Z","timestamp":1558256937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565178","9783540475866"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0037109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"28 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}