標題: Titlebook: ESOP ‘90; 3rd European Symposi Neil Jones Conference proceedings 1990 Springer-Verlag Berlin Heidelberg 1990 Algebra.D programming language [打印本頁] 作者: 使固定 時間: 2025-3-21 17:55
書目名稱ESOP ‘90影響因子(影響力)
書目名稱ESOP ‘90影響因子(影響力)學科排名
書目名稱ESOP ‘90網(wǎng)絡公開度
書目名稱ESOP ‘90網(wǎng)絡公開度學科排名
書目名稱ESOP ‘90被引頻次
書目名稱ESOP ‘90被引頻次學科排名
書目名稱ESOP ‘90年度引用
書目名稱ESOP ‘90年度引用學科排名
書目名稱ESOP ‘90讀者反饋
書目名稱ESOP ‘90讀者反饋學科排名
作者: DOSE 時間: 2025-3-21 22:11
Eureka definitions for free! or Disagreement points for fold/unfold transformations,ion schemes. This may be used to transform a function so as to improve the efficiency of its implementation. However, for this to work the user must supply so-called Eureka definitions and it may require some ingenuity to construct these. This paper shows that a class of these Eureka definitions can be derived in a rather systematic way.作者: Irascible 時間: 2025-3-22 01:29 作者: 大量 時間: 2025-3-22 08:14
CD34+ Cell in Cord Blood and Neonates,ed and completed with two modules providing a graphical visualization of the execution and a graphical execution controller. The problems of implementing a parallel language using natural semantics and of providing a visualization for a parallel language are especially addressed.作者: Anthology 時間: 2025-3-22 11:28 作者: 思想 時間: 2025-3-22 14:42 作者: 思想 時間: 2025-3-22 20:54 作者: 課程 時間: 2025-3-22 23:24 作者: 簡略 時間: 2025-3-23 02:53
Resolution and Type Theory,In this paper, an inference mechanism is proposed for proof construction in Constructive Type Theory. An interactive system that implements this method has been developed.作者: Generator 時間: 2025-3-23 07:00
https://doi.org/10.1007/3-540-52592-0Algebra; D programming language; Implementierung; Programmieren; Programmiersprachen; Spezifikation; objec作者: WITH 時間: 2025-3-23 13:03
978-3-540-52592-9Springer-Verlag Berlin Heidelberg 1990作者: 注意到 時間: 2025-3-23 15:19 作者: 頭腦冷靜 時間: 2025-3-23 18:34 作者: 正論 時間: 2025-3-23 22:37 作者: Bph773 時間: 2025-3-24 05:35 作者: 苦惱 時間: 2025-3-24 07:08
C. Tilcock,S. Eastman,D. Fishersing special CLP-systems, many constraint satisfaction applications have been programmed very quickly and the resulting programs have a good performance. In this paper, we show how to implement a finite-domain CLP on top of a PROLOG-system equipped with a delay mechanism. The advantages are that the作者: 幼兒 時間: 2025-3-24 13:24
Keith L. Knutson,Derek C. Radiskyis no framework for formalizing such statements nor for deriving interesting consequences. As a first step in this direction, we develop a formal notion of expressiveness and investigate its properties. To demonstrate the theory‘s closeness to published intuitions on expressiveness, we analyze the e作者: Acumen 時間: 2025-3-24 17:43 作者: Gyrate 時間: 2025-3-24 21:57
Douglas A. Cotanche,Anne K. Hennigare shown to be inappropriate for this purpose. Lower and upper domain do not support quantification, whereas Plotkin‘s domain does not contain the empty set. This is an immense defect, since the empty set is not only interesting in its own, but is also needed to define operations such as filtering 作者: licence 時間: 2025-3-25 02:24
Michael R. Payne,Suzanne E. Rudnick a standardization procedure, and to correspond with an operational semantics obtained from the denotational semantics by viewing the semantic equations as state transition rules. Lamping‘s system is remarkable because it is small, having only four constructions, yet it can easily express a wide var作者: 過份 時間: 2025-3-25 05:38
https://doi.org/10.1007/978-1-4684-8196-9value, obtained from the standard semantics of the language. The standard semantics is then abstracted away from the analysis to yield an approximating backwards analysis. It is shown how the results obtained can be used to transform a program into one that uses less dynamically alocated storage. Th作者: Handedness 時間: 2025-3-25 11:34 作者: Emasculate 時間: 2025-3-25 12:59
Laser Guidance-Based Cell Micropatterningg that rules will be matched against a term in the order in which the rules are written, and that the pattern-matching of a rule against a term proceeds from left to right..This gives a precise semantics to such ambiguous systems, but it has disadvantages. It depends on the textual ordering of the p作者: Dna262 時間: 2025-3-25 16:36
https://doi.org/10.1007/978-3-642-77817-9n to extend a purely functional, (programmed) graph reduction machine by mechanisms capable of performing . and .. We describe the structure of the machine and explain the compilation scheme which generates machine code from a given source program. Both the machine and the compilation scheme have be作者: strdulate 時間: 2025-3-25 23:41 作者: 違法事實 時間: 2025-3-26 01:00
https://doi.org/10.1007/978-3-7091-1175-8, improve program efficiency by eliminating redundant computations and avoiding multiple visits of data structures. It can be shown that no general method exists for inventing the required eureka predicates for a given initial program. We introduce here two strategies, the . and the ., which in many作者: 沒有準備 時間: 2025-3-26 06:54 作者: Expiration 時間: 2025-3-26 11:24 作者: Cholesterol 時間: 2025-3-26 16:14 作者: Banquet 時間: 2025-3-26 16:53
https://doi.org/10.1007/978-1-4684-8196-9g backwards analysis. It is shown how the results obtained can be used to transform a program into one that uses less dynamically alocated storage. The analysis is presented in terms of a first order functional language, and an extension to higher order functional languages is sketched.作者: Lasting 時間: 2025-3-26 21:19 作者: addict 時間: 2025-3-27 02:32
Conference proceedings 1990fundamental issues and important developments in the design, specification and implementation of programming languages and systems. Topics include: - Program development: specification, methodology, tools, environments; - Programming language concepts: types, data abstraction, parallelism, real-time作者: 民間傳說 時間: 2025-3-27 08:03 作者: etidronate 時間: 2025-3-27 13:27 作者: 狂熱語言 時間: 2025-3-27 17:34 作者: Fibrin 時間: 2025-3-27 21:03 作者: 話 時間: 2025-3-28 01:38
Douglas A. Cotanche,Anne K. Henniga set through a predicate. Two constructions, the . and the ., are proposed that support the desired set operations. The big domain is bounded complete, whereas the small one only respects Plotkin‘s SFP-property. Both constructions are free with respect to suitable algebraic theories.作者: Nucleate 時間: 2025-3-28 03:24 作者: 切掉 時間: 2025-3-28 06:50
https://doi.org/10.1007/978-3-642-77817-9en formally specified. A prototype emulator of the machine has been implemented in Occam on a transputer system. Future work is planned for incorporating lazy evaluation and parallelism to the machine.作者: Interlocking 時間: 2025-3-28 12:52 作者: 無辜 時間: 2025-3-28 16:32 作者: avenge 時間: 2025-3-28 22:12
Michael R. Payne,Suzanne E. Rudnickdata and code, in Lamping‘s programming system can be parameterized, and a parameterized object can be manipulated as if it were a ground object. This blurs the distinction between data and code, allowing one to think of data as code and vice versa.作者: LAST 時間: 2025-3-29 00:24
Higher order escape analysis: Optimizing stack allocation in functional program implementations,been described in various data-flow analysis frameworks for a language with complex types. The analysis described here, being higher order, provides more accurate escape information, although for a very simple higher order functional language.作者: cogent 時間: 2025-3-29 04:58 作者: 騷動 時間: 2025-3-29 09:25
On the expressive power of programming languages,xpressive power of several extensions of functional languages. Based on these results, we believe that our system correctly captures many of the informal ideas on expressiveness, and that it constitutes a good basis for further research in this direction.作者: Rebate 時間: 2025-3-29 11:31
Set domains,a set through a predicate. Two constructions, the . and the ., are proposed that support the desired set operations. The big domain is bounded complete, whereas the small one only respects Plotkin‘s SFP-property. Both constructions are free with respect to suitable algebraic theories.作者: assail 時間: 2025-3-29 19:35 作者: Gesture 時間: 2025-3-29 23:22
Graph-based implementation of a functional logic language,en formally specified. A prototype emulator of the machine has been implemented in Occam on a transputer system. Future work is planned for incorporating lazy evaluation and parallelism to the machine.作者: kidney 時間: 2025-3-30 01:33
Conference proceedings 1990; - Language implementation techniques: compilers, interpreters, abstract machine design, optimization; - Programs as data objects: abstract interpretation, program transformation, partial evaluation; - Programming styles: imperative, functional, predicative, object-oriented.作者: 臆斷 時間: 2025-3-30 07:30
Symbolic finite differencing - Part I, integration). Because resource utilization is often difficult to predict precisely, the economics of software developement also depends on the risk of the implementation failing to meet its performance requirements. Consequently, complex algorithms are frequently avoided in large systems — even in 作者: 在前面 時間: 2025-3-30 10:32 作者: 演繹 時間: 2025-3-30 15:54
Automatic autoprojection of higher order recursive equations,bes an approach to treat a . subset of the Scheme language. The system has been implemented as an extension to the existing autoprojector . [Bondorf & Danvy 90] that treats a first order Scheme subset. To our knowledge, our system is the first fully automatic and implemented autoprojector for a high作者: 形上升才刺激 時間: 2025-3-30 18:04
From interpreting to compiling binding times,ng a source expression is static or dynamic, given a static/dynamic division of the input. Source programs are specialized with respect to the static part of their input. When a source expression depends on the concrete result of specializing another expression, the binding time of this other expres作者: 自負的人 時間: 2025-3-30 21:13
Implementing finite-domain constraint logic programming on top of a PROLOG-system with delay-mechansing special CLP-systems, many constraint satisfaction applications have been programmed very quickly and the resulting programs have a good performance. In this paper, we show how to implement a finite-domain CLP on top of a PROLOG-system equipped with a delay mechanism. The advantages are that the作者: 飲料 時間: 2025-3-31 04:01
On the expressive power of programming languages,is no framework for formalizing such statements nor for deriving interesting consequences. As a first step in this direction, we develop a formal notion of expressiveness and investigate its properties. To demonstrate the theory‘s closeness to published intuitions on expressiveness, we analyze the e作者: amygdala 時間: 2025-3-31 05:30 作者: exquisite 時間: 2025-3-31 12:33 作者: Meander 時間: 2025-3-31 15:09
A syntactic theory of transparent parameterization, a standardization procedure, and to correspond with an operational semantics obtained from the denotational semantics by viewing the semantic equations as state transition rules. Lamping‘s system is remarkable because it is small, having only four constructions, yet it can easily express a wide var作者: Debate 時間: 2025-3-31 20:07 作者: 可卡 時間: 2025-3-31 21:51
Techniques for improving grammar Flow Analysis,ramework, as was done on programs with Data Flow Analysis, those problems are split into a general resolution procedure and a set of specific propagation functions. This paper presents a number of improvement techniques that act on the resolution procedure, and hence apply to every GFA problem: gram作者: 呼吸 時間: 2025-4-1 05:10
