Previous computation models either have equivalent abilities in representing
all computations but fail to provide primitive operators for programming
complex algorithms or lack generalized expression ability to represent
newly-added computations. This article presents a unified computation model
with generalized expression ability and a concise set of primitive operators
for programming high-level algorithms. We propose a unified data abstraction --
Tensor of List, and offer a unified computation model based on Tensor of List,
which we call the ToL model (in short, ToL). ToL introduces five atomic
computations that can represent any elementary computation by finite
composition, ensured with strict formal proof. Based on ToL, we design a
pure-functional language -- ToLang. ToLang provides a concise set of primitive
operators that can be used to program complex big data and AI algorithms. Our
evaluations show ToL has generalized expression ability and a built-in
performance indicator, born with a strictly defined computation metric --
elementary operation count (EOPs), consistent with FLOPs within a small error
range.

本文提出了一个称为 Tensor of List (ToL) 的统一计算模型，其提供了广义表达能力和一组简洁的原始操作符以用于高级算法设计。ToL 通过五种原子计算操作，能够以有限组合的方式表示任何基本计算，加上在 ToLang 中提供的一组原始操作符，可用于编程复杂的大数据和人工智能算法。我们还讨论了 ToL 的性能评估，其中包括一个内置计算度量标准 —— 基本操作数（EOPs）和 FLOPs 之间一个小误差范围的一致性。