Fundamental Ideas of Computer Science
Fundamental Ideas of Computer Science
复制标题
计算机科学的基本思想
DOI：
--
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
Andreas Schwill
中科院分区：
文献类型：
--
作者：
Andreas Schwill
数据类型水平标准：用于所有形式的指定对象，强调操作及其属性，而不涉及实现。垂直准则：（P）自然数可以定义为一个抽象数据类型，常量为1，操作为+1和-1。积木世界也是如此：桌子上有许多可能堆积的积木。操作是将一个块放到另一个块上，并测试一个块是否位于另一个块上，或者它是否立即位于表上。是否有可能通过这些操作来建立任何情况（完整性的想法）？(S1)上面提到的两个例子在这里可以做得更精确。关于抽象数据类型的一致性和完整性的问题可能随之而来。在积木世界中，哪些定律适用于操作？(S2)在这个层次上，抽象数据类型的正式符号可以使用更复杂的例子（堆栈，队列，文件）来引入。随后可审议执行问题。判断标准：一种类似于抽象数据类型的方法出现在通过指定其行为来构造机器的过程中。特别是，这一原则与公开招标有关，公开招标只规定了对象的“抽象”行为，而没有提到任何特定于合格生产者的“实现”。现在，它仍然显示如何在计算机科学的历史发展中出现的想法（时间标准）。自1950年以来，计算机科学的一些重要阶段在图中示出。10到12岁验证，非确定性（Floy d）验证（Hoare）1950
data type . Horizontal criterion: Used in all forms of specifying objects that stress operations and their properties without relating to an implementation. Vertical criterion: (P) The natural numbers may be defined as an abstract data type with constants 1 and operations +1 and -1. The same holds for the blocks world: On a table there is a number of blocks that may be piled up. Operations are putting one block onto another one and testing whether a block lies on another one or whether it lies immediately on the table. Is it possible to establish any situation by these operations (idea of completeness)? (S1) The two examples mentioned above may be made more precise here. Problems concerning consistency and completeness of an abstract data type may follow. Which laws hold for the operations in the blocks world? (S2) On this level a formal notation for abstract data types may be introduced using more complex examples (stack, queue, file). Considerations on implementation may follow. Criterion of sense: An approach similar to abstract data types appears in constructing a machine by specifying its behaviour. In particular, this principle is relevant in open calls for tenders that only specify the „abstract“ behaviour of the object without mentioning any „implementations“ specific for an eligible producer. Now it remains to show how ideas occur in the historical development of computer science (criterion of time). Some important stages of computer science since 1950 are illustrated in Figs. 10 through 12. verification, nondeterminism (Floy d) verification (Hoare) 1950