{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:49Z","timestamp":1725566749664},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_9","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"103-118","source":"Crossref","is-referenced-by-count":4,"title":["Order Structures on B\u00f6hm-Like Models"],"prefix":"10.1007","author":[{"given":"Paula","family":"Severi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fer-Jan","family":"de Vries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam (1984) (revised edition)"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"M. Barr","year":"1999","unstructured":"Barr, M.: Terminal coalgebras for endofunctors on sets. Theoretical Computer Science\u00a0114(2), 299\u2013315 (1999)","journal-title":"Theoretical Computer Science"},{"key":"9_CR3","first-page":"339","volume-title":"Logic and algebra (Pontignano, 1994)","author":"A. Berarducci","year":"1996","unstructured":"Berarducci, A.: Infinite \u03bb-calculus and non-sensible models. In: Logic and algebra (Pontignano, 1994), Pontignano, pp. 339\u2013377. Dekker, New York (1996)"},{"issue":"1-2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0304-3975(98)00135-2","volume":"212","author":"A. Berarducci","year":"1999","unstructured":"Berarducci, A., Dezani-Ciancaglini, M.: Infinite \u03bb-calculus and types. Theoretical Computer Science\u00a0212(1-2), 29\u201375 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","volume":"72","author":"M. Coppo","year":"1987","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Zacchi, M.: Type theories, normal forms, and D\u221e-lambda-models. Information and Computation\u00a072(2), 85\u2013116 (1987)","journal-title":"Information and Computation"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(02)00809-5","volume":"298","author":"M. Dezani-Ciancaglini","year":"2003","unstructured":"Dezani-Ciancaglini, M., Severi, P., de Vries, F.J.: Infinitary lambda calculus and discrimination of Berarducci trees. Theoretical Computer Science\u00a0298(2), 275\u2013302 (2003)","journal-title":"Theoretical Computer Science"},{"key":"9_CR7","series-title":"Cambridge Tracts in Theoretical Computer Science","first-page":"668","volume-title":"Term Rewriting Systems","author":"J. Kennaway","year":"2003","unstructured":"Kennaway, J., de Vries, F.J.: Infinitary rewriting. In: Terese (ed.) Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055, pp. 668\u2013711. Cambridge University Press, Cambridge (2003)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-59200-8_62","volume-title":"Rewriting Techniques and Applications","author":"J.R. Kennaway","year":"1995","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: Infinite lambda calculus and B\u00f6hm models. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 257\u2013270. Springer, Heidelberg (1995)"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","volume":"175","author":"J.R. Kennaway","year":"1997","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: Infinitary lambda calculus. Theoretical Computer Science\u00a0175(1), 93\u2013125 (1997)","journal-title":"Theoretical Computer Science"},{"key":"9_CR10","first-page":"35","volume":"1","author":"J.R. Kennaway","year":"1999","unstructured":"Kennaway, J.R., van Oostrom, V., de Vries, F.J.: Meaningless terms in rewriting. J. Funct. Logic Programming\u00a01, 35 (1999)","journal-title":"J. Funct. Logic Programming"},{"key":"9_CR11","unstructured":"Klop, J.W.: Combinatory Reduction Systems. Mathematical centre tracts, vol.\u00a0127. Mathematisch Centrum (1980)"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1145\/772062.772067","volume":"4","author":"A. Salibra","year":"2003","unstructured":"Salibra, A.: Topological incompleteness and order incompleteness of the lambda calculus. ACM Transactions on Computational Logic\u00a04(3), 379\u2013401 (2003) (Special Issue LICS 2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45610-4_12","volume-title":"Rewriting Techniques and Applications","author":"P. Severi","year":"2002","unstructured":"Severi, P., de Vries, F.J.: An extensional B\u00f6hm model. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 159\u2013173. Springer, Heidelberg (2002)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/11417170_27","volume-title":"Typed Lambda Calculi and Applications","author":"P. Severi","year":"2005","unstructured":"Severi, P., de Vries, F.J.: Continuity and discontinuity in lambda calculus. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 369\u2013385. Springer, Heidelberg (2005)"},{"key":"9_CR15","unstructured":"Severi, P., Vries, F.J.d.: A Lambda Calculus for D\u221e. Technical report, University of Leicester (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:17:09Z","timestamp":1553152629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11538363_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}