Titlebook: Mathematics of Program Construction; Third International Bernhard M?ller Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 199

蝕刻術(shù)

Feckless

ostensible

收到

預(yù)示

https://doi.org/10.1007/3-540-60117-1Formale Methoden; Programmimplementierung; Programmkonstruktionen; Verifikation; algorithm; algorithms; fo

cumber

Geyser

Program construction by parts,or each; then combine all the partly defined programs into a single program that satisfies all the requirements simultaneously. In this paper we introduces a mathematical basis for solving this problem; and we illustrate it by means of a simple example.

anachronistic

An initial-algebra approach to directed acyclic graphs, different ways of constructing the same object. The recursive decomposition of objects of the datatype leads directly to a recursive pattern of computation on those objects, which is very helpful for both functional and parallel programming..We show how to model a particular kind of directed acyclic graph using this initial-algebra approach.

insolence

解決

Conference proceedings 1995ny in July 1995..Besides five invited lectures by distinguished researchers there are presented 19 full revised papers selected from a total of 58 submissions. The general theme is the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding s