找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

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

打印 上一主題 下一主題

Titlebook: Logic Program Synthesis and Transformation; Proceedings of LOPST Timothy Paul Clement,Kung-Kiu Lau Conference proceedings 1992 Springer-Ver

[復(fù)制鏈接]
查看: 32816|回復(fù): 67
樓主
發(fā)表于 2025-3-21 17:59:09 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Logic Program Synthesis and Transformation
副標(biāo)題Proceedings of LOPST
編輯Timothy Paul Clement,Kung-Kiu Lau
視頻videohttp://file.papertrans.cn/588/587883/587883.mp4
叢書(shū)名稱Workshops in Computing
圖書(shū)封面Titlebook: Logic Program Synthesis and Transformation; Proceedings of LOPST Timothy Paul Clement,Kung-Kiu Lau Conference proceedings 1992 Springer-Ver
描述Logic programming synthesis and transformation are methods of deriving logic programs from their specifications and, where necessary, producing alternative but equivalent forms of a given program. The techniques involved in synthesis and transformation are extremely important as they allow the systematic construction of correct and efficient programs and have the potential to enhance current methods of software production. Transformation strategies are also being widely used in the field of logic program development. LOPSTR 91 was the first workshop to deal exclusively with both logic program synthesis and transformation and, as such, filled an obvious gap in the existing range of logic programming workshops. In attempting to cover the subject as comprehensively as possible, the workshop brought together researchers with an interest in all aspects of logic (including Horn Clause and first order logic) and all approaches to program synthesis and transformation. .Logic . .Program Synthesis and Transformation. provides a complete record of the workshop, with all the papers reproduced either in full or as extended abstracts. They cover a wide range of aspects, both practical and theore
出版日期Conference proceedings 1992
關(guān)鍵詞Logic Programming transformation; Logic programming synthesis; Program development; Variable; algorithms
版次1
doihttps://doi.org/10.1007/978-1-4471-3494-7
isbn_softcover978-3-540-19742-3
isbn_ebook978-1-4471-3494-7Series ISSN 1431-1682
issn_series 1431-1682
copyrightSpringer-Verlag London 1992
The information of publication is updating

書(shū)目名稱Logic Program Synthesis and Transformation影響因子(影響力)




書(shū)目名稱Logic Program Synthesis and Transformation影響因子(影響力)學(xué)科排名




書(shū)目名稱Logic Program Synthesis and Transformation網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Logic Program Synthesis and Transformation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Logic Program Synthesis and Transformation被引頻次




書(shū)目名稱Logic Program Synthesis and Transformation被引頻次學(xué)科排名




書(shū)目名稱Logic Program Synthesis and Transformation年度引用




書(shū)目名稱Logic Program Synthesis and Transformation年度引用學(xué)科排名




書(shū)目名稱Logic Program Synthesis and Transformation讀者反饋




書(shū)目名稱Logic Program Synthesis and Transformation讀者反饋學(xué)科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:18:13 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:40:32 | 只看該作者
地板
發(fā)表于 2025-3-22 06:16:21 | 只看該作者
Program Equivalence, Program Development and Integrity Checking,the program. This results in a method which allows program equivalence to be analysed retrospectively without placing restrictions on the manner in which one version of a program can be derived from another.
5#
發(fā)表于 2025-3-22 11:13:59 | 只看該作者
Formal validation of transformation schemata,r logic. Let ? be a transformation scheme which is proved correct. If we apply the scheme ? to a (first-order) program, the resulting program . the same set of solutions as the original one..We exemplify the method by proving the correctness of unfold/fold transformation, and of a scheme, which replaces recursion by tail-recursion.
6#
發(fā)表于 2025-3-22 14:20:05 | 只看該作者
7#
發(fā)表于 2025-3-22 18:16:31 | 只看該作者
8#
發(fā)表于 2025-3-23 01:16:05 | 只看該作者
,Semantics—based Partial Evaluation of Prolog Programs,mantic modelling of the basic control component of the partial evaluation process is possible. Conversely, the CCS semantics can determine whether particular partial evaluation transformations violate program completeness.
9#
發(fā)表于 2025-3-23 02:28:08 | 只看該作者
10#
發(fā)表于 2025-3-23 08:54:02 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(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.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 04:03
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
文水县| 兴仁县| 岚皋县| 杂多县| 明溪县| 海宁市| 潞西市| 塔城市| 咸丰县| 新晃| 云霄县| 长顺县| 维西| 成武县| 庆阳市| 德令哈市| 乌什县| 延川县| 平乡县| 屏南县| 偃师市| 湘乡市| 惠水县| 竹北市| 平塘县| 新民市| 历史| 延长县| 华安县| 两当县| 广安市| 临桂县| 青岛市| 普兰店市| 平谷区| 普定县| 都昌县| 措勤县| 东丽区| 义乌市| 桂林市|