{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:18Z","timestamp":1725558498614},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_24","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T22:41:48Z","timestamp":1277246508000},"page":"300-307","source":"Crossref","is-referenced-by-count":6,"title":["The Minimal Graph Model of Lambda Calculus"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Bucciarelli","sequence":"first","affiliation":[]},{"given":"Antonino","family":"Salibra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"Abramsky, S.: Domain theory in logical form. Annals of Pure and Applied Logic\u00a051, 1\u201377 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45446-2_2","volume-title":"Theoretical Computer Science","author":"F. Alessi","year":"2001","unstructured":"Alessi, F., Dezani, M., Honsell, F.: Filter models and easy terms. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol.\u00a02202, pp. 17\u201337. Springer, Heidelberg (2001)"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S1385-7258(79)80006-2","volume":"41","author":"J. Baeten","year":"1979","unstructured":"Baeten, J., Boerboom, B.: Omega can be anything it should not be. Indag. Mathematicae\u00a041, 111\u2013120 (1979)","journal-title":"Indag. Mathematicae"},{"key":"24_CR4","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The lambda calculus: Its syntax and semantics. In: Studies in Logic and the Foundations of Mathematics, Revised edn., vol.\u00a0103, North-Holland Publishing Co., Amsterdam (1984)"},{"key":"24_CR5","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. J. Symbolic Logic\u00a048, 931\u2013940 (1983)","journal-title":"J. Symbolic Logic"},{"key":"24_CR6","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":"24_CR7","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_CR8","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)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Bucciarelli, A., Ehrhard, T.: Sequentiality and strong stability. In: Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 138\u2013145 (1991)","DOI":"10.1109\/LICS.1991.151638"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21","author":"M. Coppo","year":"1980","unstructured":"Coppo, M., Dezani, M.: An extension of the basic functionality theory for the \u03bb-calculus. Notre Dame J. Formal Logic\u00a021, 685\u2013693 (1980)","journal-title":"Notre Dame J. Formal Logic"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/BFb0037102","volume-title":"Typed lambda calculi and applications","author":"P. Gianantonio Di","year":"1993","unstructured":"Di Gianantonio, P., Honsell, F.: An abstract notion of application. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 124\u2013138. Springer, Heidelberg (1993)"},{"key":"24_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":"24_CR13","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 \u03bb-models and the topological incompleteness of \u03bb-calculus. Journal Computer and System Science\u00a045, 49\u201375 (1992)","journal-title":"Journal Computer and System Science"},{"key":"24_CR14","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":"24_CR15","doi-asserted-by":"crossref","unstructured":"Kerth, R.: On the construction of stable models of \u03bb-calculus. Theoretical Computer Science\u00a0269 (2001)","DOI":"10.1016\/S0304-3975(00)00371-6"},{"key":"24_CR16","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":"24_CR17","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":"24_CR18","doi-asserted-by":"crossref","unstructured":"Salibra, A.: Topological incompleteness and order incompleteness of the lambda calculus. ACM Transactions on Computational Logic (2003)","DOI":"10.1145\/772062.772067"},{"key":"24_CR19","series-title":"LNM","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0073967","volume-title":"Toposes, Algebraic geometry and Logic","author":"D.S. Scott","year":"1972","unstructured":"Scott, D.S.: Continuous lattices. In: Lawvere, F.W. (ed.) Toposes, Algebraic geometry and Logic. LNM, vol.\u00a0274, pp. 97\u2013136. Springer, Heidelberg (1972)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T19:08:32Z","timestamp":1548443312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}