可拓基元的形式化表示与实现

Formative Representation and Implementation of Extension Basic-Element

研究用广义表存储物元、事元、关系元以及复合元的方法,以及广义表作为数据结构表示基元时,基本的基元可拓变换的算法实现。研究基元的形式化可以巩固可拓学在计算机中的实现基础,为编程提供了新的思路。

This paper researches on the method of representing matter-element, affair-element, relation-element and corn pound-element with generalized list. It also studies on the algorithm of basic-element extension transformation. The re search of basic-element formalization can solidify the foundation of implementing extension theory with computer and pro vide new thought to extension programming.