找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: ESOP 86; European Symposium o Bernard Robinet,Reinhard Wilhelm Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986 Resolutio

[復制鏈接]
樓主: 孵化
21#
發(fā)表于 2025-3-25 04:18:42 | 只看該作者
22#
發(fā)表于 2025-3-25 09:58:17 | 只看該作者
23#
發(fā)表于 2025-3-25 14:07:50 | 只看該作者
specification of a tool for viewing program text,s for selecting parts of documents as well as operations for manipulating documents have been defined. The model supports flexible and powerful retrieval capabilities from documents and it allows different views of the same documents. As an example we shall specify a tool for accessing information from Pascal programs.
24#
發(fā)表于 2025-3-25 19:33:16 | 只看該作者
https://doi.org/10.1007/978-981-99-6434-5proof of the code generation; in particular the method used for directly proving equivalence between an operational and a denotational semantics and the modification of Reynolds‘ idea of a relational functor.
25#
發(fā)表于 2025-3-25 23:20:22 | 只看該作者
T. Kuhlmann,R. Lamping,C. Massown current use. They are proved to be individually sufficient for the correctness of refinement and together necessary for it. The proof methods can be employed to derive the weakest specification of an implementation from its abstract specification.
26#
發(fā)表于 2025-3-26 01:40:07 | 只看該作者
27#
發(fā)表于 2025-3-26 07:23:43 | 只看該作者
Adalbert Maercker,Manfred Theis ., is shown to be sound for proving entailment. A kind of completeness result can also be shown, if specifications are assumed to satisfy certain well-formedness conditions. The role played by entailment in proofs of correctness is illustrated by the problem of proving that the concatenation of two FIFO buffers implements a FIFO buffer.
28#
發(fā)表于 2025-3-26 09:57:25 | 只看該作者
Lifetime analysis for procedure parameters,ure of the program. It is introduced for a simple functional language and then extended to cover further commom language properties. Furthermore it is shown that the method can nicely be combined with context dependent improvements of the compilation of calling sequences, e.g. for tail recursive calls.
29#
發(fā)表于 2025-3-26 14:59:10 | 只看該作者
30#
發(fā)表于 2025-3-26 19:14:00 | 只看該作者
Graal : A Functional Programming system with uncurryfied combinators and its reduction machine,
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 19:30
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
汨罗市| 建瓯市| 福建省| 乐昌市| 茌平县| 铅山县| 杭锦后旗| 增城市| 莲花县| 来宾市| 安顺市| 新和县| 马龙县| 松原市| 牟定县| 黄山市| 贵南县| 信阳市| 台东市| 萍乡市| 成武县| 中卫市| 集安市| 浠水县| 大悟县| 普格县| 鄂温| 三河市| 北海市| 古浪县| 清水河县| 汝阳县| 罗山县| 上饶县| 宜宾县| 岫岩| 晴隆县| 天祝| 黑河市| 兴山县| 安丘市|