{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:57Z","timestamp":1725493497587},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403326"},{"type":"electronic","value":"9783540449041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44904-3_6","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T01:49:32Z","timestamp":1193536172000},"page":"75-89","source":"Crossref","is-referenced-by-count":1,"title":["Relative Definability and Models of Unary PCF"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Bucciarelli","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Leperchey","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Padovani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(96)00234-4","volume":"177","author":"A. Bucciarelli","year":"1997","unstructured":"A. Bucciarelli. Degrees of Parallelism in the Continuous Type Hierarchy. Theoretical Computer Science 177:59\u201371, 1997.","journal-title":"Theoretical Computer Science"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/inco.1998.2781","volume":"152","author":"T. Ehrhard","year":"1999","unstructured":"T. Ehrhard. A Relative Definability Result for Strongly Stable Functions and Some Corollaries. Information and Computation, Academic Press, 152:111\u2013137, 1999.","journal-title":"Information and Computation"},{"key":"6_CR3","unstructured":"T. Joly Encoding of the halting problem into the Monster type and applications. This volume."},{"key":"6_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Typed Lambda-Calculi and Applications","author":"A. Jung","year":"1993","unstructured":"A. Jung, A. Stoughton. Studying the Fully Abstract Model of PCF Within its Continuous Function Model. in Typed Lambda-Calculi and Applications, Eds. M. Bezem and J.F. Groote, LNCS 664, Springer, 1993."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"J. Laird. A Fully Abstract Bidomain Model of Unary FPC. Unpublished notes, available at www.cogs.susx.ac.uk\/users\/jiml. 2002.","DOI":"10.1007\/3-540-44904-3_15"},{"key":"6_CR6","unstructured":"J. Laird. Personal communication. 2002."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"R. Loader. The undecidability of lambda-definability. in Logic, Meaning and Computation, Essays in Memory of Alonzo Church, Kluwer Academic Publishers, 2001.","DOI":"10.1007\/978-94-010-0526-5_15"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"R. Loader. Unary PCF is decidable. Theoretical Computer Science 206, 1998.","DOI":"10.1016\/S0304-3975(98)00048-6"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"R. Loader. Finitary PCF is not decidable. Theoretical Computer Science 266, 2001.","DOI":"10.1016\/S0304-3975(00)00194-8"},{"key":"6_CR10","unstructured":"J. Longley. The sequentially realizable functionals. To appear in Annals of Pure and Applied Logic."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"J. Longley. When is a functional program not a functional program? Proceedings of Fourth ACM SIGPLAN International Conference on Functional Programming, Paris, September 1999. ACM Press.","DOI":"10.1145\/317636.317775"},{"key":"6_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Types for Proofs and Programs","author":"V. Padovani","year":"1996","unstructured":"V. Padovani. Decidability of all minimal models. in M. Coppo and S. Berardi eds, Types for Proofs and Programs, LNCS 1158, Springer 1996."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"G. Plotkin. LCF considerer as a programming language. Theoretical Computer Science 5, 1977.","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"K. Sieber. Reasoning about Sequential Functions via Logical Relations. Proc. LMS Symposium on Applications of Categories in Computer Science, M. Fourman, P. Johnstone, A. Pitts eds, LMS Lecture Note Series 177, Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511525902.015"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0304-3975(98)00024-3","volume":"216","author":"M. Schmidt-Schauss","year":"1999","unstructured":"M. Schmidt-Schauss. Decidability of Behavioral Equivalence in Unary PCF. Theoretical Computer Science 216:363\u2013373, 1999.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44904-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:27:26Z","timestamp":1556922446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44904-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403326","9783540449041"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44904-3_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}