標題: Titlebook: Rewriting Techniques and Applications; 4th International Co Ronald V. Book Conference proceedings 1991 Springer-Verlag Berlin Heidelberg 19 [打印本頁] 作者: FAULT 時間: 2025-3-21 19:06
書目名稱Rewriting Techniques and Applications影響因子(影響力)
書目名稱Rewriting Techniques and Applications影響因子(影響力)學科排名
書目名稱Rewriting Techniques and Applications網(wǎng)絡(luò)公開度
書目名稱Rewriting Techniques and Applications網(wǎng)絡(luò)公開度學科排名
書目名稱Rewriting Techniques and Applications被引頻次
書目名稱Rewriting Techniques and Applications被引頻次學科排名
書目名稱Rewriting Techniques and Applications年度引用
書目名稱Rewriting Techniques and Applications年度引用學科排名
書目名稱Rewriting Techniques and Applications讀者反饋
書目名稱Rewriting Techniques and Applications讀者反饋學科排名
作者: Intervention 時間: 2025-3-21 23:24 作者: 可以任性 時間: 2025-3-22 00:49
William M. Farmer,Ronald J. Watrosgesellschaften in einer sich immer weiter ?ffnenden Schere aus steigendem Konkurrenzdruck. und sinkender Nachfrage in traditionellen Beratungssegmenten.. Auf der Angebotsseite haben sowohl der erhebliche Anstieg der Zahl der Berufstr?ger als auch zus?tzliche Konkurrenz ausserhalb des Berufsstandes 作者: Mangle 時間: 2025-3-22 04:49 作者: 拱形大橋 時間: 2025-3-22 09:52 作者: FELON 時間: 2025-3-22 15:49
Eric Domenjoudisiert und die Bearbeitung der Aufgaben dv-gestützt. Um die für einen erfolgreichen Einsatz erforderliche Anwenderakzeptanz zu erzielen, sollte diese Umstellung idealerweise eine Verbesserung gegenüber der Ausgangssituation bedeuten. Die Arbeit mit dem System sollte also stets intuitiv und flexibel 作者: Infinitesimal 時間: 2025-3-22 19:26 作者: 緯度 時間: 2025-3-23 00:05 作者: 使困惑 時間: 2025-3-23 02:38
Wayne Snyder,Christopher Lynchonments based on distributed object model at once. It is built as a collection of concurrent objects which interact each other and consist of two types of objects : collaborative object and application object, which are used to construct collaborative and paralleled computing environments respective作者: 頭腦冷靜 時間: 2025-3-23 06:46 作者: neologism 時間: 2025-3-23 10:48
Hélène Kirchnerllaborative platforms in the educational and industrial field or social networks like LinkedIn or Xing, users have to disclose private information and reveal their identities. Working with those systems allows them to create user profiles which could reveal more information about the user, than he w作者: 奇思怪想 時間: 2025-3-23 14:36 作者: 貝雷帽 時間: 2025-3-23 18:04
Fran?oise Bellegardems design, we transform partial scenarios describing particular cooperative situations in a more comprehensive Cooperative Behaviour Model (CBM). In this paper, we describe our contribution to the need for a graphical formalism which would be able to express in a natural way, understandable by diffe作者: Banister 時間: 2025-3-24 00:17
Incremental termination proofs and the length of derivations,incremental termination proof for a term rewriting system . can be used to derive upper bounds on the length of derivations in .. A number of examples show that our results can be applied to yield (sharp) low-degree polynomial complexity bounds.作者: exorbitant 時間: 2025-3-24 04:07 作者: Incompetent 時間: 2025-3-24 09:37 作者: 騷動 時間: 2025-3-24 10:56 作者: BOOM 時間: 2025-3-24 16:44
https://doi.org/10.1007/3-540-53904-2Automatisches Schlie?en; Beweissysteme; Programmiersprache; Rechnergestützte Entscheidung; Term rewritin作者: Banister 時間: 2025-3-24 19:11 作者: GROG 時間: 2025-3-25 00:35 作者: Toxoid-Vaccines 時間: 2025-3-25 04:04 作者: 著名 時間: 2025-3-25 08:53 作者: Crepitus 時間: 2025-3-25 11:52
J. R. Kennaway,J. W. Klop,M. R. Sleep,F. J. de Vriesproprietary nature of Lotus Notes a stumbling block to some firms and a strategic advantage to others? We explore enterprise-level groupware expectations and requirements in our case studies to address these interesting questions. The final section focuses on predicting change to understand when an 作者: conquer 時間: 2025-3-25 17:56 作者: 相互影響 時間: 2025-3-25 22:58
D. A. Wolframer Dienstleistungen aufgrund der komplizierten Steuergesetzgebung steigt — zunehmend Nachfrageschwund und Honorareinbussen hingenommen werden.. Hinzu kommt, dass die Kanzleien seitens der Mandantschaft in immer gr?sserem Masse mit Beratungswünschen, wie betriebswirtschaftlicher und EDV-Beratung. sow作者: 鳥籠 時間: 2025-3-26 01:48 作者: Bumble 時間: 2025-3-26 08:14 作者: negotiable 時間: 2025-3-26 12:27 作者: forebear 時間: 2025-3-26 14:23 作者: 暫時過來 時間: 2025-3-26 19:49 作者: 貴族 時間: 2025-3-26 22:19 作者: 連詞 時間: 2025-3-27 02:53 作者: 紡織品 時間: 2025-3-27 07:12
Aart Middeldorp,Yoshihito Toyamag together in the classroom, measuring neutral or positive effects on learning and the usefulness of introducing mobile devices, group support applications, and context awareness. The ratio of unwanted interruptions to users made by the system is used to evaluate the utility of the system. Results s作者: heterogeneous 時間: 2025-3-27 10:27
Fran?oise Bellegardeain concepts of “cooperative world” which are Actors, Roles, Groups, Tasks, Processes, Artefacts (Tools and Objects) and Contexts (Platforms, Situations and Users). With Orchestra formalism we try to express by a sort of music staff individual and collective behaviours. In this way we can model eith作者: 補充 時間: 2025-3-27 15:24
0302-9743 Italy, April 10-12, 1991. The volume includes 40 papers on a wide variety of topics including: term rewriting systems, equational unification, algebraic rewriting, termination proofs, generalization problems, undecidable properties, parametrized specifications, normalizing systems, program transfor作者: Awning 時間: 2025-3-27 19:25
Rewriting, and equational unification: the higher-order cases,epts. As examples, we generalize Plotkin‘s criteria for building-in equational theories, and show that pure third-order equational matching is undecidable. This approach simplifies computations in applications involving lexical scoping, and equations. We discuss open problems and summarize future research directions.作者: 楓樹 時間: 2025-3-28 00:11 作者: licence 時間: 2025-3-28 03:30
Detecting redundant narrowing derivations by the LSE-SL reducibility test,troduce a new narrowing strategy, LSE-SL left-to-right basic normal narrowing, prove its completeness for arbitrary canonical term rewriting systems, and demonstrate how it increases the efficiency of the narrowing process.作者: 善于 時間: 2025-3-28 07:48
Narrowing directed by a graph of terms,solved, which helps one to know the narrowing derivations possibly leading to solutions. Thus, the other derivations are not computed. This method is proved complete. An example is given and some improvements are proposed.作者: osteocytes 時間: 2025-3-28 14:06 作者: Dendritic-Cells 時間: 2025-3-28 18:40 作者: Flagging 時間: 2025-3-28 20:57 作者: 多山 時間: 2025-3-29 02:05 作者: 流動才波動 時間: 2025-3-29 03:44 作者: Pedagogy 時間: 2025-3-29 11:02 作者: Visual-Field 時間: 2025-3-29 12:04
Redex capturing in term graph rewriting (concise version),e-efficient method for implementing term rewrite systems. Certain structure sharing schemes can lead to a situation in which a term graph component is rewritten to another component that contains the original. This phenomenon, called . introduces cycles into the term graph which is being rewritten—e作者: 耕種 時間: 2025-3-29 16:10
Rewriting, and equational unification: the higher-order cases, and equational unification and their properties. This provides a basis for generalizing the first- and restricted higher-order results for these concepts. As examples, we generalize Plotkin‘s criteria for building-in equational theories, and show that pure third-order equational matching is undecid作者: Alveolar-Bone 時間: 2025-3-29 21:51
Adding algebraic rewriting to the untyped lambda calculus (extended abstract),“stable”, we prove that the resulting calculus is confluent if . is confluent, and terminating if . is terminating. The termination result has the corresponding theorems for several typed calculi as corollaries. The proof of the confluence result yields a general method for proving confluence of typ作者: 無動于衷 時間: 2025-3-30 01:23
Incremental termination proofs and the length of derivations,incremental termination proof for a term rewriting system . can be used to derive upper bounds on the length of derivations in .. A number of examples show that our results can be applied to yield (sharp) low-degree polynomial complexity bounds.作者: PANEL 時間: 2025-3-30 07:11 作者: installment 時間: 2025-3-30 09:19
Detecting redundant narrowing derivations by the LSE-SL reducibility test,er, narrowing is still much too inefficient. In this paper we show how reducibility tests can be used to detect redundant narrowing derivations. We introduce a new narrowing strategy, LSE-SL left-to-right basic normal narrowing, prove its completeness for arbitrary canonical term rewriting systems, 作者: 陳列 時間: 2025-3-30 13:48 作者: helper-T-cells 時間: 2025-3-30 19:15
AC unification through order-sorted AC1 unification,ne of the solutions proposed until now is very satisfying because of the huge amount of minimal unifiers of some equations. Unlike many authors, we did not try to speed up computations by optimizing some parts of the algorithm, but we tried to design an extension of the algebra in which unification 作者: cumulative 時間: 2025-3-30 20:59 作者: crumble 時間: 2025-3-31 02:50 作者: 平常 時間: 2025-3-31 08:23 作者: ANTIC 時間: 2025-3-31 12:00 作者: 短程旅游 時間: 2025-3-31 15:28
Proofs in parameterized specifications,ry of the parameterized specification if and only if it holds in the so-called generic algebra. Provided persistency, for any specification morphism, the translated equality holds in the initial algebra of the instantiated specification. Using a notion of generic ground reducibility, a persistency p作者: Monolithic 時間: 2025-3-31 19:05
Completeness of combinations of constructor systems,plete term rewriting systems does not need to be complete. In other words, completeness is not a modular property of term rewriting systems. Toyama, Klop and Barendregt showed that completeness is a modular property of left-linear TRS‘s. In this paper we show that it is sufficient to impose the cons作者: JECT 時間: 2025-3-31 23:05 作者: 頭盔 時間: 2025-4-1 02:13 作者: 弓箭 時間: 2025-4-1 09:58
Program transformation and rewriting,ignature and a set of equations. A term can be computed by rewriting. Transformations come from applying a partial unfailing completion procedure to the original set of equations augmented by inductive theorems and a definition of a new function symbol following diverse heuristics. Moreover, the sys
