Program transformation in meta programming environment

元编程环境中的程序转换

• 批准号: 62580038
• 负责人: IDA Tetsuo
• 金额: $ 1.47万
• 依托单位: University of Tsukuba
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for General Scientific Research (C)
• 财政年份: 1987
• 资助国家: 日本
• 起止时间: 1987 至 1988
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-62580038/
• 关键词: meta- programming; type inference; 酸素不定比性; ビスマス陽イオンの価電状態; 高温結晶構造; 中性子線・X線粉末回折; 相転移; リートベルト解析; 中性子線; X線粉末回折; X線回折; 中性子線回折; ビスマス酸化物

We are developing a system called meta computing environment, in which several computation models coexist sharing common resources including stacks and heap. Presently MC comprises two models, namely reduction and resolution based models. LISP and Prolog are constructed on each models. We observe program transformations play an important role in reasoning about programs, especially so when we are interested in meta-theorems of programs.Our results are summarized in the following points. (i) Development of program transformation schemes in functional programs and application of the schemes to compilation of LISP programs. LISP compiler successively transform programs; first LISP-to-LISP, then LISP to categorical expressions and finally code sequences of an abstract machine. The process of the transformations are formally described. (ii) Development of type inference system for LISP programs. Prototype implementation of a type inference system is constructed; it serves as a front end processor which generates typed LISP programs. (iii) Methodologies for meta programming. Since meta computing environment has LISP and Prolog, we used features of the both in performing researches outlined in (i) and (ii). Pattern matching and backtracking are taken advantage of in program transformation on one hand, and on the other hand programs with more refined control structures are expressed in LISP.

我们正在开发一个称为元计算环境的系统，其中多个计算模型共存，共享公共资源，包括堆栈和堆。目前MC包括两种模型，即基于缩减的模型和基于分辨率的模型。 LISP 和 Prolog 是在每个模型上构建的。我们观察到程序转换在程序推理中发挥着重要作用，特别是当我们对程序的元定理感兴趣时。我们的结果总结为以下几点。 (i) 开发功能程序中的程序转换方案并将该方案应用于 LISP 程序的编译。 LISP编译器依次变换程序；首先是 LISP 到 LISP，然后是 LISP 到分类表达式，最后是抽象机的代码序列。正式描述了转换的过程。 (ii) 开发 LISP 程序的类型推断系统。构建了类型推断系统的原型实现；它充当生成类型化 LISP 程序的前端处理器。 (iii) 元编程方法。由于元计算环境有 LISP 和 Prolog，因此我们在进行 (i) 和 (ii) 中概述的研究时使用了两者的特性。一方面在程序转换中利用模式匹配和回溯，另一方面用LISP表达具有更精细控制结构的程序。

项目成果

A.Yamanaka: KENS Report(National Lab.for High-Energy Phys.). VII. 36-37 (1989)

A.Yamanaka：KENS 报告（国家高能物理实验室）。

Tetuo Ida: "An Interpretation of LISP by the Lambda Calculus and Cartesian Closed Categories with Implementation Consideration" Computer Software. 4. 33-44 (1987)

Tetuo Ida：“通过 Lambda 演算和笛卡尔闭范畴对 LISP 的解释，并考虑实现”计算机软件。

A.Yamanaka: KENS Report(National Lab.for High-Energy Phys.). VII. 36-37 (1989)

A.Yamanaka：KENS 报告（国家高能物理实验室）。

H.Kusuhara: Jpn.J.Appl.Phys.(1989)

H.Kusuhara: Jpn.J.Appl.Phys.(1989)

H.Hashizume: Rev.Sci.Instrum.(1989)

H.Hashizume：Rev.Sci.Instrum.(1989)