论文信息 - Algorithms and algebra

Algorithms and algebra

The algebraic definition of an algorithm given above is wider than the classical one. It is an abstract definition based on a signature only, and allows interpretation by any computational structure of this signature. Even introducing a set of properties does not necessarily determine the interpretation completely. This freedom is an advantage, it allows to treat a number of related algorithms under one single roof. Moreover, even for a given monomorphic type algorithms can be non-deterministic. This freedom allows to go to special descendants which show increased efficiency, including deterministic ones.

Friedrich L. Bauer | F. L. Bauer

[1] Andrei P. Ershov,et al. On the Essence of Compilation , 1977, Formal Description of Programming Concepts.

[2] Manfred Broy. Transformation parallel ablaufender Programme , 1980 .

[3] M. Nivat. On the interpretation of recursive program schemes , 1974 .

[4] Peter Henderson,et al. A lazy evaluator , 1976, POPL.

[5] John V. Guttag,et al. The specification and application to programming of abstract data types. , 1975 .

[6] John McCarthy,et al. Towards a Mathematical Science of Computation , 1962, IFIP Congress.

[7] Edsger W. Dijkstra,et al. Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[8] Daniel P. Friedman,et al. CONS Should Not Evaluate its Arguments , 1976, ICALP.

[9] Friedrich L. Bauer,et al. Detailization and Lazy Evaluation, Infinite Objects and Pointer Representation , 1978, Program Construction.

[10] S. Maclane,et al. Categories for the Working Mathematician , 1971 .

[11] S. Lane. Categories for the Working Mathematician , 1971 .

[12] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .