{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:01:02Z","timestamp":1725897662853},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315848"},{"type":"electronic","value":"9783642315855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_34","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T11:56:29Z","timestamp":1340452589000},"page":"364-376","source":"Crossref","is-referenced-by-count":6,"title":["Loader and Urzyczyn Are Logically Related"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Salvati","sequence":"first","affiliation":[]},{"given":"Giulio","family":"Manzonetto","sequence":"additional","affiliation":[]},{"given":"Mai","family":"Gehrke","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Barendregt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Abramsky, S.: Domain theory in logical form. In: Symposium on Logic and Computer Science (LICS 1987), pp. 47\u201353. IEEE Computer Science Press (1987)","key":"34_CR1"},{"doi-asserted-by":"crossref","unstructured":"Amadio, R., Curien, P.-L.: Domains and lambda-calculi. Cambridge Tracts in Theoretical Computer Science, vol.\u00a0(46). Cambridge University Press (1998)","key":"34_CR2","DOI":"10.1017\/CBO9780511983504"},{"unstructured":"Barendregt, H.P., Dekkers, W., Statman, R.: Lambda calculus with types (to appear), Draft available at http:\/\/www.cs.ru.nl\/~henk\/book.pdf","key":"34_CR3"},{"issue":"2-6","key":"34_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/malq.19810270205","volume":"27","author":"M. Coppo","year":"1981","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Venneri, B.: Functional characters of solvable terms. Mathematical Logic Quarterly\u00a027(2-6), 45\u201358 (1981)","journal-title":"Mathematical Logic Quarterly"},{"key":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-44904-3_11","volume-title":"Typed Lambda Calculi and Applications","author":"T. Joly","year":"2003","unstructured":"Joly, T.: Encoding of the Halting Problem into the Monster Type & Applications. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 153\u2013166. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Loader, R.: The undecidability of lambda definability. In: Logic, Meaning and Computation: Essays in Memory of Alonzo Church, pp. 331\u2013342 (2001)","key":"34_CR6","DOI":"10.1007\/978-94-010-0526-5_15"},{"unstructured":"Plotkin, G.: Lambda definability and logical relations. Memorandum SAI-RM-4, School of Artificial Intelligence. University of Edinburgh (1973)","key":"34_CR7"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-02261-6_5","volume-title":"Logic, Language, Information and Computation","author":"S. Salvati","year":"2009","unstructured":"Salvati, S.: Recognizability in the Simply Typed Lambda-Calculus. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol.\u00a05514, pp. 48\u201360. Springer, Heidelberg (2009)"},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.2307\/2273377","volume":"47","author":"R. Statman","year":"1982","unstructured":"Statman, R.: Completeness, invariance and \u03bb-definability. The Journal of Symbolic Logic\u00a047(1), 17\u201326 (1982)","journal-title":"The Journal of Symbolic Logic"},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.2307\/2586625","volume":"64","author":"P. Urzyczyn","year":"1999","unstructured":"Urzyczyn, P.: The emptiness problem for intersection types. The Journal of Symbolic Logic\u00a064(3), 1195\u20131215 (1999)","journal-title":"The Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:08:31Z","timestamp":1606187311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}