Abstract
We give a new formulation of attribute grammars (AG for short) called monoidal AGs in traced symmetric monoidal categories. Monoidal AGs subsume existing domain-theoretic, graph-theoretic and relational formulations of AGs. Using a 2-categorical aspect of monoidal AGs, we also show that every monoidal AG is equivalent to a synthesised one when the underlying category is closed, and that there is a sound and complete translation from local dependency graphs to relational AGs. © 2008 Springer-Verlag.
Cite
CITATION STYLE
Katsumata, S. Y. (2008). Attribute grammars and categorical semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5126 LNCS, pp. 271–282). https://doi.org/10.1007/978-3-540-70583-3_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
