標(biāo)題: Titlebook: ESOP 86; European Symposium o Bernard Robinet,Reinhard Wilhelm Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986 Resolutio [打印本頁] 作者: 孵化 時間: 2025-3-21 18:10
書目名稱ESOP 86影響因子(影響力)
書目名稱ESOP 86影響因子(影響力)學(xué)科排名
書目名稱ESOP 86網(wǎng)絡(luò)公開度
書目名稱ESOP 86網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱ESOP 86被引頻次
書目名稱ESOP 86被引頻次學(xué)科排名
書目名稱ESOP 86年度引用
書目名稱ESOP 86年度引用學(xué)科排名
書目名稱ESOP 86讀者反饋
書目名稱ESOP 86讀者反饋學(xué)科排名
作者: Efflorescent 時間: 2025-3-21 23:13 作者: 不易燃 時間: 2025-3-22 03:20
A general approach to the optimization of function calls,ue of detecting and executing these calls in a modified shallow binding system known as "standardized shallow binding". We show that by this technique the overhead expenses of changing environments for low cost calls are nearly cut down to zero. The new method can be applied to any imperative or app作者: LAST 時間: 2025-3-22 04:38
Lifetime analysis for procedure parameters,fficient as possible. This paper addresses techniques for both memory and runtime improvements of procedure calls. Usual implementations allocate storage for local objects of procedures (i.e. parameters, result and local variables) either in activation records on a runtime stack in the case of recur作者: Compassionate 時間: 2025-3-22 09:54 作者: Evolve 時間: 2025-3-22 13:03 作者: Evolve 時間: 2025-3-22 18:01
Data refinement refined resume, Park‘s definition of the simulation of Communicating Systems. Two proof methods are suggested which we hope are simpler and more general than those in current use. They are proved to be individually sufficient for the correctness of refinement and together necessary for it. The proof methods can be作者: impaction 時間: 2025-3-23 00:21 作者: 馬賽克 時間: 2025-3-23 02:25 作者: 滲入 時間: 2025-3-23 06:06 作者: BORE 時間: 2025-3-23 10:09 作者: 自傳 時間: 2025-3-23 15:11
Correctness of code generation from a two-level meta-language,proof 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.作者: Nefarious 時間: 2025-3-23 20:11
Data refinement refined resume,n 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-23 22:17
Organic Synthesis, Reactions and Mechanismslicative language. In this paper statically scoped LISP is taken as an example; it is shown how the technique has been applied in the implementation of a LISP interpreter. We also prove that our method exceeds a number of optimizations that have been proposed recently.作者: DRILL 時間: 2025-3-24 06:10 作者: 消毒 時間: 2025-3-24 06:42 作者: Noctambulant 時間: 2025-3-24 11:29 作者: 外面 時間: 2025-3-24 16:36 作者: 精致 時間: 2025-3-24 23:00 作者: 配置 時間: 2025-3-25 02:34
The universe of exons revisited,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.作者: eucalyptus 時間: 2025-3-25 04:18 作者: 越自我 時間: 2025-3-25 09:58 作者: AMBI 時間: 2025-3-25 14:07
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.作者: orient 時間: 2025-3-25 19:33
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
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.作者: Fulminate 時間: 2025-3-26 01:40 作者: Vsd168 時間: 2025-3-26 07:23
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.作者: needle 時間: 2025-3-26 09:57
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 作者: foliage 時間: 2025-3-26 19:14
Graal : A Functional Programming system with uncurryfied combinators and its reduction machine,作者: Albinism 時間: 2025-3-27 00:00
A safe approach to parallel combinator reduction (extended abstract),作者: 樣式 時間: 2025-3-27 03:28 作者: 跳動 時間: 2025-3-27 06:15
Design and implementation of a generic, logic and functional programming language,作者: 分發(fā) 時間: 2025-3-27 10:32 作者: 按時間順序 時間: 2025-3-27 14:45 作者: Respond 時間: 2025-3-27 20:35
Denotational semantics of nets with nondeterminism,作者: Gesture 時間: 2025-3-28 01:56 作者: Adrenal-Glands 時間: 2025-3-28 03:43 作者: condemn 時間: 2025-3-28 09:01 作者: 碌碌之人 時間: 2025-3-28 10:37
Automatic parallelization of fortran programs in the presence of procedure calls, a procedure. This leads us to define the notions of . and ...Then a new concept, called ., is introduced to define precisely the effect of a procedure execution. These regions allow us to describe, in a calling procedure, the parts of arrays which are read or written by the called procedure executi作者: thwart 時間: 2025-3-28 16:30
https://doi.org/10.1007/3-540-16442-1Resolution; functional programming; logic; optimization; programming; programming language; semantics作者: 明確 時間: 2025-3-28 19:56 作者: aspersion 時間: 2025-3-29 00:44
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/300511.jpg作者: Instrumental 時間: 2025-3-29 04:09 作者: 杠桿 時間: 2025-3-29 08:43 作者: 膠水 時間: 2025-3-29 12:44
Organic Synthesis, Reactions and Mechanismsue of detecting and executing these calls in a modified shallow binding system known as "standardized shallow binding". We show that by this technique the overhead expenses of changing environments for low cost calls are nearly cut down to zero. The new method can be applied to any imperative or app作者: PTCA635 時間: 2025-3-29 18:51
Albrecht Beutelspacher,Ute Rosenbaumfficient as possible. This paper addresses techniques for both memory and runtime improvements of procedure calls. Usual implementations allocate storage for local objects of procedures (i.e. parameters, result and local variables) either in activation records on a runtime stack in the case of recur作者: 損壞 時間: 2025-3-29 20:03 作者: NOVA 時間: 2025-3-30 03:41 作者: Leaven 時間: 2025-3-30 07:04 作者: 河潭 時間: 2025-3-30 08:18
Adalbert Maercker,Manfred Theish-level temporal operators, which are difficult to understand and reason about. A more natural way to increase the expressive power of a temporal specification language is by introducing ., which are auxiliary (unimplemented) variables whose values serve as an abstract representation of the internal作者: 共和國 時間: 2025-3-30 14:23 作者: Rct393 時間: 2025-3-30 20:01 作者: 錯事 時間: 2025-3-30 22:12 作者: 改進(jìn) 時間: 2025-3-31 04:15
ESOP 86978-3-540-39782-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 寵愛 時間: 2025-3-31 06:59 作者: 戰(zhàn)役 時間: 2025-3-31 10:59 作者: accordance 時間: 2025-3-31 14:53 作者: 令人苦惱 時間: 2025-3-31 19:46
Short-Range Magnetic Order in Iron and Nickelonplace in the theories of liquids, alloys, and glasses. The reason for short- range order at a given temperature is the same as the reason for any order, namely that in the competition to raise the entropy, while lowering the energy, the amount of energy gained by ordering wins out over the entropy
