找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 19919|回复: 64
发表于 2025-3-21 16:15:47 | 显示全部楼层 |阅读模式
书目名称Mathematics of Program Construction
副标题8th International Co
编辑Tarmo Uustalu
视频video
丛书名称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

您所在的用户组没有投票权限
发表于 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
发表于 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
发表于 2025-3-22 07:32:09 | 显示全部楼层
发表于 2025-3-22 09:50:04 | 显示全部楼层
发表于 2025-3-22 14:34:58 | 显示全部楼层
发表于 2025-3-22 18:05:31 | 显示全部楼层
发表于 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
发表于 2025-3-23 05:26:01 | 显示全部楼层
发表于 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.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 02:26
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表