Functional programs as compressed data

Higher-Order and Symbolic Computation

Volumn 25, Issue 1, 2012, Pages 39-84

  Kobayashi, Naoki ^a   Matsuda, Kazutaka ^a   Shinohara, Ayumi ^b   Yaguchi, Kazuya ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

Data compression; Functional programs; Higher order Model Checking; Program transformation; Semantics based program manipulation

Indexed keywords

APPLICATION PROGRAMS; FUNCTIONAL PROGRAMMING; METADATA; MODEL CHECKING; SEMANTICS; TREES (MATHEMATICS);

COMPRESSION ALGORITHMS; FUNCTIONAL PROGRAMS; HIGHER ORDER MODELING; KOLMOGOROV COMPLEXITY; LOSSLESS DATA COMPRESSION; PROGRAM TRANSFORMATIONS; PROGRAM VERIFICATION; TRANSFORMATION TECHNIQUES;

DATA COMPRESSION;

EID: 84881302979     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10990-013-9093-z     Document Type: Article

References (51)

1. Apostolico, A., Lonardi, S.: Some theory and proactive of greedy off-line textual substitution. In: Data Compression Conference 1998 (DCC98), pp. 119–128 (1998)
2. Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. J. Symb. Log. 48(4), 931–940 (1983)
3. Broadbent, C.H., Carayol, A., Ong, C.-H.L., Serre, O.: Recursion schemes and logical reflection. In: Proceedings of LICS 2010, pp. 120–129. IEEE Computer Society Press, Los Alamitos (2010)
4. Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML document trees. Inf. Syst. 33(4–5), 456–474 (2008)
5. Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inf. Theory 51(7), 2554–2576 (2005)
6. Church, A.: The calculi of lambda-conversion. In: Annals of Mathematics Studies, vol. 6. Princeton University Press, Princeton (1941)
7. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007). Available on http://www.grappa.univ-lille3.fr/tata. Release October, 12th 2007
8. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)
9. Dam, W.: The IO- and OI-hierarchies. Theor. Comput. Sci. 20, 95–207 (1982)
10. Engelfriet, J.: Bottom-up and top-down tree transformations—a comparison. Math. Syst. Theory 9(3), 198–231 (1975)
11. Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree transducers, L systems, and two-way machines. J. Comput. Syst. Sci. 20(2), 150–202 (1980)
12. Engelfriet, J., Vogler, H.: High level tree transducers and iterated pushdown tree transducers. Acta Inform. 26(1/2), 131–192 (1988)
13. Gill, A.J., Launchbury, J., Peyton-Jones, S.L.: A short cut to deforestation. In: FPCA, pp. 223–232 (1993)
14. Hague, M., Murawski, A., Ong, C.-H.L., Serre, O.: Collapsible pushdown automata and recursion schemes. In: Proceedings of LICS 2008, pp. 452–461. IEEE Computer Society, Los Alamitos (2008)
15. Hutter, M.: Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability. Springer, Berlin (2004)
16. Kaji, H., Kida, Y., Morimoto, Y.: Learning translation templates from bilingual text. In: COLING, pp. 672–678 (1992)
17. Karpinski, M., Rytter, W., Shinohara, A.: An efficient pattern matching algorithm for strings with short description. Nord. J. Comput. 4(2), 129–144 (1997)
18. Kida, T., Matsumoto, T., Shibata, Y., Takeda, M., Shinohara, A., Arikawa, S.: Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci. 1(298), 253–272 (2003)
19. Knapik, T., Niwinski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Proceedings of FOSSACS 2002. Lecture Notes in Computer Science, vol. 2303, pp. 205–222. Springer, Berlin (2002)
20. Kobayashi, N.: Model-checking higher-order functions. In: Proceedings of PPDP 2009, pp. 25–36. ACM Press, New York (2009)
21. Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages (POPL), pp. 416–428 (2009)
22. Kobayashi, N.: A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes. In: Proceedings of FOSSACS 2011. Lecture Notes in Computer Science, vol. 6604, pp. 260–274. Springer, Berlin (2011)
23. Kobayashi, N.: Model checking higher-order programs. J. ACM 60(3) (2013)
24. Kobayashi, N., Matsuda, K., Shinohara, A.: Functional programs as compressed data. In: Proceedings of PEPM 2012, pp. 121–130. ACM Press, New York (2012)
25. Kobayashi, N., Ong, C.-H.L.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: Proceedings of LICS 2009, pp. 179–188. IEEE Computer Society Press, Los Alamitos (2009)
26. Kobayashi, N., Ong, C.-H.L.: Complexity of model checking recursion schemes for fragments of the modal mu-calculus. Logical Methods in Computer Science 7(4) (2011)
27. Larsson, N.J., Moffat, A.: Offline dictionary-based compression. In: Proc. Data Compression Conference’99 (DCC’99), pp. 296–305. IEEE Computer Society, Los Alamitos (1999)
28. Li, M., Vitányi, P.M.B.: Kolmogorov complexity and its applications. In: Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity, pp. 187–254. MIT Press, Cambridge (1990)
29. Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Texts in Computer Science Springer, Berlin (2009)
30. Lohrey, M., Maneth, S., Mennicke, R.: Tree structure compression with repair. In: Data Compression Conference (DCC 2011), pp. 353–362. IEEE Computer Society, Los Alamitos (2011)
31. Maneth, S., Busatto, G.: Tree transducers and tree compressions. In: Proceedings of FOSSACS 2004. Lecture Notes in Computer Science, vol. 2987, pp. 363–377. Springer, Berlin (2004)
32. Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T., Hashimoto, K.: Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. 410(8–10), 900–913 (2009)
33. Nevill-Manning, C.G., Witten, I.H.: Compression and explanation using hierarchical grammars. Comput. J. 40(2/3), 103–116 (1997)
34. Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS 2006, pp. 81–90. IEEE Computer Society Press, Los Alamitos (2006)
35. Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: ESA’94. Lecture Notes in Computer Science, vol. 855, pp. 460–470. Springer, Berlin (1994)
36. Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1–3), 211–222 (2003)
37. Rytter, W.: Grammar compression, LZ-encodings, and string algorithms with implicit input. In: ICALP’04. Lecture Notes in Computer Science, vol. 3142, pp. 15–27. Springer, Berlin (2004)
38. Sakamoto, H.: A fully linear-time approximation algorithm for grammar-based compression. J. Discrete Algorithms 3(2–4), 416–430 (2005)
39. Sakamoto, H., Maruyama, S., Kida, T., Shimozono, S.: A space-saving approximation algorithm for grammar-based compression. IEICE Trans. Inf. Syst. E 92-D(2), 158–165 (2009)
40. Somers, H.L.: Review article: example-based machine translation. Mach. Transl. 14(2), 113–157 (1999)
41. Statman, R.: The typed lambda-calculus is not elementary recursive. Theor. Comput. Sci. 9, 73–81 (1979)
42. Stirling, C.: Decidability of higher-order matching. Log. Methods Comput. Sci. 5(3) (2009)
43. Storer, J.: NP-completeness results concerning data compression. Technical Report 234, Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ (1997)
44. Takano, A., Meijer, E.: Shortcut deforestation in calculational form. In: Proceedings of the Seventh International Conference on Functional Programming Languages and Computer Architecture, FPCA’95, pp. 306–313. ACM, New York (1995)
45. Terui, K.: Semantic evaluation, intersection types and complexity of simply typed lambda calculus. In: 23rd International Conference on Rewriting Techniques and Applications (RTA’12). LIPIcs, vol. 15, pp. 323–338. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2012)
46. Tozawa, A.: XML type checking using high-level tree transducer. In: Functional and Logic Programming, 8th International Symposium (FLOPS 2006). Lecture Notes in Computer Science, vol. 3945, pp. 81–96. Springer, Berlin (2006)
47. Tromp, J.: Binary lambda calculus and combinatory logic. In: Claude, C.S. (ed.) Randomness and Complexity, from Leibniz to Chaitin, pp. 237–260. World Scientific, Singapore (2008)
48. Tsukada, T., Kobayashi, N.: Untyped recursion schemes and infinite intersection types. In: Proceedings of FOSSACS 2010. Lecture Notes in Computer Science, vol. 6014, pp. 343–357. Springer, Berlin (2010)
49. van Bakel, S.: Complete restrictions of the intersection type discipline. Theor. Comput. Sci. 102(1), 135–163 (1992)
50. van Bakel, S.: Intersection type assignment systems. Theor. Comput. Sci. 151(2), 385–435 (1995)
51. Vytiniotis, D., Kennedy, A.: Functional pearl: every bit counts. In: Proceedings of ICFP 2010, pp. 15–26 (2010)