標(biāo)題: Titlebook: Algorithimic Languages and Calculi; Richard S. Bird,Lambert Meertens Book 1997 IFIP International Federation for Information Processing 19 [打印本頁] 作者: Opulent 時(shí)間: 2025-3-21 17:11
書目名稱Algorithimic Languages and Calculi影響因子(影響力)
書目名稱Algorithimic Languages and Calculi影響因子(影響力)學(xué)科排名
書目名稱Algorithimic Languages and Calculi網(wǎng)絡(luò)公開度
書目名稱Algorithimic Languages and Calculi網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithimic Languages and Calculi被引頻次
書目名稱Algorithimic Languages and Calculi被引頻次學(xué)科排名
書目名稱Algorithimic Languages and Calculi年度引用
書目名稱Algorithimic Languages and Calculi年度引用學(xué)科排名
書目名稱Algorithimic Languages and Calculi讀者反饋
書目名稱Algorithimic Languages and Calculi讀者反饋學(xué)科排名
作者: 典型 時(shí)間: 2025-3-21 20:38 作者: Leisureliness 時(shí)間: 2025-3-22 02:26 作者: aspersion 時(shí)間: 2025-3-22 05:40
Refinement of data parallel programs in P,s paper the PEI formalism, which enables to take into account both the geometrical and functional aspects of programs. It provides a refinement calculus mainly used to transform the geometrical characteristics of parallel programs, and we show how it may apply on data parallel programs, in particula作者: Occupation 時(shí)間: 2025-3-22 08:47 作者: perpetual 時(shí)間: 2025-3-22 16:03
Refinement of Parameterized Algebraic Specifications,ed) while the parameter specification is refined contravariantly (i.e., generalized). This refinement is similar to the subtyping relation between function types. Assuming a few relatively weak axioms about parameterized specifications, refinement is shown to satisfy the expected properties for soft作者: Substance-Abuse 時(shí)間: 2025-3-22 19:40 作者: 確定的事 時(shí)間: 2025-3-22 21:17
Defining and Detecting Feature Interactions,em features, and for a detection of interaction between features. The method is based on the lattice of relational specifications: the system specification is given as the conjunction (lattice operator meet) of the features; a feature interaction is detected when the meet of the features does not ex作者: 責(zé)問 時(shí)間: 2025-3-23 04:42
Synthesising Interconnections, new problems arise in the calculation of programs from specifications. A particularly important aspect for extending existing methods to address composite systems is the ability, given programs that realise component specifications, to synthesise the interconnections between them in such a way that作者: Infuriate 時(shí)間: 2025-3-23 07:11 作者: 追蹤 時(shí)間: 2025-3-23 13:11 作者: 太空 時(shí)間: 2025-3-23 14:10
Toward a calculus for abstract syntax trees,fects of their metaprograms. Of equal importance, metaprogramming requires an intuitive foundation that facilitates most frequent, natural manipulations of programs as data. In the past, the program transformation community has characterized well means for expressing pattern-matching and individual 作者: MAZE 時(shí)間: 2025-3-23 18:28
Principled strength reduction,change operation ⊕, incrementalizes . with respect to ⊕, and adopts an incrementalized loop body to form a new loop that is more efficient. Three general optimizations are performed as part of the adoption; they systematically handle initializations, termination conditions, and final return values o作者: Affirm 時(shí)間: 2025-3-23 23:03 作者: 墻壁 時(shí)間: 2025-3-24 06:06
Predicative Semantics of Loops, the observations makes the obvious weakest fixed-point semantics of iterative constructs unacceptable. This paper proposes an alternative. We will see that this alternative semantics is monotone and implementable (feasible). Finally a programming theorem for iterative constructs is proposed, proved作者: 彎曲道理 時(shí)間: 2025-3-24 10:25
Bedeutungsvielfalt von Augenblickenrent perspective, using a relational calculus to model both, problems and their solutions obtained from dynamic programming. This approach serves to shed new light on the different styles of dynamic programming, representing them by different search strategies of the tree-like space of partial solut作者: clarify 時(shí)間: 2025-3-24 13:20 作者: Fecal-Impaction 時(shí)間: 2025-3-24 14:52
Alfred Bellebaum,Robert Hettlagesingle one, leading to an efficient program without intermediate data structures produced. In this paper, we report our on-going investigation on the design and implementation of an automatic transformation system HYLO which performs fusion transformation in a more systematic and more general way th作者: BURSA 時(shí)間: 2025-3-24 23:01
Bedeutungsvielfalt von Augenblickens paper the PEI formalism, which enables to take into account both the geometrical and functional aspects of programs. It provides a refinement calculus mainly used to transform the geometrical characteristics of parallel programs, and we show how it may apply on data parallel programs, in particula作者: 蚊子 時(shí)間: 2025-3-25 02:08
https://doi.org/10.1007/978-3-642-91822-3. This is mainly due to the communication and synchronization that is necessary to manage distributed data correctly. This paper applies a methodology for the transformational derivation of parallel programs using data distribution algebras that enable an abstract description of data distribution is作者: Anthology 時(shí)間: 2025-3-25 05:05
Spezielle Pathologie des Augenhintergrundes,ed) while the parameter specification is refined contravariantly (i.e., generalized). This refinement is similar to the subtyping relation between function types. Assuming a few relatively weak axioms about parameterized specifications, refinement is shown to satisfy the expected properties for soft作者: 事物的方面 時(shí)間: 2025-3-25 07:45 作者: 使習(xí)慣于 時(shí)間: 2025-3-25 13:43 作者: 租約 時(shí)間: 2025-3-25 15:51
https://doi.org/10.1007/978-3-662-39682-7 new problems arise in the calculation of programs from specifications. A particularly important aspect for extending existing methods to address composite systems is the ability, given programs that realise component specifications, to synthesise the interconnections between them in such a way that作者: Carcinoma 時(shí)間: 2025-3-25 22:51 作者: jeopardize 時(shí)間: 2025-3-26 01:48
Gustav Tugendreich,Wilhelm Feldrategy, and in particular, it allows us to derive linear recursive programs when the tupling strategy is not successful. The linear recursive programs one may derive using this new strategy, have in most cases very good time and space performance. We present our list introduction strategy in the cas作者: PAD416 時(shí)間: 2025-3-26 04:31
,Der Ausbau der Kleinkinderfürsorge,fects of their metaprograms. Of equal importance, metaprogramming requires an intuitive foundation that facilitates most frequent, natural manipulations of programs as data. In the past, the program transformation community has characterized well means for expressing pattern-matching and individual 作者: alcohol-abuse 時(shí)間: 2025-3-26 11:58 作者: Hyperplasia 時(shí)間: 2025-3-26 14:57
,Der künstliche Steinausbau der Waldwege,c problem. The problem is to compile a subset RCS of Relational Calculus defined by Willard (1978) in a novel way so that efficient run-time query performance is guaranteed. Willard gives an algorithm to compile each query . belonging to RCS so that it executes in .(. log.. + .) steps and .(.) space作者: 熱情的我 時(shí)間: 2025-3-26 19:32
https://doi.org/10.1007/978-3-642-91779-0 the observations makes the obvious weakest fixed-point semantics of iterative constructs unacceptable. This paper proposes an alternative. We will see that this alternative semantics is monotone and implementable (feasible). Finally a programming theorem for iterative constructs is proposed, proved作者: LEVY 時(shí)間: 2025-3-26 22:11
IFIP Advances in Information and Communication Technologyhttp://image.papertrans.cn/a/image/152962.jpg作者: Optimum 時(shí)間: 2025-3-27 03:35
Bedeutungsvielfalt von AugenblickenBased on the algebra of relations and maps we present some techniques for safe manipulation of pointer structures, with a special emphasis on tree-like structures. We investigate sufficient criteria for preservation of substructures under selective updating. The approach is illustrated with some simple examples.作者: 運(yùn)氣 時(shí)間: 2025-3-27 07:32
Calculating With Pointer Structures,Based on the algebra of relations and maps we present some techniques for safe manipulation of pointer structures, with a special emphasis on tree-like structures. We investigate sufficient criteria for preservation of substructures under selective updating. The approach is illustrated with some simple examples.作者: 緩和 時(shí)間: 2025-3-27 11:07 作者: insomnia 時(shí)間: 2025-3-27 15:47 作者: Pander 時(shí)間: 2025-3-27 20:06
A Powerful Transformation Rule, its Applications and Variants,functional implementations. The power of the rule is illustrated by several examples, among them a Prolog interpreter. Also, variants of the rule for specifications involving existential quantification and arbitrary choice are presented and illustrated by representative examples.作者: 隱士 時(shí)間: 2025-3-28 01:08
1868-4238 of this working conference is to present the results ofongoing research, descriptions of existing and proposed systems, andapplications to the production of practical software.978-0-387-35264-0Series ISSN 1868-4238 Series E-ISSN 1868-422X 作者: 同位素 時(shí)間: 2025-3-28 02:33
Book 1997The general theme of this conference is notations, methods, andtool support for the calculation of programs from specifications. Thepurpose of this working conference is to present the results ofongoing research, descriptions of existing and proposed systems, andapplications to the production of practical software.作者: 無法取消 時(shí)間: 2025-3-28 06:41 作者: 積極詞匯 時(shí)間: 2025-3-28 13:01
IFIP International Federation for Information Processing 1997作者: employor 時(shí)間: 2025-3-28 15:30
Algorithimic Languages and Calculi978-0-387-35264-0Series ISSN 1868-4238 Series E-ISSN 1868-422X 作者: 撫育 時(shí)間: 2025-3-28 19:37
Bedeutungsvielfalt von Augenblickenrent perspective, using a relational calculus to model both, problems and their solutions obtained from dynamic programming. This approach serves to shed new light on the different styles of dynamic programming, representing them by different search strategies of the tree-like space of partial solutions.作者: 量被毀壞 時(shí)間: 2025-3-29 02:06
Bedeutungsvielfalt von Augenblickens paper the PEI formalism, which enables to take into account both the geometrical and functional aspects of programs. It provides a refinement calculus mainly used to transform the geometrical characteristics of parallel programs, and we show how it may apply on data parallel programs, in particular for data alignments.作者: MAL 時(shí)間: 2025-3-29 06:35 作者: etidronate 時(shí)間: 2025-3-29 09:49 作者: AORTA 時(shí)間: 2025-3-29 14:38
,Der künstliche Steinausbau der Waldwege,e abstraction and algebraic reasoning without resorting to low level counting arguments. This approach shortens Willard’s proofs considerably, and facilitates an implementation. Finally, we show that the implementation can be typed in a restricted form of a set-theoretic type system based on Cai .. 作者: 真 時(shí)間: 2025-3-29 17:04 作者: 領(lǐng)巾 時(shí)間: 2025-3-29 23:10 作者: altruism 時(shí)間: 2025-3-30 03:57 作者: palliative-care 時(shí)間: 2025-3-30 07:04 作者: 珊瑚 時(shí)間: 2025-3-30 10:29 作者: Dysarthria 時(shí)間: 2025-3-30 15:18
Augenblicke. Wegmarken im Fluss der Zeit First we derive non-systolic recognizers, much in the same way as functional programs are derived. Then we make use of standard circuit transformation techniques, recast in the relation algebra framework, to obtain circuits that are very close to the ones presented by Foster and Kung.作者: 完全 時(shí)間: 2025-3-30 17:23
Alfred Bellebaum,Robert Hettlagedesign and implementation of an automatic transformation system HYLO which performs fusion transformation in a more systematic and more general way than any other systems. The distinguished point of our system is its . feature based on simple application of transformation laws rather than traditional search-based transformations.作者: 無關(guān)緊要 時(shí)間: 2025-3-30 22:43
Spezielle Pathologie des Augenhintergrundes,ction types. Assuming a few relatively weak axioms about parameterized specifications, refinement is shown to satisfy the expected properties for software development in-the-large: independent refinement of body and parameter, and closure under sequential composition, instantiation and a suitable form of ‘horizontal’ composition.作者: 邊緣 時(shí)間: 2025-3-31 01:20
https://doi.org/10.1007/978-3-662-29181-8ation is given as the conjunction (lattice operator meet) of the features; a feature interaction is detected when the meet of the features does not exist. Examples of detection are given using logic programming.*
