{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T23:40:44Z","timestamp":1746142844209},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In this paper we present a novel condensed narrowing-like semantics that contains the minimal information which is needed to describe compositionally all possible rewritings of a term rewriting system. We provide its goal-dependent top-down definition and, more importantly, an equivalent goal-independent bottom-up fixpoint characterization.<\/jats:p><jats:p>We prove soundness and completeness w.r.t. the small-step behavior of rewriting for the full class of term rewriting systems.<\/jats:p>","DOI":"10.29007\/cpt8","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:59:06Z","timestamp":1516748346000},"page":"31-11","source":"Crossref","is-referenced-by-count":1,"title":["A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting"],"prefix":"10.29007","volume":"15","author":[{"given":"Marco","family":"Comini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Torella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"SCSS 2013. 5th 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-23T22:59:10Z","timestamp":1516748350000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/Pzf"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/cpt8","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}