標(biāo)題: Titlebook: CAAP ‘92; 17th Colloquium on T J. -C. Raoult Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Conditional Equations.Diskr [打印本頁] 作者: Helmet 時(shí)間: 2025-3-21 19:18
書目名稱CAAP ‘92影響因子(影響力)
書目名稱CAAP ‘92影響因子(影響力)學(xué)科排名
書目名稱CAAP ‘92網(wǎng)絡(luò)公開度
書目名稱CAAP ‘92網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱CAAP ‘92被引頻次
書目名稱CAAP ‘92被引頻次學(xué)科排名
書目名稱CAAP ‘92年度引用
書目名稱CAAP ‘92年度引用學(xué)科排名
書目名稱CAAP ‘92讀者反饋
書目名稱CAAP ‘92讀者反饋學(xué)科排名
作者: 色情 時(shí)間: 2025-3-21 21:58
,Origin functions in λ-calculus and term rewriting systems,e the origin functions for the λ-calculus and for term rewriting systems that implement this calculus, λ. and λ.. We show that the notions of origin do not correspond exactly, but we describe an extension of the notion of origin that permits the correct computation of λ-calculus origins for derivati作者: 公豬 時(shí)間: 2025-3-22 02:24 作者: amygdala 時(shí)間: 2025-3-22 06:54
Monadic second-order definable graph transductions,s way classes of graph transductions, called . (or more simply .) that are closed under composition and preserve the two known classes of context-free sets of graphs, namely the class of Hyperedge Replacement (HR) and the class of Vertex Replacement (VR) sets. These two classes can be characterized 作者: 有常識 時(shí)間: 2025-3-22 09:51 作者: Increment 時(shí)間: 2025-3-22 13:44
Parallel contraction of fibonacci trees and prefix computations on a family of interconnection topoapplications on parallel computers. Most previous parallel algorithms have been based on the shared-memory model. We present general parallel algorithms for reducing a class of trees and prefix computations under the distributed-memory model. The new algorithms are shown to be communication-efficien作者: Increment 時(shí)間: 2025-3-22 20:41
Graph grammars as context-dependent rewriting systems: A partial ordering semantics,cting contexts and rewrite different items may be applied concurrently, while this cannot happen with a context-independent specification of the same rules. Context-dependent systems can also be seen as a natural generalization of read/write systems, where several readers of the same items may proce作者: 暗諷 時(shí)間: 2025-3-22 22:42 作者: Progesterone 時(shí)間: 2025-3-23 03:10 作者: 婚姻生活 時(shí)間: 2025-3-23 06:49 作者: N斯巴達(dá)人 時(shí)間: 2025-3-23 12:28 作者: 暫停,間歇 時(shí)間: 2025-3-23 14:01 作者: Demonstrate 時(shí)間: 2025-3-23 21:23
Modeling of the Time-Dependent Wave Equationnd VR sets under definable transductions: this gives a version of Parikh‘s Theorem (i.e., the characterization of the commutative images of context-free languages) which extends the classical one and applies to HR and VR sets of graphs.作者: Customary 時(shí)間: 2025-3-23 23:35 作者: micronized 時(shí)間: 2025-3-24 03:23
Physical Constants and Conversion Factors, a principal type, and formulate a needed and sufficient condition typeable rewrite rules should satisfy in order to gain preservance of types under rewriting. As an example we will show that the optimisation function performed after bracket abstraction is typeable. Finally we will present a type ch作者: 歌劇等 時(shí)間: 2025-3-24 07:43
,CTL* and ECTL* as fragments of the modal μ-calculus,作者: 珊瑚 時(shí)間: 2025-3-24 14:38 作者: 變形詞 時(shí)間: 2025-3-24 15:02 作者: Hiatal-Hernia 時(shí)間: 2025-3-24 19:34 作者: 品牌 時(shí)間: 2025-3-24 23:19 作者: 蒸發(fā) 時(shí)間: 2025-3-25 04:57
Microwave Measurement Techniquesave surfaced as tree representations of permutations, as data structures in computer science, and as probabilistic models in diverse applications..We present a unified generating function approach to the enumeration of parameters on such trees. The counting generating functions for several basic par作者: Coma704 時(shí)間: 2025-3-25 11:07
Modeling of the Time-Harmonic Wave Equatione the origin functions for the λ-calculus and for term rewriting systems that implement this calculus, λ. and λ.. We show that the notions of origin do not correspond exactly, but we describe an extension of the notion of origin that permits the correct computation of λ-calculus origins for derivati作者: 種類 時(shí)間: 2025-3-25 15:30
Microwave Sources, Sensors, and Devicesn. We use the notion of ., introduced by J. Tiuryn [26] as a counterpart to the categorical notion of . by C.C. Elgot [15]. We show that a suitable collection of partial equivalence relations is closed under type constructors and forms an iterative algebra. The existence of type interpretations foll作者: PANT 時(shí)間: 2025-3-25 15:50 作者: Longitude 時(shí)間: 2025-3-25 23:44
Microwave Measurement Techniques show that this monad cannot be any of the known power domain constructions, because they do not handle non-termination properly. Instead, a novel construction is proposed and investigated. It embodies both nondeterminism (choice and failure) and possible non-termination caused by recursion.作者: analogous 時(shí)間: 2025-3-26 04:03
Microwave Photonics Components,applications on parallel computers. Most previous parallel algorithms have been based on the shared-memory model. We present general parallel algorithms for reducing a class of trees and prefix computations under the distributed-memory model. The new algorithms are shown to be communication-efficien作者: 大炮 時(shí)間: 2025-3-26 08:12
https://doi.org/10.1007/978-3-319-45427-6cting contexts and rewrite different items may be applied concurrently, while this cannot happen with a context-independent specification of the same rules. Context-dependent systems can also be seen as a natural generalization of read/write systems, where several readers of the same items may proce作者: Aphorism 時(shí)間: 2025-3-26 11:42 作者: 龍蝦 時(shí)間: 2025-3-26 15:05
Penta- and Polynitrogen Compounds, semiring of nonnegative integers, A the “arctical semiring”, T the tropical semiring and F the semiring of finite subsets of nonnegative integers. We show: for semirings N and A it is decidable in polynomial time whether or not the costs of accepting computations is bounded; for F it is decidable i作者: 蚊帳 時(shí)間: 2025-3-26 18:19
Physical Constants and Conversion Factors,Mycroft of Curry‘s type assignment system. The left linear applicative TRS we consider are extensions to those suggested by most functional programming languages in that they do not discriminate against the varieties of function symbols that can be used in patterns. As such there is no distinction b作者: interior 時(shí)間: 2025-3-26 22:07 作者: 無能力 時(shí)間: 2025-3-27 01:41
Power domains supporting recursion and failure, show that this monad cannot be any of the known power domain constructions, because they do not handle non-termination properly. Instead, a novel construction is proposed and investigated. It embodies both nondeterminism (choice and failure) and possible non-termination caused by recursion.作者: 柱廊 時(shí)間: 2025-3-27 08:12 作者: crumble 時(shí)間: 2025-3-27 10:40
Modeling of the Time-Harmonic Wave EquationA constructive interpretation of classical arithmetic in terms of a Kripke-like valuation semantics of proofs is presented. We use this interpretation for motivating a constructive procedure, based on reduction rules, for extracting witnesses from proofs of ∑. sentences in classical arithmetic.作者: 我不明白 時(shí)間: 2025-3-27 14:55
Microwave Measurement TechniquesThe reachability problem for term rewriting systems is to decide whether, given a system S and two terms t and t′, t can be reduced in t′ with rules of S. We study the disjoint union of term rewriting systems whose reachability problem is decidable and give sufficient conditions for obtaining the modularity of decidability of this problem.作者: 一大塊 時(shí)間: 2025-3-27 21:06
Testing by Monitoring Material PropertiesIn this paper we present a decidable restriction of the intersection type discipline, obtained by combining intersection and universal quantification over types. The system, which has a notion of principal type, is a proper extension of the ML type system. A sound and complete type checking algorithm is presented and proved correct.作者: Flatter 時(shí)間: 2025-3-27 22:39 作者: 記憶 時(shí)間: 2025-3-28 02:10
Edoardo Lauria,Antoine Van ProeyenThis paper studies logical definability of tree languages (sets of finite trees). The logical systems we consider are located between first-order logic and monadic second-order logic. We obtain results which clarify the expressive power of first-order logic extended by “modulo counting quantifiers”.作者: CLAIM 時(shí)間: 2025-3-28 07:17
https://doi.org/10.1007/978-3-662-06333-0In this paper we present an algorithm for effectively computing extremal fixed-points of a system of mutually recursive equations over a finite transition system. The proposed algorithm runs in time linear in the size of the transition system and linear in the size of the system of equations, thereby improving on [AC].作者: 出沒 時(shí)間: 2025-3-28 11:21
A constructive valuation interpretation for classical logic and its use in witness extraction,A constructive interpretation of classical arithmetic in terms of a Kripke-like valuation semantics of proofs is presented. We use this interpretation for motivating a constructive procedure, based on reduction rules, for extracting witnesses from proofs of ∑. sentences in classical arithmetic.作者: 虛假 時(shí)間: 2025-3-28 16:31 作者: 嚴(yán)重傷害 時(shí)間: 2025-3-28 20:04 作者: 小爭吵 時(shí)間: 2025-3-29 00:28
A programming language for deriving hypergraphs,Transformations of hypergraphs by applying rewriting rules ate considered. An idea of programming such transformations and a suitable language with a denotational semantics is presented. It is shown that in this language one can program sequential and parallel processes of rewriting as particular cases.作者: 不可知論 時(shí)間: 2025-3-29 05:03
Modulo counting quantifiers over finite trees,This paper studies logical definability of tree languages (sets of finite trees). The logical systems we consider are located between first-order logic and monadic second-order logic. We obtain results which clarify the expressive power of first-order logic extended by “modulo counting quantifiers”.作者: 取消 時(shí)間: 2025-3-29 09:55 作者: Introvert 時(shí)間: 2025-3-29 12:12
https://doi.org/10.1007/3-540-55251-0Conditional Equations; Diskrete Strukturen; Logics and Formal languages; Logik und Formale Sprachen; Pro作者: kidney 時(shí)間: 2025-3-29 18:52
978-3-540-55251-2Springer-Verlag Berlin Heidelberg 1992作者: amphibian 時(shí)間: 2025-3-29 22:24 作者: reserve 時(shí)間: 2025-3-30 02:59
Microwave Measurement Techniques show that this monad cannot be any of the known power domain constructions, because they do not handle non-termination properly. Instead, a novel construction is proposed and investigated. It embodies both nondeterminism (choice and failure) and possible non-termination caused by recursion.作者: 拉開這車床 時(shí)間: 2025-3-30 05:59
Edoardo Lauria,Antoine Van Proeyeng .-EPDTA (a) its a relationship to other Pushdown automata on infinite trees, (b) a Kleene-Closure theorem and (c) a single exponential time algorithm for checking emptiness. We also discuss the relevance of the results presented here to modelchecking.作者: Foment 時(shí)間: 2025-3-30 11:38
Conference proceedings 1992sfieldsof computer science. The scope of CAAP has now beenextended to other discrete structures, like graphs,equations and transformations of graphs,and their linkswith logical theories. The programme committee received 40submissions, from which 19 papers have been selected forinclusion inthis volume.作者: 短程旅游 時(shí)間: 2025-3-30 15:53
Microwave Measurement Techniques of leaves, path length, and level of nodes. In this way it is found that various models share common features: path length is .(. log .), the distribution of node levels and number of leaves are asymptotically normal, etc.作者: 不可比擬 時(shí)間: 2025-3-30 17:32
Compounds of Nitrogen with Noble Gasesribed as a free construction when the parameter category is restricted to injective homomorphisms..An example which does not admit a correct initial semantics but a correct unique persistent quasi-initial semantics demonstrates that the concepts introduced in this paper might be of some importance w.r.t. practical applications.作者: ENNUI 時(shí)間: 2025-3-30 22:41 作者: 腐敗 時(shí)間: 2025-3-31 03:10 作者: 不遵守 時(shí)間: 2025-3-31 08:06 作者: gnarled 時(shí)間: 2025-3-31 12:01 作者: FAZE 時(shí)間: 2025-3-31 14:21
