Computer Software
Print ISSN : 0289-6540
Search
Advanced search
OR
Browse
Search
Volume 17, Issue 3
Displaying 1-8 of 8 articles from this issue
Show all abstracts
    • |<
    • <
    • 1
    • >
    • >|
Guest Editorial
Special Paper
  • A General Recursive Form for Graph Traversals and its Transformation
    Isao Sasano, Zhenjiang Hu, Masato Takeichi
    2000 Volume 17 Issue 3 Pages 194-211
    Published: 2000
    Released on J-STAGE: December 26, 2000
    DOIhttps://doi.org/10.11309/jssst.17.194
    JOURNAL FREE ACCESS
    Download PDF (954K)
  • Binding-Time Analysis for a Specializer that Allows Both Static and Dynamic Expressions
    Kenichi Asai
    2000 Volume 17 Issue 3 Pages 212-229
    Published: 2000
    Released on J-STAGE: December 26, 2000
    DOIhttps://doi.org/10.11309/jssst.17.212
    JOURNAL FREE ACCESS
    Download PDF (1012K)
  • Online Type-Directed Partial Evaluation for Dynamically-Typed Languages
    Eijiro Sumii, Naoki Kobayashi
    2000 Volume 17 Issue 3 Pages 230-254
    Published: 2000
    Released on J-STAGE: December 26, 2000
    DOIhttps://doi.org/10.11309/jssst.17.230
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    This article presents an alternative method of type-directed partial evaluation, which is simpler and more efficient than previous methods.Unlike previous methods, it is straightforwardly applicable to functional languages with various powerful type systems.As an extreme instance, this article mainly deals with a dynamically-typed functional language like Scheme.The key idea is to extend primitive value destructors such as function application and pair destruction(car and cdr), so that they generate residual code when their operands are dynamic.It unnecessitates an operation in type-directed partial evaluation called reflection, which was the major cause of complication and inefficiency in previous methods.We formalize our method as an extension of two-level λ-calculus, and prove it correct.Furthermore, we show that our type-directed partial evaluator can be derived from a simple online syntax-directed partial evaluator with higher-order abstract syntax, by the same transformation as an offline programgenerator-generator(cogen)is derived from an offline syntax-directed partial evaluator.This clarifies why type-directed partial evaluation is faster than ordinary syntax-directed partial evaluation, and implies that we can obtain more powerful partial evaluators by replacing the underlying synthax-directed partial evaluator with more sophisticated ones.
    View full abstract
    Download PDF (1094K)
Regular Paper
Short Note
Topics
    • |<
    • <
    • 1
    • >
    • >|
feedback
 Top