Rewriting (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Rewriting" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

7web.archive.org

1^st place

2semanticscholar.org

11^th place

8^th place

2books.google.com

3^rd place

2tau.ac.il

4,464^th place

4,468^th place

1ntu.ac.uk

low place

1worldcat.org

5^th place

1archive.org

6^th place

1heise.de

766^th place

3,515^th place

1ens-lyon.fr

6,599^th place

low place

1logic.at

low place

1niigata-u.ac.jp

low place

1handle.net

102^nd place

76^th place

1tum.de

7,448^th place

9,770^th place

archive.org

Albert, Gräf (2009). "Signal Processing in the Pure Programming Language". Linux Audio Conference.

books.google.com

Kim Marriott; Peter J. Stuckey (1998). Programming with Constraints: An Introduction. MIT Press. pp. 436–. ISBN 978-0-262-13341-8.
Robert Freidin (1992). Foundations of Generative Syntax. MIT Press. ISBN 978-0-262-06144-5.

doi.org

Sculthorpe, Neil; Frisby, Nicolas; Gill, Andy (2014). "The Kansas University rewrite engine" (PDF). Journal of Functional Programming. 24 (4): 434–473. doi:10.1017/S0956796814000185. ISSN 0956-7968. S2CID 16807490. Archived (PDF) from the original on 2017-09-22. Retrieved 2019-02-12.
Hsiang, Jieh; Kirchner, Hélène; Lescanne, Pierre; Rusinowitch, Michaël (1992). "The term rewriting approach to automated theorem proving". The Journal of Logic Programming. 14 (1–2): 71–99. doi:10.1016/0743-1066(92)90047-7.
Frühwirth, Thom (1998). "Theory and practice of constraint handling rules". The Journal of Logic Programming. 37 (1–3): 95–138. doi:10.1016/S0743-1066(98)10005-5.
Clavel, M.; Durán, F.; Eker, S.; Lincoln, P.; Martí-Oliet, N.; Meseguer, J.; Quesada, J.F. (2002). "Maude: Specification and programming in rewriting logic". Theoretical Computer Science. 285 (2): 187–243. doi:10.1016/S0304-3975(01)00359-0.
Max Dauchet (Sep 1992). "Simulation of Turing machines by a regular rewrite rule". Theoretical Computer Science. 103 (2): 409–420. doi:10.1016/0304-3975(92)90022-8.
Yoshihito Toyama (1987). "Counterexamples to Termination for the Direct Sum of Term Rewriting Systems" (PDF). Inf. Process. Lett. 25 (3): 141–143. doi:10.1016/0020-0190(87)90122-0. hdl:2433/99946. Archived (PDF) from the original on 2019-11-13. Retrieved 2019-11-13.
Wolfram, D. A. (1993). The Clausal Theory of Types. Cambridge University Press. pp. 47–50. doi:10.1017/CBO9780511569906. ISBN 9780521395380. S2CID 42331173.

ens-lyon.fr

Gerard Huet, D.S. Lankford (Mar 1978). On the Uniform Halting Problem for Term Rewriting Systems (PDF) (Technical report). IRIA. p. 8. 283. Retrieved 16 June 2013.

handle.net

hdl.handle.net

Yoshihito Toyama (1987). "Counterexamples to Termination for the Direct Sum of Term Rewriting Systems" (PDF). Inf. Process. Lett. 25 (3): 141–143. doi:10.1016/0020-0190(87)90122-0. hdl:2433/99946. Archived (PDF) from the original on 2019-11-13. Retrieved 2019-11-13.

heise.de

Riepe, Von Michael (November 18, 2009). "Pure – eine einfache funktionale Sprache". Archived from the original on March 19, 2011.

logic.at

Bernhard Gramlich (Jun 1993). "Relating Innermost, Weak, Uniform, and Modular Termination of Term Rewriting Systems". In Voronkov, Andrei (ed.). Proc. International Conference on Logic Programming and Automated Reasoning (LPAR). LNAI. Vol. 624. Springer. pp. 285–296. Archived from the original on 2016-03-04. Retrieved 2014-06-19. Here: Example 3.3

niigata-u.ac.jp

nue.ie.niigata-u.ac.jp

Yoshihito Toyama (1987). "Counterexamples to Termination for the Direct Sum of Term Rewriting Systems" (PDF). Inf. Process. Lett. 25 (3): 141–143. doi:10.1016/0020-0190(87)90122-0. hdl:2433/99946. Archived (PDF) from the original on 2019-11-13. Retrieved 2019-11-13.

ntu.ac.uk

irep.ntu.ac.uk

Sculthorpe, Neil; Frisby, Nicolas; Gill, Andy (2014). "The Kansas University rewrite engine" (PDF). Journal of Functional Programming. 24 (4): 434–473. doi:10.1017/S0956796814000185. ISSN 0956-7968. S2CID 16807490. Archived (PDF) from the original on 2017-09-22. Retrieved 2019-02-12.

semanticscholar.org

api.semanticscholar.org

Sculthorpe, Neil; Frisby, Nicolas; Gill, Andy (2014). "The Kansas University rewrite engine" (PDF). Journal of Functional Programming. 24 (4): 434–473. doi:10.1017/S0956796814000185. ISSN 0956-7968. S2CID 16807490. Archived (PDF) from the original on 2017-09-22. Retrieved 2019-02-12.
Wolfram, D. A. (1993). The Clausal Theory of Types. Cambridge University Press. pp. 47–50. doi:10.1017/CBO9780511569906. ISBN 9780521395380. S2CID 42331173.

tau.ac.il

cs.tau.ac.il

Klop, J. W. "Term Rewriting Systems" (PDF). Papers by Nachum Dershowitz and students. Tel Aviv University. p. 12. Archived (PDF) from the original on 15 August 2021. Retrieved 14 August 2021.
N. Dershowitz (1985). "Termination" (PDF). In Jean-Pierre Jouannaud (ed.). Proc. RTA. LNCS. Vol. 220. Springer. pp. 180–224. Archived (PDF) from the original on 2013-11-12. Retrieved 2013-06-16.; here: p.210

tum.de

www21.in.tum.de

Nipkow, Tobias; Prehofer, Christian (1998). "Higher-Order Rewriting and Equational Reasoning". In Bibel, W.; Schmitt, P. (eds.). Automated Deduction - A Basis for Applications. Volume I: Foundations. Kluwer. pp. 399–430. Archived from the original on 2021-08-16. Retrieved 2021-08-16.

web.archive.org

Sculthorpe, Neil; Frisby, Nicolas; Gill, Andy (2014). "The Kansas University rewrite engine" (PDF). Journal of Functional Programming. 24 (4): 434–473. doi:10.1017/S0956796814000185. ISSN 0956-7968. S2CID 16807490. Archived (PDF) from the original on 2017-09-22. Retrieved 2019-02-12.
Riepe, Von Michael (November 18, 2009). "Pure – eine einfache funktionale Sprache". Archived from the original on March 19, 2011.
Klop, J. W. "Term Rewriting Systems" (PDF). Papers by Nachum Dershowitz and students. Tel Aviv University. p. 12. Archived (PDF) from the original on 15 August 2021. Retrieved 14 August 2021.
Bernhard Gramlich (Jun 1993). "Relating Innermost, Weak, Uniform, and Modular Termination of Term Rewriting Systems". In Voronkov, Andrei (ed.). Proc. International Conference on Logic Programming and Automated Reasoning (LPAR). LNAI. Vol. 624. Springer. pp. 285–296. Archived from the original on 2016-03-04. Retrieved 2014-06-19. Here: Example 3.3
Yoshihito Toyama (1987). "Counterexamples to Termination for the Direct Sum of Term Rewriting Systems" (PDF). Inf. Process. Lett. 25 (3): 141–143. doi:10.1016/0020-0190(87)90122-0. hdl:2433/99946. Archived (PDF) from the original on 2019-11-13. Retrieved 2019-11-13.
N. Dershowitz (1985). "Termination" (PDF). In Jean-Pierre Jouannaud (ed.). Proc. RTA. LNCS. Vol. 220. Springer. pp. 180–224. Archived (PDF) from the original on 2013-11-12. Retrieved 2013-06-16.; here: p.210
Nipkow, Tobias; Prehofer, Christian (1998). "Higher-Order Rewriting and Equational Reasoning". In Bibel, W.; Schmitt, P. (eds.). Automated Deduction - A Basis for Applications. Volume I: Foundations. Kluwer. pp. 399–430. Archived from the original on 2021-08-16. Retrieved 2021-08-16.

worldcat.org

search.worldcat.org

Sculthorpe, Neil; Frisby, Nicolas; Gill, Andy (2014). "The Kansas University rewrite engine" (PDF). Journal of Functional Programming. 24 (4): 434–473. doi:10.1017/S0956796814000185. ISSN 0956-7968. S2CID 16807490. Archived (PDF) from the original on 2017-09-22. Retrieved 2019-02-12.