{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:49Z","timestamp":1725490249443},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_24","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T01:13:35Z","timestamp":1187918015000},"page":"298-312","source":"Crossref","is-referenced-by-count":17,"title":["Not Enough Points Is Enough"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Bucciarelli","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Ehrhard","sequence":"additional","affiliation":[]},{"given":"Giulio","family":"Manzonetto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation\u00a0163(2), 409\u2013470 (2000)","journal-title":"Information and Computation"},{"key":"24_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511983504","volume-title":"Domains and lambda-calculi","author":"R.M. Amadio","year":"1998","unstructured":"Amadio, R.M., Curien, P.-L.: Domains and lambda-calculi. Cambridge University Press, New York (1998)"},{"key":"24_CR3","volume-title":"Categories, types and structures","author":"A. Asperti","year":"1991","unstructured":"Asperti, A., Longo, G.: Categories, types and structures. In: Categories, types and structures, MIT Press, Cambridge (1991)"},{"key":"24_CR4","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":"24_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0304-3975(00)00057-8","volume":"249","author":"C. Berline","year":"2000","unstructured":"Berline, C.: From computation to foundations via functions and application: The \u03bb-calculus and its webbed models. Theoretical Computer Science\u00a0249, 81\u2013161 (2000)","journal-title":"Theoretical Computer Science"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1985","unstructured":"Berry, G., Curien, P.-L.: Sequential algorithms on concrete data structures. Theoretical Computer Science\u00a020, 265\u2013321 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"24_CR7","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":"24_CR8","volume-title":"Combinatory Logic","author":"H.B. Curry","year":"1958","unstructured":"Curry, H.B., Feys, R.: Combinatory Logic, vol.\u00a0I. North-Holland, Amsterdam (1958)"},{"issue":"5","key":"24_CR9","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1137\/S0097539794275860","volume":"27","author":"M. Dezani Ciancaglini","year":"1998","unstructured":"Dezani Ciancaglini, M., de\u2019Liguoro, U., Piperno, A.: A filter model for concurrent \u03bb-calculus. SIAM Journal of Computing\u00a027(5), 1376\u20131419 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"24_CR10","first-page":"149","volume":"109","author":"U. de\u2019Liguoro","year":"1955","unstructured":"de\u2019Liguoro, U., Piperno, A.: Non deterministic extensions of untyped \u03bb-calculus. Information and Computation\u00a0109, 149\u2013177 (1955)","journal-title":"Information and Computation"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48959-2_10","volume-title":"PREMO: A Framework for Multimedia Middleware","author":"P. Gianantonio Di","year":"1999","unstructured":"Di Gianantonio, P., Franco, G., Honsell, F.: Game semantics for untyped lambda calculus. In: Duke, D.J., Marshall, M.S., Herman, I. (eds.) PREMO: A Framework for Multimedia Middleware. LNCS, vol.\u00a01591, pp. 114\u2013128. Springer, Heidelberg (1999)"},{"key":"24_CR12","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":"24_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/malq.19800261902","volume":"26","author":"J.R. Hindley","year":"1980","unstructured":"Hindley, J.R., Longo, G.: Lambda calculus models and extensionality. Z. Math. Logik Grundlag. Math.\u00a026, 289\u2013310 (1980)","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","volume":"12","author":"M. Hyland","year":"1975","unstructured":"Hyland, M.: A syntactic characterization of the equality in some models for the lambda calculus. J. London Math. Soc.\u00a012(3), 361\u2013370 (1975)","journal-title":"J. London Math. Soc."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.entcs.2006.04.024","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. Electronic notes in theoretical computer science\u00a0161, 43\u201357 (2006)","journal-title":"Electronic notes in theoretical computer science"},{"key":"24_CR16","first-page":"285","volume":"163","author":"M. Hyland","year":"2000","unstructured":"Hyland, M., Ong, C.-H.L.: On full abstraction for PCF: I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Inf. and Comp.\u00a0163, 285\u2013408 (2000)","journal-title":"A fully abstract and universal game model. Inf. and Comp."},{"key":"24_CR17","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 Boehm tree lambda theory. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 405\u2013419. Springer, Heidelberg (1999)"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(00)00371-6","volume":"269","author":"R. Kerth","year":"2001","unstructured":"Kerth, R.: On the construction of stable models of \u03bb-calculus. Theoretical Computer Science\u00a0269, 23\u201346 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/S0019-9958(82)90796-3","volume":"52","author":"C.P.J. Koymans","year":"1982","unstructured":"Koymans, C.P.J.: Models of the lambda calculus. Information and Control\u00a052(3), 306\u2013332 (1982)","journal-title":"Information and Control"},{"key":"24_CR20","volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"J. Lambek","year":"1980","unstructured":"Lambek, J.: From lambda calculus to Cartesian closed categories. In: Seldin, J.P., Hindley, J. (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, London (1980)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Lambek, J., Scott, P.J.: Introduction to Higher Order Categorical Logic. The Journal of Symbolic Logic\u00a054(3) (1989)","DOI":"10.2307\/2274784"},{"issue":"2","key":"24_CR22","doi-asserted-by":"publisher","first-page":"313","DOI":"10.2307\/2272645","volume":"39","author":"G.D. Plotkin","year":"1974","unstructured":"Plotkin, G.D.: The \u03bb-calculus is \u03c9-incomplete. J. Symb. Log.\u00a039(2), 313\u2013317 (1974)","journal-title":"J. Symb. Log."},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(78)90006-5","volume":"17","author":"G.D. Plotkin","year":"1978","unstructured":"Plotkin, G.D.: T \u03c9 as a Universal Domain. J. Comput. System Sci.\u00a017, 209\u2013236 (1978)","journal-title":"J. Comput. System Sci."},{"key":"24_CR24","series-title":"LNM","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0073967","volume-title":"Toposes, Algebraic geometry and Logic","author":"D.S. Scott","year":"1972","unstructured":"Scott, D.S.: Continuous lattices. In: Toposes, Algebraic geometry and Logic. LNM, vol.\u00a0274, Springer, Heidelberg (1972)"},{"issue":"6","key":"24_CR25","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0956796801004294","volume":"12","author":"P. Selinger","year":"2002","unstructured":"Selinger, P.: The lambda calculus is algebraic. J. Funct. Program.\u00a012(6), 549\u2013566 (2002)","journal-title":"J. Funct. Program."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:45:49Z","timestamp":1619505949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}