Term-rewriting programming languages (TRPLs) are programming languages that are based on the principles of term rewriting, a formal system used primarily in the fields of computer science and logic. Term rewriting involves manipulating symbolic expressions (terms) according to a set of defined rules, allowing for computation and the transformation of these terms. ### Key Concepts 1. **Terms**: In term rewriting, a term can be a variable, a constant, or a function applied to arguments.

Ancestors (6)

  1. Rewriting systems
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version