{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:26:05Z","timestamp":1729657565623,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/lics.2004.1319622","type":"proceedings-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T19:14:14Z","timestamp":1100286854000},"page":"276-285","source":"Crossref","is-referenced-by-count":2,"title":["The sensible graph theories of lambda calculus"],"prefix":"10.1109","author":[{"given":"A.","family":"Bucciarelli","sequence":"first","affiliation":[]},{"given":"A.","family":"Salibra","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00371-6"},{"journal-title":"Isomorphisme et E?quivalence E?quationnelle Entre Mode?les du ?-Calcul","year":"1995","author":"kerth","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005018121791"},{"journal-title":"Etude des The?ories E?quationnelles et des Proprie?te?s Alge?briques des Mode?les Stables du ?-Calcul","year":"1995","author":"gouy","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90040-P"},{"key":"13","first-page":"124","article-title":"An abstract notion of application, Typed lambda calculi and applications","volume":"664","author":"di gianantonio","year":"1993","journal-title":"LNCS"},{"key":"14","first-page":"126","article-title":"Uncountable limits and the lambda calculus","volume":"2","author":"di gianantonio","year":"1995","journal-title":"Nordic J Comput"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093883253"},{"key":"12","first-page":"53","article-title":"Computing with Bo?hm trees","volume":"45","author":"david","year":"2001","journal-title":"Fundamenta Informaticae"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90094-A"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(83)90030-1"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2001.932509"},{"key":"23","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/772062.772067","article-title":"Topological incompleteness and order incompleteness of the lambda calculus. (LICS'01 Special Issue)","volume":"4","author":"salibra","year":"2003","journal-title":"ACM Transactions on Computational Logic"},{"key":"24","article-title":"Continuous lattices","author":"scott","year":"1972","journal-title":"Toposes Algebraic Geometry and Logic"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00038-5"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(79)90016-7"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45446-2_2"},{"key":"10","article-title":"The minimal graph model of lambda calculus. 28th","author":"bucciarelli","year":"2003","journal-title":"International Symposium on Mathematical Foundations of Computer Science"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90065-T"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00057-8"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(99)00015-9"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.2307\/2273659"},{"journal-title":"The Lambda Calculus Its Syntax and Semantics","year":"1984","author":"barendregt","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1991.151638"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-08860-1_7","article-title":"Stable models of typed lambda-calculi","author":"berry","year":"1978","journal-title":"Proc 5th Int Coll on Automata Languages and Programming"}],"event":{"name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","start":{"date-parts":[[2004,7,17]]},"location":"Turku, Finland","end":{"date-parts":[[2004,7,17]]}},"container-title":["Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9221\/29239\/01319622.pdf?arnumber=1319622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T05:26:58Z","timestamp":1545370018000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1319622\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/lics.2004.1319622","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}