Rewriting: Difference between revisions
Jump to navigation
Jump to search
(Created page with " A Rewriting is a Mathematics that ... * <B>See:</B> Declarative Programming Language, Mathematics, Computer Science, Logic, Well-Formed Formula, Joseph Goguen, Journal of Functional Programming, Non-Deterministic Algorithm, Algorithm, Computer Program, Automated Theorem Proving. ---- ---- ==References== === 2024 === * (Wikipedia, 2024) ⇒ https://en.wikipedia.org/wiki/Rewriting Retrieved:2024-4-25. ** In...") |
(ContinuousReplacement) Tag: continuous replacement |
||
| Line 4: | Line 4: | ||
---- | ---- | ||
---- | ---- | ||
==References== | |||
== References == | |||
=== 2024 === | === 2024 === | ||
* (Wikipedia, 2024) | * (Wikipedia, 2024) ⇒ https://en.wikipedia.org/wiki/Rewriting Retrieved:2024-4-25. | ||
** In [[mathematics]], [[computer science]], and [[logic]], '''rewriting''' covers a wide range of methods of replacing subterms of a [[well-formed formula|formula]] with other terms. Such methods may be achieved by '''rewriting systems''' (also known as '''rewrite systems''', '''rewrite engines''', <ref> [[Joseph Goguen]] "Proving and Rewriting" International Conference on Algebraic and Logic Programming, 1990 Nancy, France pp 1-24 </ref> <ref name="SculthorpeFrisby2014"></ref> or '''reduction systems'''). In their most basic form, they consist of a set of objects, plus relations on how to transform those objects. Rewriting can be [[non-deterministic algorithm|non-deterministic]]. One rule to rewrite a term could be applied in many different ways to that term, or more than one rule could be applicable. Rewriting systems then do not provide an [[algorithm]] for changing one term to another, but a set of possible rule applications. When combined with an appropriate algorithm, however, rewrite systems can be viewed as [[computer program]]s, and several [[automated theorem proving|theorem prover]]s and [[declarative programming language]]s are based on term rewriting. <ref name="Clavel.Duran.Eker.2002"></ref> | ** In [[mathematics]], [[computer science]], and [[logic]], '''rewriting''' covers a wide range of methods of replacing subterms of a [[well-formed formula|formula]] with other terms. Such methods may be achieved by '''rewriting systems''' (also known as '''rewrite systems''', '''rewrite engines''', <ref> [[Joseph Goguen]] "Proving and Rewriting" International Conference on Algebraic and Logic Programming, 1990 Nancy, France pp 1-24 </ref> <ref name="SculthorpeFrisby2014"></ref> or '''reduction systems'''). In their most basic form, they consist of a set of objects, plus relations on how to transform those objects. Rewriting can be [[non-deterministic algorithm|non-deterministic]]. One rule to rewrite a term could be applied in many different ways to that term, or more than one rule could be applicable. Rewriting systems then do not provide an [[algorithm]] for changing one term to another, but a set of possible rule applications. When combined with an appropriate algorithm, however, rewrite systems can be viewed as [[computer program]]s, and several [[automated theorem proving|theorem prover]]s and [[declarative programming language]]s are based on term rewriting. <ref name="Clavel.Duran.Eker.2002"></ref> | ||
<references/> | <references/> | ||
Revision as of 18:20, 25 April 2024
A Rewriting is a Mathematics that ...
- See: Declarative Programming Language, Mathematics, Computer Science, Logic, Well-Formed Formula, Joseph Goguen, Journal of Functional Programming, Non-Deterministic Algorithm, Algorithm, Computer Program, Automated Theorem Proving.
References
2024
- (Wikipedia, 2024) ⇒ https://en.wikipedia.org/wiki/Rewriting Retrieved:2024-4-25.
- In mathematics, computer science, and logic, rewriting covers a wide range of methods of replacing subterms of a formula with other terms. Such methods may be achieved by rewriting systems (also known as rewrite systems, rewrite engines, [1] [2] or reduction systems). In their most basic form, they consist of a set of objects, plus relations on how to transform those objects. Rewriting can be non-deterministic. One rule to rewrite a term could be applied in many different ways to that term, or more than one rule could be applicable. Rewriting systems then do not provide an algorithm for changing one term to another, but a set of possible rule applications. When combined with an appropriate algorithm, however, rewrite systems can be viewed as computer programs, and several theorem provers and declarative programming languages are based on term rewriting. [3]
- ↑ Joseph Goguen "Proving and Rewriting" International Conference on Algebraic and Logic Programming, 1990 Nancy, France pp 1-24
- ↑ Cite error: Invalid
<ref>tag; no text was provided for refs namedSculthorpeFrisby2014 - ↑ Cite error: Invalid
<ref>tag; no text was provided for refs namedClavel.Duran.Eker.2002