找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: 孵化
发表于 2025-3-25 04:18:42 | 显示全部楼层
发表于 2025-3-25 09:58:17 | 显示全部楼层
发表于 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.
发表于 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.
发表于 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.
发表于 2025-3-26 01:40:07 | 显示全部楼层
发表于 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.
发表于 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.
发表于 2025-3-26 14:59:10 | 显示全部楼层
发表于 2025-3-26 19:14:00 | 显示全部楼层
Graal : A Functional Programming system with uncurryfied combinators and its reduction machine,
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 07:42
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表