ぺた語義：全国大会イベント「2025年実施の大学情報入試への展望」の報告

高校では2022年度から必履修科目「情報I」の学習が始まり，情報教育の充実が図られる．それに基づいて大学入学共通テスト「情報」が加わる方針が示されている．そこで，本会第83回全国大会で開催されたイベント企画「2025年実施の大学情報入試への展望」では，情報教育と情報入試について，これまでの動向と最新情報を提供し，これからの大学情報入試へ向けた展望を議論した．本稿では，本イベントについて報告する

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

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