Categorical descriptional composition

Authors:
Shin-Ya Katsumata
Affiliations:
Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan
Venue:
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Year:
2010

Citing 13
Cited 1

Attribute grammars as a functional programming paradigm

Proc. of a conference on Functional programming languages and computer architecture
Composition and evaluation of attribute coupled grammars

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

Information and Computation
Conditional attribute grammars

ACM Transactions on Programming Languages and Systems (TOPLAS)
Attribute coupled grammars

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
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
Using Circular Programs to Deforest in Accumulating Parameters

Higher-Order and Symbolic Computation
XML stream transformer generation through program composition and dependency analysis

Science of Computer Programming
Pseudo-distributive laws and axiomatics for variable binding

Higher-Order and Symbolic Computation
Algebraic fusion of functions with an accumulating parameter and its improvement

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Attribute Grammars and Categorical Semantics

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Composing Stack-Attributed Tree Transducers

Theory of Computing 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

Descriptional composition is a method to fuse two term transformation algorithms described by attribute couplings (AC, attribute grammars over terms) into one. In this article, we provide a general categorical framework for the descriptional composition based on traced symmetric monoidal categories and the Int construction by Joyal et al. We demonstrate that this framework can handle the descriptional composition of SSUR-ACs, nondeterministic SSUR-ACs, quasi-SSUR ACs and quasi-SSUR stack ACs.