Attribute Grammars and Categorical Semantics

Authors:
Shin-Ya Katsumata
Affiliations:
Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan 606-8502
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Year:
2008

Citing 9
Cited 3

Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming

Information and Computation
New foundations for the geometry of interaction

Information and Computation
Conditional attribute grammars

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fixed-point operations on ccc's. Part I

Theoretical Computer Science
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec

Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Uncertain Programming

Uncertain Programming
Higher Order Attribute Grammars

Proceedings on Attribute Grammars, Applications and Systems
Retracting Some Paths in Process Algebra

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Geometry of Interaction and linear combinatory algebras

Mathematical Structures in Computer Science

Categorical descriptional composition

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Functional programming in sublinear space

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a new formulation of attribute grammars (AG for short) called monoidalAGsin 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.