{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:14Z","timestamp":1772163974493,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T00:00:00Z","timestamp":1199664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,1,7]]},"DOI":"10.1145\/1328438.1328455","type":"proceedings-article","created":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T09:45:40Z","timestamp":1199699140000},"page":"113-119","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["The intensional content of Rice's theorem"],"prefix":"10.1145","author":[{"given":"Andrea","family":"Asperti","sequence":"first","affiliation":[{"name":"University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,1,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1227143.1227146"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/648334.755720"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/504077.504081"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321395"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/321637.321648"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"E. B\u00f6rger. Berechenbarkeit Komplexit\u00e4t Logik. Friedr. Vieweg & Sohn Braunshweig 1986.  E. B\u00f6rger. Berechenbarkeit Komplexit\u00e4t Logik. Friedr. Vieweg & Sohn Braunshweig 1986.","DOI":"10.1007\/978-3-663-14213-3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/321679.321691"},{"key":"e_1_3_2_1_8_1","volume-title":"Computability: An Introduction to Recursive Function Theory","author":"Cutland N. J.","year":"1986","unstructured":"N. J. Cutland . Computability: An Introduction to Recursive Function Theory . Cambridge University Press , Cambridge, UK , 1986 . N. J. Cutland. Computability: An Introduction to Recursive Function Theory. Cambridge University Press, Cambridge, UK, 1986."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129506005421"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1958-0097310-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90019-C"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-51237-3_11","volume-title":"Logic at Botik","author":"Hansen T.A.","year":"1989","unstructured":"T.A. Hansen , T. Nikolajsen , J.L. Tr\u00e4ff , and N.D. Jones . Experiments with implementations of two theoretical constructions . In Logic at Botik , volume 363 , pages 119 -- 133 , 1989 . T.A. Hansen, T. Nikolajsen, J.L. Tr\u00e4ff, and N.D. Jones. Experiments with implementations of two theoretical constructions. In Logic at Botik, volume 363, pages 119--133, 1989."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0170805-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167244"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90017-1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321702"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800161.805145"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19750210121"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19760220150"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19770231302"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/800169.805423"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19550010407"},{"key":"e_1_3_2_1_23_1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical Recursion Theory: the Theory of Functions and Sets of Natural Numbers","author":"Odifreddi P.G.","year":"1997","unstructured":"P.G. Odifreddi . Classical Recursion Theory: the Theory of Functions and Sets of Natural Numbers , volume 125 of Studies in Logic and the Foundations of Mathematics . Elsevier , 1997 . P.G. Odifreddi. Classical Recursion Theory: the Theory of Functions and Sets of Natural Numbers, volume 125 of Studies in Logic and the Foundations of Mathematics. Elsevier, 1997."},{"key":"e_1_3_2_1_24_1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical Recursion Theory","author":"Odifreddi P.G.","year":"1999","unstructured":"P.G. Odifreddi . Classical Recursion Theory , Volume II, volume 143 of Studies in Logic and the Foundations of Mathematics . Elsevier , 1999 . P.G. Odifreddi. Classical Recursion Theory, Volume II, volume 143 of Studies in Logic and the Foundations of Mathematics. Elsevier, 1999."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1953-0053041-6"},{"key":"e_1_3_2_1_26_1","volume-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers H.","year":"1987","unstructured":"H. Rogers . Theory of Recursive Functions and Effective Computability . MIT press , 1987 . H. Rogers. Theory of Recursive Functions and Effective Computability. MIT press, 1987."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1956-0085187-3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/321510.321525"}],"event":{"name":"POPL08: The 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Francisco California USA","acronym":"POPL08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328438.1328455","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1328438.1328455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:56:07Z","timestamp":1750240567000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328438.1328455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,7]]},"references-count":28,"alternative-id":["10.1145\/1328438.1328455","10.1145\/1328438"],"URL":"https:\/\/doi.org\/10.1145\/1328438.1328455","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1328897.1328455","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,1,7]]},"assertion":[{"value":"2008-01-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}