IO Swapping Leads You There And Back Again (Extended Abstract) ⋆ (2008)
Akimasa Morihata, Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi
TABA (“There And Back Again”) [DG02], proposed by Danvy and Goldberg, is a special but powerful programming pattern where a recursive function traverses lists at return time. Their idea is that...
An Efficient Staging Algorithm for Binding-Time Analysis (2007)
Takuma Murakami, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi
Binding-Time Analysis (BTA) is one of the compile time program analyses which is a general framework for program optimization and program generation [1]. BTA divides a whole program into static and...
Emmanuel Dupoux, Christophe Pallier, Kazuhiko Kakehi, Jacques Mehler
When presented with stimuli that contain illegal consonant clusters, Japanese listeners tend to hear an illusory vowel that makes their perception conform to the phonotactics of their language. In a...
9 On Deforesting Parameters of Accumulating Maps (2007)
Extended Abstract, Kazuhiko Kakehi, Yoshihiko Futamura
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is the inability to...
An Efficient Staging Algorithm for Binding-Time Analysis (2007)
Takuma Murakami, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi
Binding-Time Analysis (BTA) is one of the compile time program analyses which is a general framework for program optimization and program generation [1]. BTA divides a whole program into static and...
An practicable framework for tree reductions under distributed memory environments (2006)
Kazuhiko Kakehi, Kazuhiko Kakehi, Kiminori Matsuzaki, Kiminori Matsuzaki, Kento Emoto, Kento Emoto, ...
The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the...
Swapping arguments and results of recursive functions (2006)
Akimasa Morihata, Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi
Abstract. Many useful calculation rules, such as fusion and tupling, rely on well-structured functions, especially in terms of inputs and outputs. For instance, fusion requires that well-produced...
Systematic derivation of tree contraction algorithms (2005)
Kiminori Matsuzaki, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi
Abstract. While tree contraction algorithms play an important role in efficient tree computation in parallel, it is difficult to develop such algorithms due to the strict conditions imposed on...
A Compositional Framework for Developing Parallel Programs on Two Dimensional Arrays (2005)
Kento Emoto, Kento Emoto, Zhenjiang Hu, Zhenjiang Hu, Kazuhiko Kakehi, Kazuhiko Kakehi, ...
The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the...
A Compositional Framework for Developing Parallel Programs on Two Dimensional Arrays (2005)
Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi
Abstract. Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, but...
❢c World Scientific Publishing Company SYSTEMATIC DERIVATION OF TREE CONTRACTION ALGORITHMS ∗ (2004)
Kiminori Matsuzaki, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi
While tree contraction algorithms play an important role in efficient tree computation in parallel, it is difficult to develop such algorithms due to the strict conditions imposed on contracting...
A Fusion-Embedded Skeleton Library (2004)
Kiminori Matsuzaki, Kazuhiko Kakehi, Hideya Iwasaki, Zhenjiang Hu, Yoshiki Akashi
This paper addresses a new framework for designing and implementing skeleton libraries, in which each skeleton should not only be efficiently implemented as is usually done, but also be equipped with...
Kiminori Matsuzaki, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi
While tree contraction algorithms play an important role in efficient tree computation in parallel, it is difficult to develop such algorithms due to the strict conditions imposed on contracting...
A Fusion-Embedded Skeleton Library (2004)
Kiminori Matsuzaki, Kazuhiko Kakehi, Hideya Iwasaki, Zhenjiang Hu, Yoshiki Akashi
Abstract. This paper addresses a new framework for designing and implementing skeleton libraries, in which each skeleton should not only be efficiently implemented as is usually done, but also be...
A Tutorial Implementation of the Diffusion Algorithmic Skeleton with the BSMLlib Library (2004)
Frederic Loulergue, Frédéric Loulergue, Zhenjiang Hu, Zhenjiang Hu, Kazuhiko Kakehi, Kazuhiko Kakehi
Skeleton programming enables programmers to build parallel programs easier by providing efficient ready-made parallel algorithms. The diffusion skeleton was proposed (associated with a method for...
TreeCalc: towards programmable structured documents (2003)
Masato Takeichi, Zhenjiang Hu, Kazuhiko Kakehi, Yasushi Hayashi, Shin-cheng Mu, Keisuke Nakano
A programmable structured document is a structured document with dynamically calculated components that can be specified by users in a functional programming language. TreeCalc, a tree version of...
List Homomorphism with Accumulation (2003)
Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi
This paper introduces accumulation into list homomorphisms for systematic development of both efficient and correct parallel programs. New parallelizable recursive pattern called is given, and...
Relating accumulative and nonaccumulative functional programs (2001)
Armin Kuhnemann, Kazuhiko Kakehi
Abstract. We study the problem to transform functional programs, which intensively use append functions (like ine#cient list reversal), into programs, which use accumulating parameters instead (like...
On deforesting parameters of accumulating maps (2001)
Kazuhiko Kakehi, Robert Gluck, Yoshihiko Futamura
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is the inability to...
Prelexical Locus Of An Illusory Vowel Effect In Japanese (1999)
Emmanuel Dupoux Takao, Takao Fushimi, Kazuhiko Kakehi, Jacques Mehler
Studies in vision have demonstrated that the visual system can induce the perception of illusory contours. In this study we document a similar phenomenon in the auditory mode: Japanese speakers...