论文标题
走向计算机空间的代数
Towards an Algebra of Computon Spaces
论文作者
论文摘要
组成性是处理复杂性的关键特性，从不同领域的许多角度研究了复杂性。特别是，自计算机科学成立以来，已经对单个计算（或程序）的组成进行了广泛的研究。与现有的组成理论不同，本文提出了一个代数模型，而不是为了组成单个程序，而是用于归纳构成顺序和/或并行构造的空间。我们特别描述了所提出的模型的语义，并提出了一个抽象的示例以证明其应用。
Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since the inception of computer science. Unlike existing composition theories, this paper presents an algebraic model not for composing individual programs but for inductively composing spaces of sequential and/or parallel constructs. We particularly describe the semantics of the proposed model and present an abstract example to demonstrate its application.
