{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:59:50Z","timestamp":1772823590502,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3406,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s1571-0661(05)82596-4","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"347-361","source":"Crossref","is-referenced-by-count":15,"title":["A Functional Perspective on SSA Optimisation Algorithms"],"prefix":"10.1016","volume":"82","author":[{"given":"Manuel M.T.","family":"Chakravarty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Keller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patryk","family":"Zadarnowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82596-4_BIB1","series-title":"15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","first-page":"1","article-title":"Detecting equality of variables in programs","author":"Alpern","year":"1998"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB2","series-title":"\u201cModern Compiler Implementation in ML,\u201d","author":"Appel","year":"1998"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/278283.278285","article-title":"SSA is functional programming","volume":"33","author":"Appel","year":"1998","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB4","series-title":"Proceedings of the Conference on Programming Language Design and Implementation","first-page":"257","article-title":"The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages","author":"Ballance","year":"1990"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB5","series-title":"Technical Report 0217","article-title":"A functional perspective on SSA optimisation algorithms-unabridged","author":"Chakravarty","year":"2003"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB6","doi-asserted-by":"crossref","unstructured":"Cousot, P. and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (1977), 238-252.","DOI":"10.1145\/512950.512973"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB7","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/115372.115320","article-title":"Efficiently computing static single assignment form and the control dependence graph","volume":"13","author":"Cytron","year":"1991","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB8","doi-asserted-by":"crossref","unstructured":"Flanagan, C., A. Sabry, B. F. Duba and M. Felleisen, The essence of compiling with continuations, in: Proceedings ACM SIGPLAN 1993 Conf. on Programming Language Design and Implementation, PLDI'93 (1993), 237-247.","DOI":"10.1145\/155090.155113"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB9","doi-asserted-by":"crossref","unstructured":"Harper, R. and G. Morrisett, Compiling polymorphism using intensional type analysis, in: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1995), 130-141.","DOI":"10.1145\/199448.199475"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB10","unstructured":"Johnsson, T., Lambda lifting: Transforming programs to recursive equations, in: Jouannaud, editor, Proceedings of the International Conference on Functional Programming and Computer Architecture, number 201 in Lecture Notes in Computer Science (1985)."},{"key":"10.1016\/S1571-0661(05)82596-4_BIB11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-6423(97)00029-4","article-title":"A transformation-based optimiser for Haskell","volume":"32","author":"Jones","year":"1998","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/202530.202532","article-title":"A correspondence between continuation passing style and static single assignment form","volume":"30","author":"Kelsey","year":"1995","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB13","series-title":"Proceedings of the 29th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages","first-page":"270","article-title":"Composing dataflow analyses and transformations","author":"Lerner","year":"2002"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB14","first-page":"528","volume":"21","author":"Morrisett","year":"1999","journal-title":"From System F to typed assembly language, ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB15","unstructured":"Peyton Jones, S. et al., Haskell 98: A non-strict, purely functional language (1999). URL http:\/\/haskell.org\/definition\/"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB16","doi-asserted-by":"crossref","unstructured":"Peyton Jones, S. L., Compiling Haskell by program transformation: a report from the trenches, in: H. R. Nielson, editor, Proceedings of the European Symposium on Programming, Lecture Notes in Computer Science 1058 (1996), 18-44.","DOI":"10.1007\/3-540-61055-3_27"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB17","doi-asserted-by":"crossref","unstructured":"Sabry, A. and M. Felleisen, Is continuation-passing useful for data flow analysis?, in: Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI) (1994), 1-12.","DOI":"10.1145\/178243.178244"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB18","first-page":"86","article-title":"A language-based approach to security","volume":"2000","author":"Schneider","year":"2000"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB19","doi-asserted-by":"crossref","unstructured":"Shivers, O., Control-flow analysis in Scheme, in: Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation (1988).","DOI":"10.1145\/53990.54007"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB20","series-title":"SIGPLAN Conference on Programming Language Design and Implementation","first-page":"181","article-title":"TIL: A type-directed optimizing compiler for ML","author":"Tarditi","year":"1996"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB21","series-title":"An external representation for the GHC core language","author":"Tolmach","year":"2001"},{"key":"10.1016\/S1571-0661(05)82596-4_BIB22","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/103135.103136","article-title":"Constant propagation with conditional branches","volume":"13","author":"Wegman","year":"1991","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825964?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825964?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T22:12:58Z","timestamp":1550700778000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S1571066105825964"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82596-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}