Convergence in infinitary term graph rewriting systems is simple (extended abstract)

Patrick Bahr

doi:10.4204/EPTCS.110.4

Convergence in infinitary term graph rewriting systems is simple (extended abstract)

Patrick Bahr

Department of Computer Science

41 Downloads (Pure)

Original language	English
Title of host publication	Proceedings of the 7th International Workshop on Computing with Terms and Graphs : Rome, 23th March 2013
Editors	Rachid Echahed, Detlef Plump
Number of pages	12
Publisher	Open Publishing Association
Publication date	2013
Pages	17-28
DOIs	https://doi.org/10.4204/EPTCS.110.4
Publication status	Published - 2013
Event	International Workshop on Computing with Terms and Graphs 2013 - Rome, Italy Duration: 23 Mar 2013 → … Conference number: 7

Conference

Conference	International Workshop on Computing with Terms and Graphs 2013
Number	7
Country/Territory	Italy
City	Rome
Period	23/03/2013 → …

Series	Electronic Proceedings in Theoretical Computer Science
Volume	110
ISSN	2075-2180

Access to Document

10.4204/EPTCS.110.4Licence: CC BY

Bahr_2013_Convergence_in_infinitaryFinal published version, 231 KBLicence: CC BY

Cite this

Bahr, P. (2013). Convergence in infinitary term graph rewriting systems is simple (extended abstract). In R. Echahed, & D. Plump (Eds.), Proceedings of the 7th International Workshop on Computing with Terms and Graphs: Rome, 23th March 2013 (pp. 17-28). Open Publishing Association. Electronic Proceedings in Theoretical Computer Science Vol. 110 https://doi.org/10.4204/EPTCS.110.4

Convergence in infinitary term graph rewriting systems is simple (extended abstract). / Bahr, Patrick.

Proceedings of the 7th International Workshop on Computing with Terms and Graphs: Rome, 23th March 2013. ed. / Rachid Echahed; Detlef Plump. Open Publishing Association, 2013. p. 17-28 (Electronic Proceedings in Theoretical Computer Science, Vol. 110).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Bahr, P 2013, Convergence in infinitary term graph rewriting systems is simple (extended abstract). in R Echahed & D Plump (eds), Proceedings of the 7th International Workshop on Computing with Terms and Graphs: Rome, 23th March 2013. Open Publishing Association, Electronic Proceedings in Theoretical Computer Science, vol. 110, pp. 17-28, International Workshop on Computing with Terms and Graphs 2013 , Rome, Italy, 23/03/2013. https://doi.org/10.4204/EPTCS.110.4

@inproceedings{ec87d7b2d850429688d6bf336686ad2d,

title = "Convergence in infinitary term graph rewriting systems is simple (extended abstract)",

author = "Patrick Bahr",

year = "2013",

doi = "10.4204/EPTCS.110.4",

language = "English",

series = "Electronic Proceedings in Theoretical Computer Science",

publisher = "Open Publishing Association",

pages = "17--28",

editor = "Rachid Echahed and Detlef Plump",

booktitle = "Proceedings of the 7th International Workshop on Computing with Terms and Graphs",

note = "International Workshop on Computing with Terms and Graphs 2013 ; Conference date: 23-03-2013",

}

TY - GEN

T1 - Convergence in infinitary term graph rewriting systems is simple (extended abstract)

AU - Bahr, Patrick

N1 - Conference code: 7

PY - 2013

Y1 - 2013

U2 - 10.4204/EPTCS.110.4

DO - 10.4204/EPTCS.110.4

M3 - Article in proceedings

T3 - Electronic Proceedings in Theoretical Computer Science

SP - 17

EP - 28

BT - Proceedings of the 7th International Workshop on Computing with Terms and Graphs

A2 - Echahed, Rachid

A2 - Plump, Detlef

PB - Open Publishing Association

T2 - International Workshop on Computing with Terms and Graphs 2013

Y2 - 23 March 2013

ER -