矜持
发表于 2025-3-21 16:11:50
书目名称Mathematics of Program Construction影响因子(影响力)<br> http://impactfactor.cn/2024/if/?ISSN=BK0626967<br><br> <br><br>书目名称Mathematics of Program Construction影响因子(影响力)学科排名<br> http://impactfactor.cn/2024/ifr/?ISSN=BK0626967<br><br> <br><br>书目名称Mathematics of Program Construction网络公开度<br> http://impactfactor.cn/2024/at/?ISSN=BK0626967<br><br> <br><br>书目名称Mathematics of Program Construction网络公开度学科排名<br> http://impactfactor.cn/2024/atr/?ISSN=BK0626967<br><br> <br><br>书目名称Mathematics of Program Construction被引频次<br> http://impactfactor.cn/2024/tc/?ISSN=BK0626967<br><br> <br><br>书目名称Mathematics of Program Construction被引频次学科排名<br> http://impactfactor.cn/2024/tcr/?ISSN=BK0626967<br><br> <br><br>书目名称Mathematics of Program Construction年度引用<br> http://impactfactor.cn/2024/ii/?ISSN=BK0626967<br><br> <br><br>书目名称Mathematics of Program Construction年度引用学科排名<br> http://impactfactor.cn/2024/iir/?ISSN=BK0626967<br><br> <br><br>书目名称Mathematics of Program Construction读者反馈<br> http://impactfactor.cn/2024/5y/?ISSN=BK0626967<br><br> <br><br>书目名称Mathematics of Program Construction读者反馈学科排名<br> http://impactfactor.cn/2024/5yr/?ISSN=BK0626967<br><br> <br><br>
Ablation
发表于 2025-3-21 23:24:44
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.
爆炸
发表于 2025-3-22 01:49:36
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.
奖牌
发表于 2025-3-22 05:54:06
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
发表于 2025-3-22 12:14:29
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.
同谋
发表于 2025-3-22 13:14:40
(Relational) programming laws in the boom hierarchy of types,ormalism” (see ) and the “Dijkstra-Feijen calculus” (see )..The current paper forms an abridged, though representative, version of a complete account of the algebraic properties of the Boom hierarchy of types . Missing is an account of extensionality and the so-called cross-product.
sacrum
发表于 2025-3-22 18:03:00
http://reply.papertrans.cn/63/6270/626967/626967_7.png
不透气
发表于 2025-3-23 00:25:23
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
发表于 2025-3-23 01:53:09
http://reply.papertrans.cn/63/6270/626967/626967_9.png
Overstate
发表于 2025-3-23 05:56:45
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.