{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:26:02Z","timestamp":1725456362684},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Partial evaluation and staging are two of the well-known symbolic<\/jats:p><jats:p>manipulation techniques of programs which generate efficient<\/jats:p><jats:p>specialized code.  On one hand, partial evaluation provides us with an<\/jats:p><jats:p>automatic means to separate a program into two (or more) stages but<\/jats:p><jats:p>its behavior is perceived as hard to control.  On the other hand,<\/jats:p><jats:p>staging (or staged calculus) requires us to manually separate a<\/jats:p><jats:p>program but with full control over its behavior.  In the previous<\/jats:p><jats:p>work, the first author introduced a framework to relate the two<\/jats:p><jats:p>techniques, giving a unified view to the two techniques.  In this<\/jats:p><jats:p>paper, we extend the framework to handle the cross-stage persistence<\/jats:p><jats:p>(CSP) and show that the 2-level staging annotation obtained by the<\/jats:p><jats:p>automatic separation is the best staging annotation in a system where<\/jats:p><jats:p>CSP is allowed for base-type values only.  In the presence of CSP for<\/jats:p><jats:p>higher-type values, on the other hand, there is no single annotation<\/jats:p><jats:p>that is better than all the other annotations.<\/jats:p>","DOI":"10.29007\/rfbk","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:04:17Z","timestamp":1516748657000},"page":"1--13","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Staging via Partial Evaluation Techniques"],"prefix":"10.29007","volume":"39","author":[{"given":"Kenichi","family":"Asai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukiyoshi","family":"Kameyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"SCSS 2016. 7th International Symposium on  Symbolic Computation in Software Science"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:04:18Z","timestamp":1516748658000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/Prd"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/rfbk","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}