Skip to main content
SpringerLink
Log in

Categorical Descriptional Composition

  • Conference paper
Book cover Programming Languages and Systems (APLAS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6461))

Included in the following conference series:

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 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bartha, M.: Linear deterministic attributed transformations. Acta Cybern. 6, 125–147 (1983)

    MathSciNet  MATH  Google Scholar 

  2. Blackwell, R., Kelly, G.M., Power, A.J.: Two-dimentional monad theory. Journal of pure and applied algebra 59, 1–41 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Boyland, J.: Conditional attribute grammars. ACM Trans. Program. Lang. Syst. 18(1), 73–108 (1996)

    Article  Google Scholar 

  4. Chirica, L.M., Martin, D.F.: An order-algebraic definition of Knuthian semantics. Mathematical Systems Theory 13, 1–27 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. Courcelle, B., Deransart, P.: Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming. Inf. Comput. 78(1), 1–55 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ganzinger, H.: Increasing modularity and language-independency in automatically generated compilers. Sci. Comput. Program. 3(3), 223–278 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ganzinger, H., Giegerich, R.: Attribute coupled grammars. In: SIGPLAN Symposium on Compiler Construction 1984, pp. 157–170. ACM, New York (1984)

    Chapter  Google Scholar 

  8. Giegerich, R.: Composition and evaluation of attribute coupled grammars. Acta Inf. 25(4), 355–423 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hasegawa, M.: Models of Sharing Graphs: A Categorical Semantics of let and letrec. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  10. Johnsson, T.: Attribute grammars as a functional programming paradigm. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol. 274, pp. 154–173. Springer, Heidelberg (1987)

    Chapter  Google Scholar 

  11. Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society 119(3), 447–468 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Katsumata, S.: Attribute grammars and categorical semantics. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 271–282. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Katsumata, S., Nishimura, S.: Algebraic fusion of functions with an accumulating parameter and its improvement. In: Reppy, J.H., Lawall, J.L. (eds.) ICFP, pp. 227–238. ACM, New York (2006)

    Google Scholar 

  14. Knuth, D.E.: Semantics of context-free languages. Mathematical Systems Theory 2(2), 127–145 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  15. Knuth, D.E.: Correction: Semantics of context-free languages. Mathematical Systems Theory 5(1), 95–96 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kock, A.: Strong functors and monoidal monads. Archiv. der Math. 23(1), 113–120 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  17. MacLane, S.: Categories for the Working Mathematician, 2nd edn. Graduate Texts in Mathematics, vol. 5. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  18. Nakano, K.: Composing stack-attributed tree transducers. Theory Comput. Syst. 44(1), 1–38 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Nishimura, S.: Deforesting in accumulating parameters via type-directed transformations. In: APLAS 2002, pp. 145–159 (2002)

    Google Scholar 

  20. Nishimura, S., Nakano, K.: XML stream transformer generation through program composition and dependency analysis. Sci. Comput. Program. 54(2-3), 257–290 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  21. Tanaka, M., Power, J.: Pseudo-distributive laws and axiomatics for variable binding. Higher-Order and Symbolic Computation 19(2-3), 305–337 (2006)

    Article  MATH  Google Scholar 

  22. Voigtländer, J.: Using circular programs to deforest in accumulating parameters. Higher-Order and Symbolic Computation 17(1-2), 129–163 (2004)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Mathematical Sciences, Kyoto University, Kyoto, 606-8502, Japan

    Shin-ya Katsumata

Authors
  1. Shin-ya Katsumata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engineering, Waseda University, 3-4-1, Okubo, Shinjuku-ku, 169-8555, Tokyo, Japan

    Kazunori Ueda

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katsumata, Sy. (2010). Categorical Descriptional Composition. In: Ueda, K. (eds) Programming Languages and Systems. APLAS 2010. Lecture Notes in Computer Science, vol 6461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17164-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17164-2_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17163-5

  • Online ISBN: 978-3-642-17164-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation