Skip to main content

3 Result(s)

within Kazuhiko Kakehi Remove this filter Artificial Intelligence Remove this filter Logics and Meanings of Programs Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    An Efficient Staging Algorithm for Binding-Time Analysis

    Binding-Time Analysis (BTA) is one of the compile-time program analyses which is a general framework for program optimization and program generation [1]. The task of BTA is to divide a source program into two ...

    Takuma Murakami, Zhenjiang Hu… in Logic Based Program Synthesis and Transfor… (2004)

  2. No Access

    Chapter and Conference Paper

    On Deforesting Parameters of Accumulating Maps

    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 deforest programs using...

    Kazuhiko Kakehi, Robert Glück… in Logic Based Program Synthesis and Transfor… (2002)

  3. No Access

    Chapter and Conference Paper

    Relating Accumulative and Non-accumulative Functional Programs

    We study the problem to transform functional programs, which intensively use append functions (like inefficient list reversal), into programs, which use accumulating parameters instead (like eficient list reve...

    Armin Kühnemann, Robert Glück, Kazuhiko Kakehi in Rewriting Techniques and Applications (2001)