<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Reactive_inhibition</id>
	<title>Reactive inhibition - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Reactive_inhibition"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Reactive_inhibition&amp;action=history"/>
	<updated>2026-05-04T07:10:40Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Reactive_inhibition&amp;diff=14739&amp;oldid=prev</id>
		<title>en&gt;O.Koslowski: Reverted edits by 121.245.21.43 (talk) to last revision by Grutness (HG)</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Reactive_inhibition&amp;diff=14739&amp;oldid=prev"/>
		<updated>2012-07-21T10:12:42Z</updated>

		<summary type="html">&lt;p&gt;Reverted edits by &lt;a href=&quot;/wiki/Special:Contributions/121.245.21.43&quot; title=&quot;Special:Contributions/121.245.21.43&quot;&gt;121.245.21.43&lt;/a&gt; (&lt;a href=&quot;/index.php?title=User_talk:121.245.21.43&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;User talk:121.245.21.43 (page does not exist)&quot;&gt;talk&lt;/a&gt;) to last revision by Grutness (&lt;a href=&quot;/index.php?title=WP:HG&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;WP:HG (page does not exist)&quot;&gt;HG&lt;/a&gt;)&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;The &amp;#039;&amp;#039;&amp;#039;Abstract Rewriting Machine&amp;#039;&amp;#039;&amp;#039; (ARM) is a [[virtual machine]] which implements [[term rewriting]] for minimal term rewriting systems. &lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Minimal term rewriting systems&amp;#039;&amp;#039;&amp;#039; are [[left-linear]] [[term rewriting system]]s in which each rule takes on one of six forms:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;blockquote&amp;gt;&lt;br /&gt;
;Continuation:&amp;lt;math&amp;gt;f(\vec{x},\vec{y},\vec{z})\rightarrow g(\vec{x},h(\vec{y}),\vec{z})&amp;lt;/math&amp;gt;&lt;br /&gt;
;Return:&amp;lt;math&amp;gt;f(x)\rightarrow x&amp;lt;/math&amp;gt;&lt;br /&gt;
;Match:&amp;lt;math&amp;gt;f(\vec{x},g(\vec{y}),\vec{z})\rightarrow h(\vec{x},\vec{y},\vec{z})&amp;lt;/math&amp;gt;&lt;br /&gt;
;Add:&amp;lt;math&amp;gt;f(\vec{x},\vec{z})\rightarrow g(\vec{x},y,\vec{z}) -&lt;br /&gt;
{\rm for }~y\in\vec{x}\cup\vec{z}&amp;lt;/math&amp;gt;&lt;br /&gt;
;Delete:&amp;lt;math&amp;gt;f(\vec{x},\vec{y},\vec{z})\rightarrow g(\vec{x},\vec{z})&amp;lt;/math&amp;gt;&lt;br /&gt;
;Ident:&amp;lt;math&amp;gt;f(\vec{x})\rightarrow g(\vec{x})&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each of these six forms is mapped (in ARM) to one or a few processor instructions on most contemporary micro processors. Accordingly, minimal term rewriting is achieved at tens to hundreds of clock cycles per reduction step—millions of reduction steps per second. &lt;br /&gt;
&lt;br /&gt;
ARM implements general term rewriting, in that every single-sorted unconditional left-linear term rewriting system can be transformed (compiled) into a minimal term rewriting system that gives rise to the same normal form relation.&lt;br /&gt;
&lt;br /&gt;
An overview with references to this compilation process for innermost rewriting, as well as a detailed overview of ARM, can be found in [http://portal.acm.org/citation.cfm?id=291903&amp;amp;dl=GUIDE&amp;amp;coll=&amp;amp;CFID=15151515&amp;amp;CFTOKEN=6184618 &amp;quot;Within ARM&amp;#039;s reach: compilation of left-linear rewrite systems via minimal rewrite systems&amp;quot;]. A description for lazy (non-innermost) rewriting can be found in  [http://portal.acm.org/citation.cfm?id=345102&amp;amp;dl=ACM&amp;amp;coll=ACM&amp;amp;CFID=15151515&amp;amp;CFTOKEN=6184618 &amp;quot;Lazy rewriting on eager machinery&amp;quot;].&lt;br /&gt;
&lt;br /&gt;
A documented implementation of ARM (with the term rewriting language Epic) is available [http://www.babelfish.nl/epicarm.html here]. Note that site and software are no longer being actively maintained.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
* {{cite doi|10.1017/S0956796803004945}}&lt;br /&gt;
* {{cite doi|10.1016/S1571-0661(04)80353-0}}&lt;br /&gt;
* {{cite doi|10.1016/S1571-0661(04)00269-5}}&lt;br /&gt;
* {{cite doi|10.1016/j.entcs.2008.03.052}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Virtual machines]]&lt;br /&gt;
[[Category:Term-rewriting programming languages]]&lt;/div&gt;</summary>
		<author><name>en&gt;O.Koslowski</name></author>
	</entry>
</feed>