Evaluating Portable Mechanisms for Legitimate Execution Stack Access with a Scheme Interpreter in an Extended SC Language

  • Yasugi Masahiro
    Department of Artificial Intelligence, Kyushu Institute of Technology
  • Ikeuchi Reichi
    Department of Artificial Intelligence, Kyushu Institute of Technology
  • Hiraishi Tasuku
    Academic Center for Computing and Media Studies, Kyoto University
  • Komiya Tsuneyasu
    Graduate School of Informatics and Engineering, The University of Electro-Communication

この論文をさがす

抄録

<p>Scheme implementations should be properly tail-recursive and support garbage collection. To reduce the development costs, a Scheme interpreter called JAKLD, which is written in Java, was designed to use execution stacks simply. JAKLD with interchangeable garbage collectors was reimplemented in C. In addition, we have proposed an efficient C-based implementation written in an extended C language called XC-cube, which features language mechanisms for implementing high-level programming languages such as “L-closures” for legitimate execution stack access, with which a running program/process can legitimately access data deeply in execution stacks (C stacks). L-closures are lightweight lexical closures created from nested function definitions. In addition to enhanced C compilers, we have portable implementations of L-closures, which are translators from an extended S-expression based C language into the standard C language. Furthermore, we have another mechanism for legitimate execution stack access, called “closures”. Closures are standard lexical closures created from nested function definitions. Closures can also be implemented using translators. In this study, JAKLD was reimplemented in an extended SC language (S-expression based C language) that features nested functions to evaluate (L-)closures and their implementations, including translators.</p>

収録刊行物

被引用文献 (1)*注記

もっと見る

参考文献 (8)*注記

もっと見る

関連プロジェクト

もっと見る

詳細情報

問題の指摘

ページトップへ