標(biāo)題: Titlebook: Mathematics of Program Construction; Second International R. S. Bird,C. C. Morgan,J. C. P. Woodcock Conference proceedings 1993 Springer-Ve [打印本頁(yè)] 作者: 矜持 時(shí)間: 2025-3-21 16:11
書(shū)目名稱Mathematics of Program Construction影響因子(影響力)
書(shū)目名稱Mathematics of Program Construction影響因子(影響力)學(xué)科排名
書(shū)目名稱Mathematics of Program Construction網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Mathematics of Program Construction網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Mathematics of Program Construction被引頻次
書(shū)目名稱Mathematics of Program Construction被引頻次學(xué)科排名
書(shū)目名稱Mathematics of Program Construction年度引用
書(shū)目名稱Mathematics of Program Construction年度引用學(xué)科排名
書(shū)目名稱Mathematics of Program Construction讀者反饋
書(shū)目名稱Mathematics of Program Construction讀者反饋學(xué)科排名
作者: Ablation 時(shí)間: 2025-3-21 23:24
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.作者: 爆炸 時(shí)間: 2025-3-22 01:49
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.作者: 獎(jiǎng)牌 時(shí)間: 2025-3-22 05:54
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 時(shí)間: 2025-3-22 12:14
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.作者: 同謀 時(shí)間: 2025-3-22 13:14
(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 時(shí)間: 2025-3-22 18:03 作者: 不透氣 時(shí)間: 2025-3-23 00:25
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 時(shí)間: 2025-3-23 01:53 作者: Overstate 時(shí)間: 2025-3-23 05:56
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.作者: OMIT 時(shí)間: 2025-3-23 12:58
0302-9743 re is moreand more interestfrom industry in formal methods based on mathematics. Thisinterest has come from the success of a number ofexperiments on real industrial applications. Thus, there isnot only a belief, but alsoevidence, that the study ofcomputer programs as mathematical objects leads to mo作者: Sinus-Node 時(shí)間: 2025-3-23 16:52
Pretty-printing: An exercise in functional programming,se combinators have proved sufficiently efficient and expressive for quite extensive practical use. The combinators are simple to specify and enjoy many algebraic properties. The algebra is useful for reasoning about pretty-printers that use the library, and played an important role in deriving its implementations.作者: CANDY 時(shí)間: 2025-3-23 18:13 作者: 親密 時(shí)間: 2025-3-23 23:08
978-3-540-56625-0Springer-Verlag Berlin Heidelberg 1993作者: 套索 時(shí)間: 2025-3-24 02:31
Mathematics of Program Construction978-3-540-47613-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: installment 時(shí)間: 2025-3-24 07:16 作者: ADORN 時(shí)間: 2025-3-24 13:42 作者: Orthodontics 時(shí)間: 2025-3-24 17:56
Programming for behaviour,Traditional programming is for computations. Many contemporary applications suffer when squeezed into programming paradigm. This presentation investigates desirable properties of another paradigm: programming for behaviours and explores some technical consequences of a possible formalism to describe such programs.作者: 1FAWN 時(shí)間: 2025-3-24 19:53 作者: Conscientious 時(shí)間: 2025-3-25 02:48
Shorter paths to graph algorithms,We illustrate the use of formal languages and relations in compact formal derivations of some graph algorithms.作者: 熱情贊揚(yáng) 時(shí)間: 2025-3-25 04:28
Extended calculus of constructions as a specification language,f the second component depends on the value of the first one. This calculus has been implemented as ‘Lego’ by Pollack. The system and documentation is obtainable thus: ftp ftp.dcs.ed.ac.uk cd export/lego, after which one should read the file README..The sigma types enable one to give a compact descr作者: 感激小女 時(shí)間: 2025-3-25 08:02
Pretty-printing: An exercise in functional programming,se combinators have proved sufficiently efficient and expressive for quite extensive practical use. The combinators are simple to specify and enjoy many algebraic properties. The algebra is useful for reasoning about pretty-printers that use the library, and played an important role in deriving its 作者: maculated 時(shí)間: 2025-3-25 15:21 作者: 厚顏無(wú)恥 時(shí)間: 2025-3-25 17:38 作者: 貪婪性 時(shí)間: 2025-3-25 22:01
Conservative fixpoint functions on a graph,irected graph is to be computed, being defined as a least fixed point of some monotonic operator. If this operator satisfies a certain restriction with respect to its image for a differential change in its argument, it is called conservative, and an elegant general solution may be derived. It is sti作者: 漫不經(jīng)心 時(shí)間: 2025-3-26 01:36
An algebraic construction of predicate transformers, to the standard algebraic construction of the integers from the natural numbers. The same construction yields the category of relations from the category of total functions. This provides a mechanism through which the rich type structure of the category of total functions can be promoted to success作者: 我的巨大 時(shí)間: 2025-3-26 05:50
Upwards and downwards accumulations on trees,bject with some accumulated information about the other elements. Upwards and downwards accumulations on trees are two instances of this scheme; they replace each element of a tree with some function—in fact, some homomorphism—of that element‘s descendants and of its ancestors, respectively. These t作者: negotiable 時(shí)間: 2025-3-26 12:25
Distributing a class of sequential programs,s given first. A decision is made about the distribution of the variables and the sequential solution is transformed so that guards at the outermost level can be evaluated using variables that will be allocated to one process only. Next we introduce processes and communication. The resulting distrib作者: 吞沒(méi) 時(shí)間: 2025-3-26 15:46 作者: Intruder 時(shí)間: 2025-3-26 20:18 作者: Cardiac-Output 時(shí)間: 2025-3-26 23:30 作者: 苦澀 時(shí)間: 2025-3-27 03:30
An operational semantics for the guarded command language,eakest liberal precondition. The informal notion of a computation is used as a justification for the various definitions. In this paper we present an operational semantics in which the notion of a computation is made explicit. The novel contribution is a generalization of the notion of weakest preco作者: 昏睡中 時(shí)間: 2025-3-27 05:33
Logical specifications for functional programs,entially predicates that relate the result of the specified program to the free variables of that program. In their most concrete form, specifications are simply programs in a functional programming language. Development from abstract specifications to programs is calculational..Using logic in the s作者: 費(fèi)解 時(shí)間: 2025-3-27 11:59
Inorder traversal of a binary heap and its inversion in optimal time and space,n two steps. First, we invert a program that computes the inorder traversal of a binary heap, using the proof rules for program inversion by W. Chen and J.T. Udding. This results in a linear-time solution in terms of binary trees. Subsequently, we data-refine this program to a constant-space solutio作者: onlooker 時(shí)間: 2025-3-27 16:32
Richard S. Bird,Oege de Moor issue in this book.Shows approaches using on-line models orThis book presents computationally efficient MPC solutions. The classical model predictive control (MPC) approach to control dynamical systems described by the Wiener model uses an inverse static block to cancel the influence of process non作者: 單純 時(shí)間: 2025-3-27 20:55
S. M. Brien issue in this book.Shows approaches using on-line models orThis book presents computationally efficient MPC solutions. The classical model predictive control (MPC) approach to control dynamical systems described by the Wiener model uses an inverse static block to cancel the influence of process non作者: 掃興 時(shí)間: 2025-3-27 22:58 作者: 手銬 時(shí)間: 2025-3-28 02:34 作者: staging 時(shí)間: 2025-3-28 10:04 作者: 枕墊 時(shí)間: 2025-3-28 13:49
H. Peter Hofsteesurement levels data.?.In the part dealing with the principle, after a brief introduction of ordinary PCA, a PCA for categorical data (nominal and ordinal) is introduced as nonlinear PCA, in which an optimal scaling technique is used to quantify the categorical variables. The alternating least squar作者: Morose 時(shí)間: 2025-3-28 18:33
Paul F. Hoogendijksurement levels data.?.In the part dealing with the principle, after a brief introduction of ordinary PCA, a PCA for categorical data (nominal and ordinal) is introduced as nonlinear PCA, in which an optimal scaling technique is used to quantify the categorical variables. The alternating least squar作者: CRAB 時(shí)間: 2025-3-28 21:06 作者: Cubicle 時(shí)間: 2025-3-29 01:49
Geraint Jones,Mary Sheerandes an acceleration algorithm that speeds up the convergent This book expounds the principle and related applications of nonlinear principal component analysis (PCA), which is useful method to analyze mixed measurement levels data.?.In the part dealing with the principle, after a brief introduction 作者: initiate 時(shí)間: 2025-3-29 05:37 作者: Negligible 時(shí)間: 2025-3-29 10:43 作者: foppish 時(shí)間: 2025-3-29 12:39 作者: 沙漠 時(shí)間: 2025-3-29 19:33
Rob R. Hoogerwoordoduced: variable selection for mixed measurement levels data, sparse MCA, joint dimension reduction and clustering methods for categorical data, and acceleration of ALS computation. The variable selection metho978-981-10-0157-4978-981-10-0159-8Series ISSN 2191-544X Series E-ISSN 2191-5458 作者: 減至最低 時(shí)間: 2025-3-29 20:17 作者: OWL 時(shí)間: 2025-3-30 00:19 作者: 瑪瑙 時(shí)間: 2025-3-30 04:03
Conservative fixpoint functions on a graph,e not new, but the calculational, abstract and compact technique of deriving them is meant to improve and complement the current techniques [KNU77, REY81, REM84]. It is believed to simplify the derivations for a wider algorithm class [EIJ92] than the one treated here.作者: ACTIN 時(shí)間: 2025-3-30 08:13 作者: AXIOM 時(shí)間: 2025-3-30 16:04 作者: BILE 時(shí)間: 2025-3-30 18:41 作者: 專(zhuān)心 時(shí)間: 2025-3-30 22:45 作者: Slit-Lamp 時(shí)間: 2025-3-31 03:28
J. P. H. W. van den Eijndediscussed MPC algorithms lead to excellent control quality. For a neutralisation reactor and a fuel cell, essential advantages ofneural Wiener models are demonstrated..978-3-030-83817-1978-3-030-83815-7Series ISSN 2198-4182 Series E-ISSN 2198-4190 作者: heirloom 時(shí)間: 2025-3-31 08:34
Paul Gardiner,Clare Martin,Oege de Moordiscussed MPC algorithms lead to excellent control quality. For a neutralisation reactor and a fuel cell, essential advantages ofneural Wiener models are demonstrated..978-3-030-83817-1978-3-030-83815-7Series ISSN 2198-4182 Series E-ISSN 2198-4190 作者: assent 時(shí)間: 2025-3-31 12:29 作者: Myocyte 時(shí)間: 2025-3-31 14:23 作者: Minutes 時(shí)間: 2025-3-31 18:13
Paul F. Hoogendijkometrics, and sociology.?.In the applications part of the book, four applications are introduced: variable selection for mixed measurement levels data, sparse MCA, joint dimension reduction and clustering methods for categorical data, and acceleration of ALS computation. The variable selection metho作者: 性行為放縱者 時(shí)間: 2025-3-31 23:46 作者: conceal 時(shí)間: 2025-4-1 04:07 作者: 蠟燭 時(shí)間: 2025-4-1 06:51
Textbook 2021Latest edition Erstellung einer Besucherbefragung. Ein neues Canvas-Modell solldie Entwicklung von Persona unterstützen und dadurch die Zielgruppenanalyse erleichtern. überlegungen zu digitalem und medialem Publikum wurden integriert und die Ausführungen zur Zielgruppenplanung mit einem neuen Abschnitt zur Mediap
