Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Masato Takeichi Home Page
[go: Go Back, main page]

[Click Here for Japanese version]

Professor  Masato Takeichi, PhD. 

Information Processing Laboratory

Department of Mathematical Informatics
School of Information Science and Technology, University of Tokyo

Address: Department of Mathematical Informatics, School of Information Science and Technology, University of Tokyo, Bunkyo-ku, Tokyo 113-8656, Japan

Telephone: +81-3-5841-7430 / Mobile Phone: +81-90-3231-0057 / Fax: +81-3-5841-8597

E-mail: takeichi@mist.i.u-tokyo.ac.jp

Web: http://www.ipl.t.u-tokyo.ac.jp/~takeichi/

Current Research Interests:

l        Functional Programming

l        Calculational Program Transformation

l        Programmable Structured Document System

Publications (Missing numbered papers are written in Japanese)

[1] E. Wada, K. Kakehi and M. Takeichi. An Analysis of Program Making. Conf. on Proc. IFIP Programming Teaching Techniques, pp.127-136, North-Holland, 1972.

[2] M. Takeichi. Name Identification for Languages with Explicit Scope Control. Journal of Information Processing 5(1), pp.45-49, 1982.

[3] M. Takeichi. Consistent Annotations for Scope Rules. Journal of Information Processing 5(2), pp.106-112, 1982.

[4] M. Takeichi. An Alternative Scheme for Evaluating Combinator Expressions. Journal of Information Processing 7(4), pp.246-253, 1985.

[5] M. Takeichi. Inserting Injection Operations to Denotational Specifications. New Generation Computing 4(4), pp.365-381, 1986.

[6] M. Takeichi. Partial Parametrization Eliminates Multiple Traversals of Data Structures. Acta Informatica 24(1), pp.57-77, 1987.

[7] M. Takeichi. Lambda-Hoisting - A Transformation Technique for Fully Lazy Evaluation of Functional Programs. New Generation Computing 5(4), pp.377-391, 1988.

[8] M. Takeichi and Y. Akama. Deriving a Functional Knuth-Morris-Pratt Algorithm by Transformation. Journal of Information Processing 13(4), pp.522-528, 1990.

[9] L. Husheng and M. Takeichi. Preliminary Arrangements of Arguments in Lazy Evaluation. New Generation Computing 9(2), pp.135-147, 1991.

[10] K. Kaneko and M. Takeichi. Relationship between Lambda Hoisting and Fully Lazy Lambda Lifting. Journal of Information Processing 15(4), pp.564-569,1992.

[11] K. Kaneko and M. Takeichi. Derivation of a Knuth-Morris-Pratt Algorithm by Fully Lazy Partial Computation. Advances in Software Science and Technology 5, pp.11-24, 1993.

[13] L. Xu, H. Iwasaki and M. Takeichi. Derivation of Algorithms by Introduction of Generation Functions. New Generation Computing 13(1), pp.75-98, 1994.

[14] K. Kaneko and M. Takeichi. Derivation of Efficient Pattern Matching Algorithms by Fully Lazy Evaluation with Lazy Memo-ization. Transaction of Information Processing Society of Japan 35(11), pp.2347-2354,1994.

[15] Z. Hu, H. Iwasaki and M. Takeichi. Deriving Structural Hylomorphisms from Recursive Definitions. ACM International Conference on Functional Programming (ICFP’96), pp.73-82, 1996.

[16] Z. Hu, H. Iwasaki and M. Takeichi. Formal Derivation of Parallel Program for 2-dimensional Maximum Segment Sum Problem. Annual European Conference in Parallel Processing (Euro-Par’96), Springer LNCS 1123, pp.553-562, ENS Lyon, France, August 1996.

[17] Z. Hu, H. Iwasaki and M. Takeichi. Construction of List Homomorphisms via Tupling and Fusion. 21st International Symposium on Mathematical Foundation of Computer Science (MFCS ‘96), Springer LNCS 1113, pp.407-418, Cracow, September 1996.

[19] Z. Hu, H. Iwasaki and M. Takeichi. Cheap Tupling in Calculational Form. 8th International Symposium on Programming Languages, Implementations, Logics, and Programs, Springer LNCS 1140, pp.471-472, September 1996.

[20] Z. Hu, H. Iwasaki and M. Takeichi. An Extension of the Acid Rain Theorem. Proc. The Second Fuji International Workshop on Functional and Logic Programming, pp.91-105, World Scientific, November 1996.

[21] Y. Onoue, Z. Hu, H. Iwasaki and M. Takeichi. A Calculational Fusion System HYLO. Proc. IFIP TC 2 Working Conference on Algorithmic Languages and Calculi. Le Bischenberg, France. February 1997, pp.76-106. Chapman&Hall.

[22] Z. Hu, H. Iwasaki, M. Takeichi and A. Takano. Tupling Calculation Eliminates Multiple Data Traversals. 2nd ACM SIGPLAN International Conference on Functional Programming (ICFP’97), pp.164-175, Amsterdam, The Netherlands, June 1997. ACM Press.

[23] Z. Hu, H. Iwasaki and M. Takeichi. Formal Derivation of Efficient Parallel Programs by Construction of List Homomorphisms. ACM Transactions on Programming Langauges and Systems 19(3), pp.444-461, 1997.

[24] L. Xu, M. Takeichi and H. Iwasaki. Relational Semantics for Locally Nondeterministic Programs. New Generation Computing 15, pp.339-362, 1997.

[25] Z. Hu and M. Takeichi. A Calculational Framework for Parallelization of Sequential Programs. Proc. IPSJ International Symposium on Information Systems and Technologies for Network Society, Fukuoka, Japan, September 1997, pp. 102-109. World Scientific.

[26] Z. Hu, M. Takeichi and W-N.Chin. Parallelization in Calculational Forms. Proc.  25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California, USA, January 1998, pp. 316-328. ACM Press.

[27] H. Iwasaki, Z. Hu and M. Takeichi. Towards Manipulation of Mutually Recursive Functions. The third Fuji International Symposium on Functional and Logic Programming, Kyoto, Japan, April 1998, pp. 61-79. World Scientific.

[29] A. Takano, Z. Hu and M. Takeichi. Program Transformation in Calculational Form. ACM Computing Surveys 30(3). A special issue for 1998 Symposium on Partial Evaluation (SOPE’98).

[32] Z. Hu, M. Takeichi and H. Iwasaki. Diffusion: Calculating Efficient Parallel Programs. Proc. 1999 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM’99), pp. 85-94. San Antonio, Texas, January 22-23, 1999.

[33] Z. Hu and M. Takeichi. Calculating an Optimal Homomorphic Algorithm for Bracket Matching. Parallel Processing Letters 9(3), pp.335-345, 1999.

[34] Z. Hu, H. Iwasaki and M. Takeichi. Calculating Accumulations. New Generation Computing 17(2), pp.153-173, 1999.

[35] T. Hayashi, S. Yamasaki, N. Morita, H. Aida, M. Takeichi, N. Doi. Effects of IP packet loss and picture frame reduction on MPEG1 subjective quality. IEEE-MMSP’99.

[36] Z. Hu, W.N. Chin, M. Takeichi. Calculating a New Data Mining Algorithm for Market Basket Analysis. Second International Workshop on Practical Aspects of Declarative Languages (PADL’00), Boston, Massachusetts, January 17-18, 2000. LNCS 1753, Springer Verlag. pp. 169-184.

[40] W.N.Chin, S.C.Khoo, Z. Hu, M. Takeichi. Deriving Parallel Codes via Invariants. International Static Analysis Symposium 2000 (SAS2000), University of California, June 2000, LNCS 1824, Springer Verlag, pp.75-94, 2000.

[41] I.Sasano, Z. Hu, M. Takeichi, M.Ogawa. Make it Practical: A Generic Linear-Time Algorithm for Solving Maximum-Weightsum Problems. The 2000 ACM SIGPLAN International Conf. on Functional Programming (ICFP'00), Montreal, Canada, September 2000. ACM Press, pp.137-149, 2000.

[42] M.Takeichi and Z.Hu. Calculation Carrying Programs: How to code Program Transformation. (Invited Talk). International Symposium on Principles of Software Evolution (ISPSE 2000), Kanazawa, November 1-2, 2000. IEEE Computer Society, pp.250-259.

[43] K. Tanaka-Ishii and Y.Inutsuka and M.Takeichi. Japanese Text Input System With Digits --Can Japanese text be estimated only from consonants?- . Proceedings of Human Language Technology Conference 2001(HLT 2001), to appear, 2001.

[47] Isao Sasano, Zhenjiang Hu, Masato Takeichi, Generation of Efficient Programs for Maximum Multi-Marking Problems, ACM SIGPLAN Workshop on Semantics, Applications and Implementation of Program Generation ( SAIG'01), Firenze, Italy, September 6th, 2001. Lecture Notes in Computer Sciencce 2196, pp.72-91. Springer Verlag.

[48] Z. Hu, W-N. Chin and M. Takeichi. Calculating a New Data Mining Algorithm for Market Basket Analysis, Journal of Functional and Logic Programming, 2001, No.8, October, 2001.

[49]Yusuke Inutsuka, Kumiko Tanaka-Ishii, Masato Takeichi. Thai Input System with Digits, NLPRS, pp.579-584, November 2001.

[50]Kumiko Tanaka-Ishii, Yusuke Inutsuka, Masato Takeichi. Personalization of Text Entry Systems for Mobile Phones, NLPRS, pp.177-184, November 2001.

[51] Haiyan Zhao, Zhenjiang Hu, Masato Takeichi, Multidimensional Searching Trees with Minimum Attribute, Computer Software (JSSST), Vol.19, No.1, 2002. pp.22-28.

[52] Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi, An Accumulative Parallel Skeleton for All , to appear in European Symposium on Programming ( ESOP 2002), Grenoble, France, April 6 - 14, 2002. Lecture Notes in Computer Science, Springer Verlag.

[53] Kumiko Tanaka-Ishii, Yusuke Inutsuka, Masato Takeichi. Entering Text using A Four Button Device. COLING 2002, pp.988-994.

[54]Zhenjiang Hu, Tomonari Takahashi, Hideya Iwasaki, Masato Takeichi, Segmented Diffusion Theorem (invited paper), 2002 IEEE International Conference on Systems, Man and Cybernetics

[57] Haiyan Zhao, Zhenjiang Hu, Masato Takeichi, A Compositional Framework for Mining Longest Ranges, The 5th International Conference on Discovery Science (DS 2002), Lubeck, Germany, November 24-26, 2002. Lecture Notes in Artificial Intelligence, Springer Verlag.

[58] Kumiko Tanaka-Ishii , Yusuke Inutsuka, Masato Takeichi. Entering Text using A Four Button Device, The 19th International Conference on Computational Linguistics. pp.988-994, 2002.