Translation of tree-processing programs into stream-processing programs based on ordered linear type

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3302, Issue , 2004, Pages 41-56

  Kodama, Koichi ^a   Suenaga, Kohei ^b   Kobayashi, Naoki ^a  

^a Tokyo Institute of Technology ^*  (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; COMPUTATIONAL LINGUISTICS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; TRANSLATION (LANGUAGES); TREES (MATHEMATICS);

LINEAR TYPES; LOGICAL STRUCTURE; MEMORY USAGE; PHYSICAL STRUCTURES; STREAM PROCESSING; TREE PROCESSING; TREE-STRUCTURED DATA; TYPE SYSTEMS;

PROGRAM TRANSLATORS;

EID: 35048880319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30477-7_4     Document Type: Article

References (14)

1. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers. Addison-Wesley Pub Co, 1986.
2. Henry G. Baker. Lively linear lisp - look ma, no garbage! ACM SIGPLAN Notices, 27(8):89-98, 1992.
3. Tim Bray, Jean Paoli, C.M.Sperberg-McQueen, and Eve Maler. Extensible markup language (XML) 1.0 (second edition). Technical report, World Wide Web Consortium, October 2000. http://www.w3.org/TR/REC-xml.
4. Harald Ganzinger and Robert Giegerich. Attribute coupled grammars. In Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction, 1984.
5. Haruo Hosoya and Benjamin C. Pierce. XDuce: A typed XML processing language. ACM Transactions on Internet Technology (TOIT), 3(2):117-148, 2003.
6. Atsushi Igarashi and Naoki Kobayashi. Resource usage analysis. In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 331-342, 2002.
7. Koichi Kodama, Kohei Suenaga, and Naoki Kobayashi. Translation of tree-processing programs into stream-processing programs based on ordered linear type. Full paper. Available from http://www.yl.is.s.u-tokyo.ac.jp/ kohei/doc/paper/translation.pdf
8. Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, pages 124-144, 1991.
9. Keisuke Nakano. Composing stack-attributed tree transducers. Technical Report METR-2004-01, Department of Mathematical Informatics, University of Tokyo, Japan, 2004.
10. Keisuke Nakano and Susumu Nishimura. Deriving event-based document transformers from tree-based specifications. In Mark van den Brand and Didier Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44. Elsevier Science Publishers, 2001.
11. Leaf Petersen, Robert Harper, Karl Crary, and Prank Pfenning. A type theory for memory allocation and data layout. In Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003.
12. Jeff Polakow. Ordered linear logic and applications. PhD thesis, Carnegie Mellon University, June 2001. Available as Technical Report CMU-CS-01-152.
13. David N. Turner, Philip Wadler, and Christian Mossin. Once upon a type. In Proceedings of Functional Programming Languages and Computer Architecture, pages 1-11, San Diego, California, 1995.
14. P. Wadler. Deforestation: Transforming programs to eliminate trees. In ESOP '88. European Symposium on Programming, Nancy, France, 1988 (Lecture Notes in Computer Science, vol. 300), pages 344-358. Berlin: Springer-Verlag, 1988.