{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:38:46Z","timestamp":1753889926138,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>In implementing evaluation strategies of the lambda-calculus, both correctness and efficiency of implementation are valid concerns. While the notion of correctness is determined by the evaluation strategy, regarding efficiency there is a larger design space that can be explored, in particular the trade-off between space versus time efficiency. Aiming at a unified framework that would enable the study of this trade-off, we introduce an abstract machine, inspired by Girard's Geometry of Interaction (GoI), a machine combining token passing and graph rewriting. We show soundness and completeness of our abstract machine, called the \\emph{Dynamic GoI Machine} (DGoIM), with respect to three evaluations: call-by-need, left-to-right call-by-value, and right-to-left call-by-value. Analysing time cost of its execution classifies the machine as ``efficient'' in Accattoli's taxonomy of abstract machines.<\/jats:p><jats:p>Comment: arXiv admin note: text overlap with arXiv:1802.06495<\/jats:p>","DOI":"10.23638\/lmcs-15(4:7)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:36:59Z","timestamp":1743701819000},"source":"Crossref","is-referenced-by-count":2,"title":["The Dynamic Geometry of Interaction Machine: A Token-Guided Graph Rewriter"],"prefix":"10.23638","volume":"Volume 15, Issue 4","author":[{"given":"Koko","family":"Muroya","sequence":"first","affiliation":[]},{"given":"Dan R.","family":"Ghica","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,10,30]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1803.00427v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1803.00427v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:36:59Z","timestamp":1743701819000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,30]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(4:7)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1803.00427v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1803.00427v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1803.00427","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1803.00427","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2019,10,30]]},"article-number":"4340"}}