{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:28Z","timestamp":1725558628399},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_17","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:49:20Z","timestamp":1277686160000},"page":"202-215","source":"Crossref","is-referenced-by-count":2,"title":["Logical Semantics for the First Order \u03c2-Calculus"],"prefix":"10.1007","author":[{"given":"Steffen","family":"van Bakel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"de\u2019Liguoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8598-9","volume-title":"A Theory of Objects","author":"M. Abadi","year":"1996","unstructured":"Abadi, M., Cardelli, L.: A Theory of Objects. Springer, Heidelberg (1996)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Plotkin, G.D.: A Per Model of Polymorphism and Recursive Types. In: Proc. of IEEE-LICS, pp. 3355\u20133365 (1990)","DOI":"10.1109\/LICS.1990.113761"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"Abramsky, S.: Observation Equivalence and Testing Equivalence. Theoretical Computer Science\u00a053, 225\u2013241 (1987)","journal-title":"Theoretical Computer Science"},{"key":"17_CR4","first-page":"1","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"Abramsky, S.: Domain Theory in Logical Form. APAL\u00a051, 1\u201377 (1991)","journal-title":"APAL"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90074-C","volume":"91","author":"R. Amadio","year":"1991","unstructured":"Amadio, R.: Recursion over Realizability Structures. Info. Comp.\u00a091, 55\u201385 (1991); Theoretical Computer Science 102(1), 135\u2013163 (1992)","journal-title":"Info. Comp."},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0304-3975(95)00073-6","volume":"151","author":"S. Bakel van","year":"1995","unstructured":"van Bakel, S.: Intersection Type Assignment Systems. Theoretical Computer Science\u00a0151(2), 385\u2013435 (1995)","journal-title":"Theoretical Computer Science"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H.P. Barendregt","year":"1983","unstructured":"Barendregt, H.P., Coppo, M., Dezani, M.: A Filter Lambda Model and the Completeness of Type Assignment. JSL\u00a048, 931\u2013940 (1983)","journal-title":"JSL"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Bruce, K.B., Mitchell, J.C.: PER models of subtyping, recursive types and higher-order polymorphism. In: Proc. of ACM-POPL 1992 (1992)","DOI":"10.1145\/143165.143230"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BFb0035759","volume-title":"Automata, Languages and Programming","author":"F. Cardone","year":"1989","unstructured":"Cardone, F.: Relational semantics for recursive types and bounded quantification. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 164\u2013178. Springer, Heidelberg (1989)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/malq.19810270205","volume":"27","author":"M. Coppo","year":"1981","unstructured":"Coppo, M., Dezani, M., Venneri, B.: Functional characters of solvable terms. Grund. Der Math.\u00a027, 45\u201358 (1981)","journal-title":"Grund. Der Math."},{"key":"17_CR11","unstructured":"Dezani, M., Giovannetti, E., de\u2019 Liguoro, U.: Intersection types, \u03bb-models and B\u00f6hm trees. In: [19], pp. 45-97"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-45413-6_25","volume-title":"Typed Lambda Calculi and Applications","author":"U. de\u2019Liguoro","year":"2001","unstructured":"de\u2019Liguoro, U.: Characterizing convergent terms in object calculi via intersection types. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, p. 315. Springer, Heidelberg (2001)"},{"key":"17_CR13","series-title":"ENTCS","volume-title":"ITRS 2002","author":"U. de\u2019Liguoro","year":"2002","unstructured":"de\u2019Liguoro, U.: Subtyping in logical form. In: ITRS 2002. ENTCS, vol.\u00a070.1, Elsevier, Amsterdam (2002)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Kamin, S.: Inheritance in Smalltalk-80: a denotational definition. In: Proc. of POPL 1988, pp. 80\u201387 (1988)","DOI":"10.1145\/73560.73567"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. of ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"J. of ACM"},{"key":"17_CR16","unstructured":"Krivine, J.L.: Lambda-calcul, types et mod\u00e8les, Masson (1990)"},{"key":"17_CR17","volume-title":"Foundations for Programming Languages","author":"J.C. Mitchell","year":"1996","unstructured":"Mitchell, J.C.: Foundations for Programming Languages. MIT Press, Cambridge (1996)"},{"issue":"3","key":"17_CR18","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"Scott, D.: Data types as lattices. SIAM J. Comput.\u00a05(3), 522\u2013587 (1976)","journal-title":"SIAM J. Comput."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Takahashi, M., Okada, M., Dezani, M. (eds.): Theories of Types and Proofs. Mathematical Society of Japan, vol. 2 (1998)","DOI":"10.2969\/msjmemoirs\/002010000"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:17:50Z","timestamp":1552609070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}