{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:46:42Z","timestamp":1725468402160},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387973753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040262","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:01:43Z","timestamp":1155834103000},"page":"271-283","source":"Crossref","is-referenced-by-count":4,"title":["Equationally fully abstract models of PCF"],"prefix":"10.1007","author":[{"given":"Allen","family":"Stoughton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"G. Berry. Mod\u00e8les compl\u00e8tement ad\u00e9quats et stables des lambda-calculs typ\u00e9s. Th\u00e8se de Doctorat d'Etat, Universit\u00e9 Paris VII, 1979."},{"key":"11_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. Reynolds (editors), Algebraic Methods in Semantics, Cambridge University Press, 1985."},{"key":"11_CR3","unstructured":"P.-L. Curien. Categorical combinators, sequential algorithms and functional programming. Research Notes in Theoretical Computer Science, Pitman\/Wiley, 1986."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"A. Meyer and S. Cosmadakis. Semantical paradigms: notes for an invited lecture. Proc. 3rd LICS, 1988.","DOI":"10.21236\/ADA202995"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"R. Milner. Fully abstract models of typed \u03bb-calculi. Theoretical Computer Science 4, 1977.","DOI":"10.1016\/0304-3975(77)90053-6"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"G. Plotkin. LCF considered as a programming language. Theoretical Computer Science 5, 1977.","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"11_CR7","unstructured":"A. Stoughton. Fully Abstract Models of Programming Languages. Research Notes in Theoretical Computer Science, Pitman\/Wiley, 1988."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Semantics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040262.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:39:56Z","timestamp":1607549996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387973753"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0040262","relation":{},"subject":[]}}