Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Term Rewriting Rule

Formal and Adaptive Methods for Automation of Parallel Programs Construction: Emerging Research and Opportunities
A pair of terms (left-hand side and right-hand side) divided by an arrow. The left-hand side is replaced by the right-hand side.
Published in Chapter:
Term Rewriting-Based Programming
DOI: 10.4018/978-1-5225-9384-3.ch003
Abstract
One of the directions of algebraic programming is the use of rewriting rules technique. This direction formalizes the transformational aspects of programming, which allows us to describe transformations of some formal objects and research properties of such transformations. The rewriting rules technique is both a powerful formal tool for transformation of formal systems and a practical tool for programming that allows implementing transformations of complex objects. In this chapter, the main definitions associated with algebraic programming based on rewriting rules are given, term rewriting systems are overviewed, and applications of these systems for processing and transformation of programs are considered.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR