Titlebook: Algorithimic Languages and Calculi; Richard S. Bird,Lambert Meertens Book 1997 IFIP International Federation for Information Processing 19

只看該作者 · 發(fā)表于 2025-3-21 17:11:55

書目名稱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é)科排名

只看該作者 · 發(fā)表于 2025-3-21 20:38:30

只看該作者 · 發(fā)表于 2025-3-22 02:26:39

只看該作者 · 發(fā)表于 2025-3-22 05:40: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

只看該作者 · 發(fā)表于 2025-3-22 08:47:55

只看該作者 · 發(fā)表于 2025-3-22 16:03:53

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

只看該作者 · 發(fā)表于 2025-3-22 19:40:15

只看該作者 · 發(fā)表于 2025-3-22 21:17:27

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

只看該作者 · 發(fā)表于 2025-3-23 04:42:04

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

只看該作者 · 發(fā)表于 2025-3-23 07:11:51

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 04:24
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved