{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:02:58Z","timestamp":1753354978321},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_49","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"574-586","source":"Crossref","is-referenced-by-count":8,"title":["A General Class of Models of $\\mathcal{H}^*$"],"prefix":"10.1007","author":[{"given":"Giulio","family":"Manzonetto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","series-title":"Cambridge Tracts in Theor. Comp. Sci.","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983504","volume-title":"Domains and lambda-calculi","author":"R. Amadio","year":"1998","unstructured":"Amadio, R., Curien, P.-L.: Domains and lambda-calculi. Cambridge Tracts in Theor. Comp. Sci., vol.\u00a046. Cambridge University Press, New York (1998)"},{"key":"49_CR2","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 Publishing Co., Amsterdam (1984)"},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"G. Berry","year":"1978","unstructured":"Berry, G.: Stable models of typed lambda-calculi. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol.\u00a062. Springer, Heidelberg (1978)"},{"issue":"3","key":"49_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0168-0072(00)00056-7","volume":"109","author":"A. Bucciarelli","year":"2001","unstructured":"Bucciarelli, A., Ehrhard, T.: On phase semantics and denotational semantics: the exponentials. Ann. Pure Appl. Logic\u00a0109(3), 205\u2013241 (2001)","journal-title":"Ann. Pure Appl. Logic"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Bucciarelli, A., Ehrhard, T.: Sequentiality and strong stability. In: LICS 1991, pp. 138\u2013145 (1991)","DOI":"10.1109\/LICS.1991.151638"},{"key":"49_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-74915-8_24","volume-title":"Computer Science Logic","author":"A. Bucciarelli","year":"2007","unstructured":"Bucciarelli, A., Ehrhard, T., Manzonetto, G.: Not enough points is enough. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 298\u2013312. Springer, Heidelberg (2007)"},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48959-2_10","volume-title":"Typed Lambda Calculi and Applications","author":"P. Gianantonio Di","year":"1999","unstructured":"Di Gianantonio, P., Franco, G., Honsell, F.: Game semantics for untyped \u03bb\u03b2 \u03b7-calculus. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol.\u00a01581, pp. 114\u2013128. Springer, Heidelberg (1999)"},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0168-0072(88)90025-5","volume":"37","author":"J.-Y. Girard","year":"1988","unstructured":"Girard, J.-Y.: Normal functors, power series and the \u03bb-calculus. Annals of pure and applied logic\u00a037, 129\u2013177 (1988)","journal-title":"Annals of pure and applied logic"},{"key":"49_CR9","unstructured":"Gouy, X.: Etude des th\u00e9ories \u00e9quationnelles et des propri\u00e9t\u00e9s alg\u00e9briques des mod\u00e8les stables du \u03bb-calcul. PhD Thesis, University of Paris\u00a07 (1995)"},{"issue":"3","key":"49_CR10","first-page":"361","volume":"12","author":"J.M.E. Hyland","year":"1975","unstructured":"Hyland, J.M.E.: A syntactic characterization of the equality in some models for the lambda calculus. J. London Math. Soc. (2)\u00a012(3), 361\u2013370 (1975)","journal-title":"J. London Math. Soc. (2)"},{"key":"49_CR11","first-page":"43","volume":"161","author":"M. Hyland","year":"2006","unstructured":"Hyland, M., Nagayama, M., Power, J., Rosolini, G.: A category theoretic formulation for Engeler-style models of the untyped \u03bb-calculus. ENTCS\u00a0161, 43\u201357 (2006)","journal-title":"ENTCS"},{"key":"49_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-48168-0_29","volume-title":"Computer Science Logic","author":"A.D. Ker","year":"1999","unstructured":"Ker, A.D., Nickau, H., Ong, C.-H.L.: A universal innocent game model for the B\u00f6hm tree lambda theory. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 405\u2013419. Springer, Heidelberg (1999)"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Salibra, A.: A continuum of theories of lambda calculus without semantics. In: Proc. LICS 2001, pp. 334\u2013343 (2001)","DOI":"10.1109\/LICS.2001.932509"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Scott, D.S.: Continuous lattices. Toposes, algebraic geometry and logic, Berlin (1972)","DOI":"10.1007\/BFb0073967"},{"issue":"3","key":"49_CR15","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/0205036","volume":"5","author":"C.P. Wadsworth","year":"1976","unstructured":"Wadsworth, C.P.: The relation between computational and denotational properties for Scott\u2019s D \u2009\u221e\u2009-models of the lambda-calculus. SIAM J. Comp.\u00a05(3), 488\u2013521 (1976)","journal-title":"SIAM J. Comp."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:34:05Z","timestamp":1558492445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}