{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:58Z","timestamp":1725490258637},"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_22","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"268-282","source":"Crossref","is-referenced-by-count":4,"title":["Lambda Theories of Effective Lambda Models"],"prefix":"10.1007","author":[{"given":"Chantal","family":"Berline","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulio","family":"Manzonetto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonino","family":"Salibra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_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 Publishing, Amsterdam (1984)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0168-0072(99)00015-9","volume":"100","author":"O. Bastonero","year":"1999","unstructured":"Bastonero, O., Gouy, X.: Strong stability and the incompleteness of stable models of \u03bb-calculus. Annals of Pure and Applied Logic\u00a0100, 247\u2013277 (1999)","journal-title":"Annals of Pure and Applied Logic"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1017\/S0960129502003778","volume":"12","author":"S. Berardi","year":"2002","unstructured":"Berardi, S., Berline, C.: \u03b2\u03b7-complete models for system F. Mathematical Structure in Computer Science\u00a012, 823\u2013874 (2002)","journal-title":"Mathematical Structure in Computer Science"},{"key":"22_CR4","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":"22_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1017\/S0960129506005123","volume":"16","author":"C. Berline","year":"2006","unstructured":"Berline, C.: Graph models of \u03bb-calculus at work, and variations. Math. Struct. in Comp. Science\u00a016, 185\u2013221 (2006)","journal-title":"Math. Struct. in Comp. Science"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2005.11.005","volume":"354","author":"C. Berline","year":"2006","unstructured":"Berline, C., Salibra, A.: Easiness in graph models. Theoretical Computer Science\u00a0354, 4\u201323 (2006)","journal-title":"Theoretical Computer Science"},{"key":"22_CR7","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.) Automata, Languages and Programming. LNCS, vol.\u00a062, Springer, Heidelberg (1978)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/LICS.1991.151638","volume-title":"Sixth Annual IEEE Symposium on Logic in Computer Science (LICS 1991)","author":"A. Bucciarelli","year":"1991","unstructured":"Bucciarelli, A., Ehrhard, T.: Sequentiality and strong stability. In: Sixth Annual IEEE Symposium on Logic in Computer Science (LICS 1991), pp. 138\u2013145. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/978-3-540-45138-9_24","volume-title":"Mathematical Foundations of Computer Science 2003","author":"A. Bucciarelli","year":"2003","unstructured":"Bucciarelli, A., Salibra, A.: The minimal graph model of lambda calculus. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 300\u2013307. Springer, Heidelberg (2003)"},{"key":"22_CR10","volume-title":"19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004)","author":"A. Bucciarelli","year":"2004","unstructured":"Bucciarelli, A., Salibra, A.: The sensible graph theories of lambda calculus. In: 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Bucciarelli, A., Salibra, A.: Graph lambda theories. Mathematical Structures in Computer Science (to appear)","DOI":"10.1017\/S0960129508006683"},{"key":"22_CR12","first-page":"126","volume":"2","author":"P. Gianantonio Di","year":"1995","unstructured":"Di Gianantonio, P., Honsell, F., Plotkin, G.D.: Uncountable limits and the lambda calculus. Nordic J. Comput.\u00a02, 126\u2013145 (1995)","journal-title":"Nordic J. Comput."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S0019-9958(84)80009-1","volume":"62","author":"P. Giannini","year":"1984","unstructured":"Giannini, P., Longo, G.: Effectively given domains and lambda-calculus models. Information and Control\u00a062, 36\u201363 (1984)","journal-title":"Information and Control"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1006\/inco.1996.0002","volume":"124","author":"A. Gruchalski","year":"1996","unstructured":"Gruchalski, A.: Computability on dI-Domains. Information and Computation\u00a0124, 7\u201319 (1996)","journal-title":"Information and Computation"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","volume":"45","author":"F. Honsell","year":"1992","unstructured":"Honsell, F., Ronchi della Rocca, S.: An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. Journal of Computer and System Sciences\u00a045, 49\u201375 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1023\/A:1005018121791","volume":"61","author":"R. Kerth","year":"1998","unstructured":"Kerth, R.: Isomorphism and equational equivalence of continuous lambda models. Studia Logica\u00a061, 403\u2013415 (1998)","journal-title":"Studia Logica"},{"key":"22_CR17","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"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","volume":"24","author":"G. Longo","year":"1983","unstructured":"Longo, G.: Set-theoretical models of \u03bb-calculus: theories, expansions and isomorphisms. Ann. Pure Applied Logic\u00a024, 153\u2013188 (1983)","journal-title":"Ann. Pure Applied Logic"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0304-3975(93)90094-A","volume":"121","author":"G.D. Plotkin","year":"1993","unstructured":"Plotkin, G.D.: Set-theoretical and other elementary models of the \u03bb-calculus. Theoretical Computer Science\u00a0121, 351\u2013409 (1993)","journal-title":"Theoretical Computer Science"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1109\/LICS.2001.932509","volume-title":"16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001)","author":"A. Salibra","year":"2001","unstructured":"Salibra, A.: A continuum of theories of lambda calculus without semantics. In: 16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001), pp. 334\u2013343. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"22_CR21","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, 379\u2013401 (2003)","journal-title":"ACM Transactions on Computational Logic"},{"key":"22_CR22","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)"},{"key":"22_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(02)00038-5","volume":"309","author":"P. Selinger","year":"2003","unstructured":"Selinger, P.: Order-incompleteness and finite lambda reduction models. Theoretical Computer Science\u00a0309, 43\u201363 (2003)","journal-title":"Theoretical Computer Science"},{"key":"22_CR24","volume-title":"Cambridge Tracts in Theoretical Computer Science","author":"V. Stoltenberg-Hansen","year":"1994","unstructured":"Stoltenberg-Hansen, V., Lindstr\u00f6m, I., Griffor, E.R.: Mathematical theory of domains. In: Cambridge Tracts in Theoretical Computer Science, vol.\u00a022, Cambridge University Press, Cambridge (1994)"},{"key":"22_CR25","first-page":"259","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism","author":"A. Visser","year":"1980","unstructured":"Visser, A.: Numerations, \u03bb-calculus and arithmetic. In: Hindley, J.R., Seldin, J.P. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, pp. 259\u2013284. Academic Press, New York (1980)"}],"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_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:48Z","timestamp":1619520348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}