標(biāo)題: Titlebook: Rewriting Techniques and Applications; Bordeaux, France, Ma Pierre Lescanne Conference proceedings 1987 Springer-Verlag Berlin Heidelberg 1 [打印本頁(yè)] 作者: 衰退 時(shí)間: 2025-3-21 18:13
書目名稱Rewriting Techniques and Applications影響因子(影響力)
書目名稱Rewriting Techniques and Applications影響因子(影響力)學(xué)科排名
書目名稱Rewriting Techniques and Applications網(wǎng)絡(luò)公開度
書目名稱Rewriting Techniques and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Rewriting Techniques and Applications被引頻次
書目名稱Rewriting Techniques and Applications被引頻次學(xué)科排名
書目名稱Rewriting Techniques and Applications年度引用
書目名稱Rewriting Techniques and Applications年度引用學(xué)科排名
書目名稱Rewriting Techniques and Applications讀者反饋
書目名稱Rewriting Techniques and Applications讀者反饋學(xué)科排名
作者: BOOM 時(shí)間: 2025-3-21 23:03
Robert Strandhble case (see the References). We want to bring about some new aspects, which also lead to interesting applications..It is well known that the closed orientable surface of characteristic 2. is a regular two-fold cover of the closed non-orientable surface of characteristic .. Thus, every non-orientab作者: DEAWL 時(shí)間: 2025-3-22 02:41
Stéphane Kaplanble case (see the References). We want to bring about some new aspects, which also lead to interesting applications..It is well known that the closed orientable surface of characteristic 2. is a regular two-fold cover of the closed non-orientable surface of characteristic .. Thus, every non-orientab作者: 丑惡 時(shí)間: 2025-3-22 06:56 作者: 狂熱文化 時(shí)間: 2025-3-22 10:56 作者: 合適 時(shí)間: 2025-3-22 16:50
Eric Sopenable case (see the References). We want to bring about some new aspects, which also lead to interesting applications..It is well known that the closed orientable surface of characteristic 2. is a regular two-fold cover of the closed non-orientable surface of characteristic .. Thus, every non-orientab作者: 收集 時(shí)間: 2025-3-22 17:08 作者: curriculum 時(shí)間: 2025-3-22 22:34
J. C. M. Baeten,J. A. Bergstra,J. W. Klopble case (see the References). We want to bring about some new aspects, which also lead to interesting applications..It is well known that the closed orientable surface of characteristic 2. is a regular two-fold cover of the closed non-orientable surface of characteristic .. Thus, every non-orientab作者: Palter 時(shí)間: 2025-3-23 02:52
M. Dauchet,DE Comiteble case (see the References). We want to bring about some new aspects, which also lead to interesting applications..It is well known that the closed orientable surface of characteristic 2. is a regular two-fold cover of the closed non-orientable surface of characteristic .. Thus, every non-orientab作者: 統(tǒng)治人類 時(shí)間: 2025-3-23 06:37 作者: 你敢命令 時(shí)間: 2025-3-23 11:57
M. Benoisble case (see the References). We want to bring about some new aspects, which also lead to interesting applications..It is well known that the closed orientable surface of characteristic 2. is a regular two-fold cover of the closed non-orientable surface of characteristic .. Thus, every non-orientab作者: hyperuricemia 時(shí)間: 2025-3-23 17:29
Klaus Madlener,Friedrich Ottoble case (see the References). We want to bring about some new aspects, which also lead to interesting applications..It is well known that the closed orientable surface of characteristic 2. is a regular two-fold cover of the closed non-orientable surface of characteristic .. Thus, every non-orientab作者: puzzle 時(shí)間: 2025-3-23 21:46 作者: 胰島素 時(shí)間: 2025-3-24 01:12 作者: Phagocytes 時(shí)間: 2025-3-24 03:09
Leo Bachmair,Nachum Dershowitzalgebras of two modules in that class implies that the modules are isomorphic. A class satisfies a Jacobson radical isomorphism theorem if an isomorphism between only the Jacobson radicals of the endomorphism rings of two modules in that class implies that the modules are isomorphic. Jacobson radica作者: Sedative 時(shí)間: 2025-3-24 09:01 作者: 輕推 時(shí)間: 2025-3-24 11:23
Jean H. Gallier,Wayne Snyderalgebras of two modules in that class implies that the modules are isomorphic. A class satisfies a Jacobson radical isomorphism theorem if an isomorphism between only the Jacobson radicals of the endomorphism rings of two modules in that class implies that the modules are isomorphic. Jacobson radica作者: Omnipotent 時(shí)間: 2025-3-24 15:45 作者: 可行 時(shí)間: 2025-3-24 19:52
Some results about confluence on a given congruence class,he term-rewriting systems under consideration contain unary function symbols only, and all their rules are length-reducing. On the other hand, for certain subclasses of these systems confluence on a given congruence class is decidable.作者: 燈絲 時(shí)間: 2025-3-25 01:43
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/r/image/829958.jpg作者: 轎車 時(shí)間: 2025-3-25 07:00
Conference proceedings 1987This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.作者: 腐爛 時(shí)間: 2025-3-25 10:03
https://doi.org/10.1007/3-540-17220-3Monoid; algorithms; automata; complexity; logic; programming; term rewriting作者: NIL 時(shí)間: 2025-3-25 15:25 作者: guardianship 時(shí)間: 2025-3-25 16:59
Rewriting Techniques and Applications978-3-540-47421-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Deference 時(shí)間: 2025-3-25 23:09
0302-9743 Overview: This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.978-3-540-17220-8978-3-540-47421-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 愉快么 時(shí)間: 2025-3-26 03:18
A compiler for conditional term rewriting systems,In this paper, we present a . for conditional term rewriting systems. With respect to traditional interpreters, the gain in execution time that we obtain is of several orders of magnitude. We discuss several optimizations, among which a method to share code in the premises of the conditional rules, well-adapted to algebraic specifications.作者: Defense 時(shí)間: 2025-3-26 06:37
Term rewriting systems with priorities,Term rewriting systems with rules of different priority are introduced. The semantics are explained in detail and several examples are discussed. . Partial support received from the European Communities under Esprit contract no. 432, Meteor (An integrated formal approach to industrial software development).作者: nepotism 時(shí)間: 2025-3-26 10:40 作者: 不真 時(shí)間: 2025-3-26 15:13
Structured contextual rewriting,In this paper, we develop a mechanism, which we call ., (SCS for short,) to deal with some non-finitely-based algebraic specifications. The sufficient condition for confluence and termination of this kind of systems is also considered, based on a generalization of the approach by O‘Donell.作者: 音樂會(huì) 時(shí)間: 2025-3-26 17:49
Completion for rewriting modulo a congruence,We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our methods as equational inference systems and describe techniques for reasoning about such systems.作者: NIL 時(shí)間: 2025-3-26 22:55
-orientable regular maps having less than 6 faces..Our and earlier results indicate that the orientable case seems to admit in a certain sense much more regular maps than the non-orientable case. This becomes plausible, if we take into consideration the crystallographic aspect. The group of the map 作者: Arthr- 時(shí)間: 2025-3-27 01:20
Robert Strandh-orientable regular maps having less than 6 faces..Our and earlier results indicate that the orientable case seems to admit in a certain sense much more regular maps than the non-orientable case. This becomes plausible, if we take into consideration the crystallographic aspect. The group of the map 作者: Canopy 時(shí)間: 2025-3-27 08:17 作者: Induction 時(shí)間: 2025-3-27 13:26
Ursula Martin-orientable regular maps having less than 6 faces..Our and earlier results indicate that the orientable case seems to admit in a certain sense much more regular maps than the non-orientable case. This becomes plausible, if we take into consideration the crystallographic aspect. The group of the map 作者: 死貓他燒焦 時(shí)間: 2025-3-27 14:35
Paul Walton Purdom Jr.-orientable regular maps having less than 6 faces..Our and earlier results indicate that the orientable case seems to admit in a certain sense much more regular maps than the non-orientable case. This becomes plausible, if we take into consideration the crystallographic aspect. The group of the map 作者: 蠟燭 時(shí)間: 2025-3-27 20:04
Eric Sopena-orientable regular maps having less than 6 faces..Our and earlier results indicate that the orientable case seems to admit in a certain sense much more regular maps than the non-orientable case. This becomes plausible, if we take into consideration the crystallographic aspect. The group of the map 作者: PRO 時(shí)間: 2025-3-28 01:34 作者: 雄偉 時(shí)間: 2025-3-28 02:05
J. C. M. Baeten,J. A. Bergstra,J. W. Klop-orientable regular maps having less than 6 faces..Our and earlier results indicate that the orientable case seems to admit in a certain sense much more regular maps than the non-orientable case. This becomes plausible, if we take into consideration the crystallographic aspect. The group of the map 作者: Middle-Ear 時(shí)間: 2025-3-28 07:13 作者: elastic 時(shí)間: 2025-3-28 11:58 作者: 奴才 時(shí)間: 2025-3-28 15:42 作者: aerobic 時(shí)間: 2025-3-28 22:30
Klaus Madlener,Friedrich Otto-orientable regular maps having less than 6 faces..Our and earlier results indicate that the orientable case seems to admit in a certain sense much more regular maps than the non-orientable case. This becomes plausible, if we take into consideration the crystallographic aspect. The group of the map 作者: 不透明 時(shí)間: 2025-3-29 00:49
Friedrich Otto-orientable regular maps having less than 6 faces..Our and earlier results indicate that the orientable case seems to admit in a certain sense much more regular maps than the non-orientable case. This becomes plausible, if we take into consideration the crystallographic aspect. The group of the map 作者: Dendritic-Cells 時(shí)間: 2025-3-29 06:22
Richard G?belnditions that two systems of PDEs need to fulfill in order to share structure under a given correspondence. Furthermore, it is shown how symmetry groups can be used to identify useful correspondences and structure that is shared up to symmetries. Thereby, the role that B?cklund transformations play 作者: Obloquy 時(shí)間: 2025-3-29 10:39 作者: CREST 時(shí)間: 2025-3-29 12:01 作者: 啞巴 時(shí)間: 2025-3-29 16:20
Jean H. Gallier,Wayne Snydersomorphism theorems and Jacobson radical isomorphism theorems extend to the topological setting. The main result is that the class of reduced modules over a complete discrete valuation domain which contain an unbounded torsion submodule and are divisible modulo torsion satisfy a topological Jacobson作者: BOOR 時(shí)間: 2025-3-29 22:34
Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an aut作者: 羅盤 時(shí)間: 2025-3-29 23:58 作者: 緩和 時(shí)間: 2025-3-30 05:32
Schematization of infinite sets of rewrite rules. Application to the divergence of completion proce作者: 使人煩燥 時(shí)間: 2025-3-30 10:11
Optimizing equational programs,e reduction process. We show that our transformations indeed give . and . the mutual confluence property, thus preserving the output behavior of . when transformed to ...Preserving the output behavior is more general than preserving just normal forms, in that we allow for infinite computations where作者: gratify 時(shí)間: 2025-3-30 16:00
Detecting looping simplifications,the interaction of several rules, but it is limited to those cases where each application of a rule occurs inside of the previous rule application. Experiments suggest that the simplest form of the algorithm is about 80 percent effective in eliminating bad orientations of rules. The algorithm never 作者: 武器 時(shí)間: 2025-3-30 17:26
Code generator generation based on template-driven target term rewriting,struction pattern..The local and global optimizations phases as well as the storage management phase may be realized by multipass rewritings and attribute evaluations of the canonical form..In the last phase of code production, each pattern instruction instance of the updated intermediate form is re作者: 抗體 時(shí)間: 2025-3-30 21:26
Optimizing equational programs,ubterm that matches the left hand side of the equation is replaced by the corresponding right hand side. In that process several . of the term tree are created. Some of these nodes may later turn out to be useless, and will be reclaimed..This paper discusses important relationships between two equat作者: 合適 時(shí)間: 2025-3-31 01:13
How to choose the weights in the Knuth Bendix ordering,weights of the operators they contain. Our purpose in this paper is twofold. First we give some examples to indicate the flexibility of the method. Then we give a simple and practical algorithm, based on the simplex algorithm, for determining whether or not a set of rules can be ordered by a Knuth B作者: Moderate 時(shí)間: 2025-3-31 05:15
Detecting looping simplifications, rewrite rule .→. leads to an infinite sequence of “simplifications”. The rule .→. can be tested in the same way. Rules leading to infinite simplifications should not be included in a rewrite system. In general, the problem of deciding whether a set of rewrite rules leads to infinite simplifications作者: 影響帶來 時(shí)間: 2025-3-31 11:56
Combinatorial hypermap rewriting,a purely combinatorial formulation of the rewriting mechanism. We illustrate this definition by providing a hypermap grammar which generates the set of all connected planar maps. We also investigate a special kind of hypermap grammars, the H-grammars, for which we give a Pumping Theorem enlightening作者: isotope 時(shí)間: 2025-3-31 17:07 作者: 撤退 時(shí)間: 2025-3-31 18:47 作者: Hemiplegia 時(shí)間: 2025-4-1 01:04
Some results about confluence on a given congruence class,he term-rewriting systems under consideration contain unary function symbols only, and all their rules are length-reducing. On the other hand, for certain subclasses of these systems confluence on a given congruence class is decidable.作者: 戰(zhàn)勝 時(shí)間: 2025-4-1 04:55
On equational theories, unification and decidability,t collapse free, collapse free, regular, and Ω-free theories. The relationships between the particular theories are shown and the connection between these classes and the unification hierarchy is pointed out. We give an equational theory that always has a minimal set of unifiers for single equations作者: 薄荷醇 時(shí)間: 2025-4-1 08:00
The word problem for finitely presented monoids and finite canonical rewriting systems,known examples of finitely presented groups that have easily decidable word problem, but that do not meet this condition, this implies that there are finitely presented monoids (and groups) with decidable word problem that cannot be presented by finite canonical rewriting systems.作者: POINT 時(shí)間: 2025-4-1 14:13 作者: Aerophagia 時(shí)間: 2025-4-1 16:57
Combinatorial hypermap rewriting,f all connected planar maps. We also investigate a special kind of hypermap grammars, the H-grammars, for which we give a Pumping Theorem enlightening the combinatorial structure of the generated hypermap languages.
