Titlebook: Mathematics of Program Construction; Second International R. S. Bird,C. C. Morgan,J. C. P. Woodcock Conference proceedings 1993 Springer-Ve

矜持

書目名稱Mathematics of Program Construction影響因子(影響力)




書目名稱Mathematics of Program Construction影響因子(影響力)學科排名




書目名稱Mathematics of Program Construction網絡公開度




書目名稱Mathematics of Program Construction網絡公開度學科排名




書目名稱Mathematics of Program Construction被引頻次




書目名稱Mathematics of Program Construction被引頻次學科排名




書目名稱Mathematics of Program Construction年度引用




書目名稱Mathematics of Program Construction年度引用學科排名




書目名稱Mathematics of Program Construction讀者反饋




書目名稱Mathematics of Program Construction讀者反饋學科排名

Ablation

An algebraic construction of predicate transformers,ively weaker ones in the categories of relations and predicate transformers. In addition, it has exposed two complete rules for the refinement and composition of specifications in Morgan‘s refinement calculus.

爆炸

Solving optimisation problems with catamorphisms,n terms of a relational catamorphism, can be solved by means of a functional catamorphism. The result is illustrated with a derivation of Kruskal‘s algorithm for finding a minimum spanning tree in a connected graph.

獎牌

A time-interval calculus,the calculus is compared with Tarski‘s calculus of relations. Then states and duration are introduced and a case study is provided. Finally the connection with the duration calculus and other temporal logics is shown.

Bronchial-Tubes

Upwards and downwards accumulations on trees,replace each element of a tree with some function—in fact, some homomorphism—of that element‘s descendants and of its ancestors, respectively. These two operations can be thought of as passing information up and down the tree..We introduce these two accumulations, and show how together they solve the so-called prefix sums problem.

同謀

(Relational) programming laws in the boom hierarchy of types,ormalism” (see [22]) and the “Dijkstra-Feijen calculus” (see [15])..The current paper forms an abridged, though representative, version of a complete account of the algebraic properties of the Boom hierarchy of types [19, 18]. Missing is an account of extensionality and the so-called cross-product.

sacrum

不透氣

Designing arithmetic circuits by refinement in Ruby,e consequence of decisions made (and explained) in terms of the abstract algorithm. The systematic derivation serves both as an explanation of the circuit, and as a demonstration that it is correct ‘by construction’. We believe that the technique is applicable to a wide range of similar algorithms.

Limerick

Overstate

Logical specifications for functional programs, are simply programs in a functional programming language. Development from abstract specifications to programs is calculational..Using logic in the specification language has many advantages. Importantly it allows nondeterministic specifications to be given, and thus does not force overspecification.