Standard
Modular tree automata. / Bahr, Patrick.
Mathematics of Program Construction: 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings. red. / Jeremy Gibbons; Pablo Nogueira. Springer, 2012. s. 263-299 (Lecture notes in computer science, Bind 7342).
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Bahr, P 2012,
Modular tree automata. i J Gibbons & P Nogueira (red),
Mathematics of Program Construction: 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings. Springer, Lecture notes in computer science, bind 7342, s. 263-299, 11th International Conference on Mathematics of Program Construction, Madrid, Spanien,
25/06/2012.
https://doi.org/10.1007/978-3-642-31113-0_14APA
Bahr, P. (2012).
Modular tree automata. I J. Gibbons, & P. Nogueira (red.),
Mathematics of Program Construction: 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings (s. 263-299). Springer. Lecture notes in computer science Bind 7342
https://doi.org/10.1007/978-3-642-31113-0_14Vancouver
Bahr P.
Modular tree automata. I Gibbons J, Nogueira P, red., Mathematics of Program Construction: 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings. Springer. 2012. s. 263-299. (Lecture notes in computer science, Bind 7342).
https://doi.org/10.1007/978-3-642-31113-0_14Author
Bahr, Patrick. / Modular tree automata. Mathematics of Program Construction: 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings. red. / Jeremy Gibbons ; Pablo Nogueira. Springer, 2012. s. 263-299 (Lecture notes in computer science, Bind 7342).
Bibtex
@inproceedings{d1c3eb64f1b2495e8bd2ee33443e1594,
title = "Modular tree automata",
abstract = "Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes. Functions that are defined in terms of these recursion schemes can be combined, reused and transformed in many ways. This flexibility facilitates the specification of complex transformations in a concise manner, which is illustrated with a number of examples.",
keywords = "Faculty of Science, compiler, tree transducer, deforestation, attribute grammar, syntax-directed",
author = "Patrick Bahr",
year = "2012",
doi = "10.1007/978-3-642-31113-0_14",
language = "English",
isbn = "978-3-642-31112-3",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "263--299",
editor = "Jeremy Gibbons and Pablo Nogueira",
booktitle = "Mathematics of Program Construction",
address = "Switzerland",
note = "11th International Conference on Mathematics of Program Construction, MPC 2012 ; Conference date: 25-06-2012 Through 27-06-2012",
}
RIS
TY - GEN
T1 - Modular tree automata
AU - Bahr, Patrick
N1 - Conference code: 11
PY - 2012
Y1 - 2012
N2 - Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes. Functions that are defined in terms of these recursion schemes can be combined, reused and transformed in many ways. This flexibility facilitates the specification of complex transformations in a concise manner, which is illustrated with a number of examples.
AB - Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes. Functions that are defined in terms of these recursion schemes can be combined, reused and transformed in many ways. This flexibility facilitates the specification of complex transformations in a concise manner, which is illustrated with a number of examples.
KW - Faculty of Science
KW - compiler
KW - tree transducer
KW - deforestation
KW - attribute grammar
KW - syntax-directed
U2 - 10.1007/978-3-642-31113-0_14
DO - 10.1007/978-3-642-31113-0_14
M3 - Article in proceedings
SN - 978-3-642-31112-3
T3 - Lecture notes in computer science
SP - 263
EP - 299
BT - Mathematics of Program Construction
A2 - Gibbons, Jeremy
A2 - Nogueira, Pablo
PB - Springer
T2 - 11th International Conference on Mathematics of Program Construction
Y2 - 25 June 2012 through 27 June 2012
ER -
