找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Mathematics of Program Construction; 8th International Co Tarmo Uustalu Conference proceedings 2006 Springer-Verlag Berlin Heidelberg 2006

[復制鏈接]
查看: 19988|回復: 64
樓主
發(fā)表于 2025-3-21 16:15:47 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Mathematics of Program Construction
副標題8th International Co
編輯Tarmo Uustalu
視頻videohttp://file.papertrans.cn/627/626957/626957.mp4
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Mathematics of Program Construction; 8th International Co Tarmo Uustalu Conference proceedings 2006 Springer-Verlag Berlin Heidelberg 2006
出版日期Conference proceedings 2006
關鍵詞Coq; algorithm; algorithmics; algorithms; correct software; dynamic programming; formal methods; generic pr
版次1
doihttps://doi.org/10.1007/11783596
isbn_softcover978-3-540-35631-8
isbn_ebook978-3-540-35632-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2006
The information of publication is updating

書目名稱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讀者反饋學科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 21:43:28 | 只看該作者
Refunctionalization at Worked or it could be the deliberate result of a form of “firstification” such as closure conversion, (super)combinator conversion, or defunctionalization. In the latter case, they are higher-order programs in disguise, just as iterative programs with accumulators are often recursive programs in disguis
板凳
發(fā)表于 2025-3-22 00:55:56 | 只看該作者
Towards Generic Programming with Sized Typesf the instantiation type. In practice, the programs obtained from a generic program are usually terminating, but the proof of termination cannot be carried out with traditional methods as term orderings alone, since termination often crucially relies on the program type. This problem is tackled by a
地板
發(fā)表于 2025-3-22 07:32:09 | 只看該作者
5#
發(fā)表于 2025-3-22 09:50:04 | 只看該作者
6#
發(fā)表于 2025-3-22 14:34:58 | 只看該作者
7#
發(fā)表于 2025-3-22 18:05:31 | 只看該作者
8#
發(fā)表于 2025-3-22 22:23:17 | 只看該作者
Loopless Functional Algorithmsch subsequent element in constant time. Loopless algorithms arise in the enumeration of combinatorial patterns such as permutations or subsequences. The elements of the generated list describe transitions that determine how the next combinatorial pattern is to be determined from its predecessor. Loo
9#
發(fā)表于 2025-3-23 05:26:01 | 只看該作者
10#
發(fā)表于 2025-3-23 06:11:14 | 只看該作者
Progress in Deriving Concurrent Programs: Emphasizing the Role of Stable Guardss form an extension to the calculational method of Feijen and van Gasteren using a UNITY style progress logic. We stress the role of stable guards, and we illustrate the derivation techniques on some examples in which progress plays an essential role.
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-12 15:43
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
喀喇| 通辽市| 安塞县| 万宁市| 清水县| 出国| 娄底市| 鄂尔多斯市| 军事| 云霄县| 延边| 察哈| 班戈县| 察隅县| 松桃| 临漳县| 肇源县| 东安县| 清河县| 治多县| 军事| 靖西县| 绵阳市| 沾益县| 外汇| 连南| 襄垣县| 临泉县| 望奎县| 盘山县| 闸北区| 宝坻区| 庄河市| 加查县| 呼玛县| 竹溪县| 荃湾区| 凤山县| 麟游县| 靖江市| 金阳县|