{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T23:05:26Z","timestamp":1779836726101,"version":"3.53.1"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1999,9]]},"abstract":"<jats:p>\n                    In this paper we demonstrate that a broad class of higher-order functional programs can be \ntransformed into semantically equivalent multidimensional intensional programs that contain \nonly nullary variable definitions. The proposed algorithm systematically eliminates user-defined functions from the source program, by appropriately introducing context manipulation \n(i.e. intensional) operators. The transformation takes place in\n                    <jats:italic>M<\/jats:italic>\n                    steps, where\n                    <jats:italic>M<\/jats:italic>\n                    is the order \nof the initial functional program. During each step the order of the program is reduced by \none, and the final outcome of the algorithm is an\n                    <jats:italic>M<\/jats:italic>\n                    -dimensional intensional program of order \nzero. As the resulting intensional code can be executed in a purely tagged-dataflow way, the \nproposed approach offers a promising new technique for the implementation of higher-order \nfunctional languages.\n                  <\/jats:p>","DOI":"10.1017\/s0956796899003445","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:26:15Z","timestamp":1027761975000},"page":"527-564","source":"Crossref","is-referenced-by-count":8,"title":["Higher-order functional languages and intensional logic"],"prefix":"10.1017","volume":"9","author":[{"given":"P.","family":"RONDOGIANNIS","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"W. W.","family":"WADGE","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[1999,9,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796899003445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:35:32Z","timestamp":1779834932000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796899003445\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0956796899003445"],"URL":"https:\/\/doi.org\/10.1017\/s0956796899003445","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}