Selective Thunkification. Steckler, P. & Wand, M. In Static Analysis: First International Static Analysis Symposium , volume 864, pages 162-178. Springer-Verlag, Berlin, Heidelberg, and New York, September, 1994. ![Selective Thunkification [ps]](https://bibbase.org/img/filetypes/ps.svg "ps")
Paper abstract bibtex Recently, Amtoft presented an analysis and transformation for mapping typed call-by-name programs to call-by-value equivalents. Here, we present a comparable analysis and transformation for untyped programs using dataflow analysis. In the general case, the transformation generates thunks for call site operands of a call-by-name program. Using strictness information derived as part of a larger flow analysis, we can determine that some operands are necessarily evaluated under call-by-name, so the transformation does not need to generate thunks for them. The dataflow analysis is formulated as the solution to a set of constraints. We show that any solution to the constraints is sound, and that any such solution justifies the resulting transformation.
@InCollection{StecklerWand94,
author = "Paul Steckler and Mitchell Wand",
title = "Selective Thunkification",
booktitle = "Static Analysis: First International Static Analysis
Symposium ",
publisher = springer,
year = "1994",
editor = "Baudouin Le Charlier",
volume = 864,
OPTchapter = "",
pages = "162-178",
address = springeraddr,
month = sep,
abstract = "Recently, Amtoft presented an analysis and
transformation for mapping typed call-by-name
programs to call-by-value equivalents. Here, we
present a comparable analysis and transformation for
untyped programs using dataflow analysis. In the
general case, the transformation generates thunks for
call site operands of a call-by-name program. Using
strictness information derived as part of a larger
flow analysis, we can determine that some operands
are necessarily evaluated under call-by-name, so the
transformation does not need to generate thunks for
them. The dataflow analysis is formulated as the
solution to a set of constraints. We show that any
solution to the constraints is sound, and that any
such solution justifies the resulting
transformation.",
URL = "ftp://ftp.ccs.neu.edu/pub/people/wand/papers/sas-94.ps",
}
Downloads: 0
{"_id":"XmoNQG3NCdybezGWS","bibbaseid":"steckler-wand-selectivethunkification-1994","downloads":0,"creationDate":"2017-04-23T20:31:12.581Z","title":"Selective Thunkification","author_short":["Steckler, P.","Wand, M."],"year":1994,"bibtype":"incollection","biburl":"http://www.ccs.neu.edu/home/wand/Bibliography.bib","bibdata":{"bibtype":"incollection","type":"incollection","author":[{"firstnames":["Paul"],"propositions":[],"lastnames":["Steckler"],"suffixes":[]},{"firstnames":["Mitchell"],"propositions":[],"lastnames":["Wand"],"suffixes":[]}],"title":"Selective Thunkification","booktitle":"Static Analysis: First International Static Analysis Symposium ","publisher":"Springer-Verlag","year":"1994","editor":[{"firstnames":["Baudouin","Le"],"propositions":[],"lastnames":["Charlier"],"suffixes":[]}],"volume":"864","optchapter":"","pages":"162-178","address":"Berlin, Heidelberg, and New York","month":"September","abstract":"Recently, Amtoft presented an analysis and transformation for mapping typed call-by-name programs to call-by-value equivalents. Here, we present a comparable analysis and transformation for untyped programs using dataflow analysis. In the general case, the transformation generates thunks for call site operands of a call-by-name program. Using strictness information derived as part of a larger flow analysis, we can determine that some operands are necessarily evaluated under call-by-name, so the transformation does not need to generate thunks for them. The dataflow analysis is formulated as the solution to a set of constraints. We show that any solution to the constraints is sound, and that any such solution justifies the resulting transformation.","url":"ftp://ftp.ccs.neu.edu/pub/people/wand/papers/sas-94.ps","bibtex":"@InCollection{StecklerWand94,\n author = \t\"Paul Steckler and Mitchell Wand\",\n title = \t\"Selective Thunkification\",\n booktitle = \t\"Static Analysis: First International Static Analysis\n\t\t Symposium \",\n publisher = \tspringer,\n year = \t\"1994\",\n editor = \t\"Baudouin Le Charlier\",\n volume = 864,\n OPTchapter = \t\"\",\n pages = \t\"162-178\",\n address = \tspringeraddr,\n month = \tsep,\n abstract = \"Recently, Amtoft presented an analysis and\n\t\t transformation for mapping typed call-by-name\n\t\t programs to call-by-value equivalents. Here, we\n\t\t present a comparable analysis and transformation for\n\t\t untyped programs using dataflow analysis. In the\n\t\t general case, the transformation generates thunks for\n\t\t call site operands of a call-by-name program. Using\n\t\t strictness information derived as part of a larger\n\t\t flow analysis, we can determine that some operands\n\t\t are necessarily evaluated under call-by-name, so the\n\t\t transformation does not need to generate thunks for\n\t\t them. The dataflow analysis is formulated as the\n\t\t solution to a set of constraints. We show that any\n\t\t solution to the constraints is sound, and that any\n\t\t such solution justifies the resulting\n\t\t transformation.\",\n URL = \"ftp://ftp.ccs.neu.edu/pub/people/wand/papers/sas-94.ps\",\n}\n\n","author_short":["Steckler, P.","Wand, M."],"editor_short":["Charlier, B. L."],"key":"StecklerWand94","id":"StecklerWand94","bibbaseid":"steckler-wand-selectivethunkification-1994","role":"author","urls":{"Paper":"ftp://ftp.ccs.neu.edu/pub/people/wand/papers/sas-94.ps"},"downloads":0,"html":""},"search_terms":["selective","thunkification","steckler","wand"],"keywords":[],"authorIDs":["58fd0f10bfc623c939000018"],"dataSources":["zM8mNPR4ZkAHKtvDs"]}