Needed computations shortcutting needed steps

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Standard

Needed computations shortcutting needed steps. / Antoy, Sergio; Johannsen, Jacob; Libby, Steven.

Electronic Proceedings in Theoretical Computer Science, EPTCS. Vol. 183 Open Publishing Association, 2015. p. 18-32.

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Harvard

Antoy, S, Johannsen, J & Libby, S 2015, Needed computations shortcutting needed steps. in Electronic Proceedings in Theoretical Computer Science, EPTCS. vol. 183, Open Publishing Association, pp. 18-32, 8th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2014, Vienna, Austria, 13/07/2014. https://doi.org/10.4204/EPTCS.183.2

APA

Antoy, S., Johannsen, J., & Libby, S. (2015). Needed computations shortcutting needed steps. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 183, pp. 18-32). Open Publishing Association. https://doi.org/10.4204/EPTCS.183.2

CBE

Antoy S, Johannsen J, Libby S. 2015. Needed computations shortcutting needed steps. In Electronic Proceedings in Theoretical Computer Science, EPTCS. Open Publishing Association. pp. 18-32. https://doi.org/10.4204/EPTCS.183.2

MLA

Antoy, Sergio, Jacob Johannsen and Steven Libby "Needed computations shortcutting needed steps". Electronic Proceedings in Theoretical Computer Science, EPTCS. Open Publishing Association. 2015, 18-32. https://doi.org/10.4204/EPTCS.183.2

Vancouver

Antoy S, Johannsen J, Libby S. Needed computations shortcutting needed steps. In Electronic Proceedings in Theoretical Computer Science, EPTCS. Vol. 183. Open Publishing Association. 2015. p. 18-32 https://doi.org/10.4204/EPTCS.183.2

Author

Antoy, Sergio ; Johannsen, Jacob ; Libby, Steven. / Needed computations shortcutting needed steps. Electronic Proceedings in Theoretical Computer Science, EPTCS. Vol. 183 Open Publishing Association, 2015. pp. 18-32

Bibtex

@inproceedings{c053b632f7cc45e09f1dd0c72e9d15da,
title = "Needed computations shortcutting needed steps",
abstract = "We define a compilation scheme for a constructor-based, strongly-sequential, graph rewriting system which shortcuts some needed steps. The object code is another constructor-based graph rewriting system. This system is normalizing for the original system when using an innermost strategy. Consequently, the object code can be easily implemented by eager functions in a variety of programming languages. We modify this object code in a way that avoids total or partial construction of the contracta of some needed steps of a computation. When computing normal forms in this way, both memory consumption and execution time are reduced compared to ordinary rewriting computations in the original system.",
author = "Sergio Antoy and Jacob Johannsen and Steven Libby",
year = "2015",
doi = "10.4204/EPTCS.183.2",
language = "English",
volume = "183",
pages = "18--32",
booktitle = "Electronic Proceedings in Theoretical Computer Science, EPTCS",
publisher = "Open Publishing Association",
note = "8th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2014 ; Conference date: 13-07-2014",

}

RIS

TY - GEN

T1 - Needed computations shortcutting needed steps

AU - Antoy, Sergio

AU - Johannsen, Jacob

AU - Libby, Steven

PY - 2015

Y1 - 2015

N2 - We define a compilation scheme for a constructor-based, strongly-sequential, graph rewriting system which shortcuts some needed steps. The object code is another constructor-based graph rewriting system. This system is normalizing for the original system when using an innermost strategy. Consequently, the object code can be easily implemented by eager functions in a variety of programming languages. We modify this object code in a way that avoids total or partial construction of the contracta of some needed steps of a computation. When computing normal forms in this way, both memory consumption and execution time are reduced compared to ordinary rewriting computations in the original system.

AB - We define a compilation scheme for a constructor-based, strongly-sequential, graph rewriting system which shortcuts some needed steps. The object code is another constructor-based graph rewriting system. This system is normalizing for the original system when using an innermost strategy. Consequently, the object code can be easily implemented by eager functions in a variety of programming languages. We modify this object code in a way that avoids total or partial construction of the contracta of some needed steps of a computation. When computing normal forms in this way, both memory consumption and execution time are reduced compared to ordinary rewriting computations in the original system.

UR - http://www.scopus.com/inward/record.url?scp=84954219827&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.183.2

DO - 10.4204/EPTCS.183.2

M3 - Article in proceedings

AN - SCOPUS:84954219827

VL - 183

SP - 18

EP - 32

BT - Electronic Proceedings in Theoretical Computer Science, EPTCS

PB - Open Publishing Association

T2 - 8th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2014

Y2 - 13 July 2014

ER -