NORMAL FUNCTORS, POWER-SERIES AND LAMBDA-CALCULUS
NORMAL FUNCTORS, POWER-SERIES AND LAMBDA-CALCULUS
复制标题
DOI：
10.1016/0168-0072(88)90025-5
复制
发表时间：
1988-02-01
影响因子：
0.8
通讯作者：
GIRARD, JY
中科院分区：
文献类型：
--
作者：
GIRARD, JY
让我们简单地说，对于通常的数据类型，这是有合理意义的：某些组合代表了计算的通常输出，而一般组合只是这些通常输出的形式叠加：如果我们想到并行程序，那么这种叠加就很自然地考虑（然后多重性的顺序计算获得答案的方法的数量：通常在并行“或”的情况下，如果我们有一个表示“真”的原子状态 T，则 Tar= 2·T，因为有两种方法来计算值...），而且也是随机程序，我们可以根据执行过程中做出的随机选择考虑所有可能输出的叠加。第 4 节的结果相当差，给出了如何解释该框架中的递归函数的一些想法。
Let us say shortly that for the usual types of data, this makes a reasonable sense: certain combmations represent the usual outputs of computations, and general combinations are just formal superpositions of these usual outputs: such superpositions are made natural to consider if we think of parallel programs (then orders of multiplicity count the number of ways of getting the answer: typically in the case of the parallel ‘or’, if we have an atomic state T for ‘true’, then Tar= 2● T, because there are two ways to compute the value...), but also of random programs, where we can consider the superposition of all possible outputs depending on the random choices made during the execution. Section 4 which is quite poor in results, gives some idea how to interpret recursive functions in that framework.