Needed Computations Shortcutting Needed Steps

Needed Computations Shortcutting Needed Steps

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. Consequent...

Full description

Bibliographic Details
Main Authors: Sergio Antoy, Jacob Johannsen, Steven Libby
Format: Article
Language:English
Published: Open Publishing Association 2015-05-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1505.07162v1
id doaj-da88ecf93ae54f7db3f3ed3d06266e79
record_format Article
spelling doaj-da88ecf93ae54f7db3f3ed3d06266e792020-11-25T00:06:28ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802015-05-01183Proc. TERMGRAPH 2014183210.4204/EPTCS.183.2:1Needed Computations Shortcutting Needed StepsSergio AntoyJacob JohannsenSteven LibbyWe 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.http://arxiv.org/pdf/1505.07162v1
collection DOAJ
language English
format Article
sources DOAJ
author Sergio Antoy
Jacob Johannsen
Steven Libby
spellingShingle Sergio Antoy
Jacob Johannsen
Steven Libby
Needed Computations Shortcutting Needed Steps
Electronic Proceedings in Theoretical Computer Science
author_facet Sergio Antoy
Jacob Johannsen
Steven Libby
author_sort Sergio Antoy
title Needed Computations Shortcutting Needed Steps
title_short Needed Computations Shortcutting Needed Steps
title_full Needed Computations Shortcutting Needed Steps
title_fullStr Needed Computations Shortcutting Needed Steps
title_full_unstemmed Needed Computations Shortcutting Needed Steps
title_sort needed computations shortcutting needed steps
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2015-05-01
description 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.
url http://arxiv.org/pdf/1505.07162v1
work_keys_str_mv AT sergioantoy neededcomputationsshortcuttingneededsteps
AT jacobjohannsen neededcomputationsshortcuttingneededsteps
AT stevenlibby neededcomputationsshortcuttingneededsteps
_version_ 1725421932842582016

Similar Items