Welcome to the InfoSci Platform
Term Rewriting-Based Programming

Term Rewriting-Based Programming

Copyright: © 2021 |Pages: 36
ISBN13: 9781522593843|ISBN10: 1522593845|ISBN13 Softcover: 9781522593850|EISBN13: 9781522593867
DOI: 10.4018/978-1-5225-9384-3.ch003
Cite Chapter Cite Chapter

MLA

Anatoliy Doroshenko and Olena Yatsenko. "Term Rewriting-Based Programming." Formal and Adaptive Methods for Automation of Parallel Programs Construction: Emerging Research and Opportunities, IGI Global, 2021, pp.76-111. https://doi.org/10.4018/978-1-5225-9384-3.ch003

APA

A. Doroshenko & O. Yatsenko (2021). Term Rewriting-Based Programming. IGI Global. https://doi.org/10.4018/978-1-5225-9384-3.ch003

Chicago

Anatoliy Doroshenko and Olena Yatsenko. "Term Rewriting-Based Programming." In Formal and Adaptive Methods for Automation of Parallel Programs Construction: Emerging Research and Opportunities. Hershey, PA: IGI Global, 2021. https://doi.org/10.4018/978-1-5225-9384-3.ch003

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.