{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T23:05:06Z","timestamp":1779836706375,"version":"3.53.1"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"unspecified","delay-in-days":120,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[2000,11]]},"abstract":"<jats:p>In this paper we present two type inference systems for detecting useless-code in higher-order \ntyped functional programs. Type inference can be performed in an efficient and complete \nway, by reducing it to the solution of a system of constraints. We also give a useless-code \nelimination algorithm which is based on a combined use of these type inference systems. The \nmain application of the technique is the optimization of programs extracted from proofs in \nlogical frameworks, but it could be used as well in the elimination of useless-code determined \nby program transformations.<\/jats:p>","DOI":"10.1017\/s0956796800003786","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:26:15Z","timestamp":1027761975000},"page":"509-559","source":"Crossref","is-referenced-by-count":10,"title":["Automatic useless-code elimination for HOT functional programs"],"prefix":"10.1017","volume":"10","author":[{"given":"FERRUCCIO","family":"DAMIANI","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"PAOLA","family":"GIANNINI","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2001,3,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796800003786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:34:47Z","timestamp":1779834887000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796800003786\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0956796800003786"],"URL":"https:\/\/doi.org\/10.1017\/s0956796800003786","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}