An Efficient Staging Algorithm for Binding-Time Analysis  (Make Corrections)  
Takuma Murakami, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi

 @ NUS   Home/Search   Context   Related

 
View or download:
ipl.t.utokyo.ac.j...str03murakami.pdf
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  ipl.t.utokyo.ac.jp/~hu/pu...tech (more)
Homepages:  Z.Hu  HPSearch  (Update Links)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Binding-Time Analysis (BTA)... (Update)


Active bibliography (related documents):   More   All
0.8:   An Efficient Staging Algorithm for Binding-Time Analysis - Murakami, Hu, Kakehi..   (Correct)
0.7:   An Optimal Staging Algorithm - Murakami, Hu, Takeichi   (Correct)
0.2:   Evolving Domain Specific Languages - Project Summary We   (Correct)

Similar documents based on text:   More   All
0.5:   An Algebraic Interface for GETA Search Engine - Murakami, Hu, Nishioka..   (Correct)
0.4:   A Programmable Editor for Developing Structured Documents.. - Hu, Mu, Takeichi (2004)   (Correct)
0.4:   A Tutorial Implementation of the Diffusion Algorithmic.. - LOULERGUE, HU, KAKEHI (2004)   (Correct)

BibTeX entry:   (Update)

@misc{ murakami-efficient,
  author = "Takuma Murakami and Zhenjiang Hu and Kazuhiko Kakehi and Masato Takeichi",
  title = "An Efficient Staging Algorithm for Binding-Time Analysis",
  url = "citeseer.comp.nus.edu.sg/659273.html" }
Citations (may not include all citations):
638   Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
108   Introduction to Functional Programming using Haskell (context) - Bird - 1998
104   Algebra of Programming (context) - Bird, de Moor - 1997
65   Binding Time Analysis for Higher Order Untyped Functional La.. (context) - Consel - 1990
56   An Introduction to Partial Evaluation (context) - Jones - 1996
15   Using MetaML: A Staged Programming Language (context) - Sheard - 1998
13   cient Type Inference for Higher-Order Binding-Time Analysis (context) - Henglein - 1991
10   Fast Binding-Time Analysis for Multi-Level Specialization (context) - Gluck, Jrgensen - 1996
10   Make it Practical: A Generic LinearTime Algorithm for Solvin.. - Sasano, Hu et al. - 2000
7   Search-Based Binding Time Analysis using Type-Directed Pruni.. - Sheard, Linger - 2002
3   cient Programs for Solving Maximum Multi-Marking Problems (context) - Sasano, Hu et al. - 2001

Documents on the same site (http://www.ipl.t.u-tokyo.ac.jp/~hu/pub/tech.html):   More
Towards Manipulation of Mutually Recursive Functions - Iwasaki, Hu, Takeichi (1998)   (Correct)
Diffusion: Calculating Efficient Parallel Programs - Hu, Takeichi, Iwasaki (1999)   (Correct)
Tupling Calculation Eliminates Multiple Data Traversals - Hu, Iwasaki, Takeichi, Takano (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.