標題: Titlebook: Category Theory and Computer Science; 7th International Co Eugenio Moggi,Giuseppe Rosolini Conference proceedings 1997 Springer-Verlag Berl [打印本頁] 作者: 軍械 時間: 2025-3-21 19:14
書目名稱Category Theory and Computer Science影響因子(影響力)
書目名稱Category Theory and Computer Science影響因子(影響力)學科排名
書目名稱Category Theory and Computer Science網絡公開度
書目名稱Category Theory and Computer Science網絡公開度學科排名
書目名稱Category Theory and Computer Science被引頻次
書目名稱Category Theory and Computer Science被引頻次學科排名
書目名稱Category Theory and Computer Science年度引用
書目名稱Category Theory and Computer Science年度引用學科排名
書目名稱Category Theory and Computer Science讀者反饋
書目名稱Category Theory and Computer Science讀者反饋學科排名
作者: ARCHE 時間: 2025-3-21 21:08
A factorisation theorem in rewriting theory,rically that kind of judicious computations, [M] introduces the notion of . derivations in its axiomatic description of Rewriting Systems: a derivation . : . → . is said to be external when the derivation e; f : M → Q is standard whenever the derivation . : . → . is standard..In this article, we sho作者: 人類學家 時間: 2025-3-22 02:17
Monads and modular term rewriting,. In [Lü96], this semantics was used to give a purely categorical proof of the modularity of confluence for the disjoint union of term rewriting systems. This paper provides further support for monadic semantics of rewriting by giving a categorical proof of the most general theorem concerning the mo作者: 小鹿 時間: 2025-3-22 08:16 作者: Mortar 時間: 2025-3-22 12:39
Presheaf models for the ,-calculus, it is shown how this approach can also handle systems where the language of actions may change dynamically as a process evolves. The example is the .-calculus, a calculus for ‘mobile processes’ whose communication topology varies as channels are created and discarded. A denotational semantics is de作者: 細菌等 時間: 2025-3-22 16:52 作者: 細菌等 時間: 2025-3-22 19:10 作者: exclamation 時間: 2025-3-23 00:01 作者: 不吉祥的女人 時間: 2025-3-23 02:55
Combining and representing logical systems,g Goguen and Burstall, we adopt the model-theoretic view of logic as captured in the notion of institution and of parchment (a certain algebraic way of presenting institutions)..We propose a modified notion of parchment together with a notion of parchment morphism and representation, respectively. W作者: ventilate 時間: 2025-3-23 08:05 作者: modest 時間: 2025-3-23 11:46 作者: ACE-inhibitor 時間: 2025-3-23 17:16
Proof principles for datatypes with iterated recursion,s. We study proof principles for such data types in the context of categorical logic, following and extending the approach of [14, 15]. The technical contribution of this paper involves a description of initial algebras and terminal coalgebras in total categories of fibrations for lifted “datafuncto作者: 詞匯 時間: 2025-3-23 18:54
When Do Datatypes Commute?, paper we formulate precisely the polytypic programming problem of “commuting” two datatypes. The precise formulation involves a notion of higher order naturality. We demonstrate via a number of examples the relevance and interest of the problem, and we show that all “regular datatypes" (tree-like d作者: 圓錐體 時間: 2025-3-23 22:40
A calculus for collections and aggregates,emantic foundations of the calculus we introduce a new concept: monads enriched with algebraic structure. We model collection types through enriched monads and aggregate operations through enriched monad algebras. The calculus derives program equivalences that underlie a good number of the optimizat作者: 移植 時間: 2025-3-24 05:10 作者: 制度 時間: 2025-3-24 09:41 作者: 津貼 時間: 2025-3-24 13:55 作者: GROWL 時間: 2025-3-24 18:49
First Interlude: A Contingent Irruptionssion is a careful and detailed analysis of two examples, which tries to outline how the new categorical insights could help in guiding the development of a unifying theory for relations between logical systems.作者: falsehood 時間: 2025-3-24 20:19 作者: 富饒 時間: 2025-3-25 00:11 作者: 調味品 時間: 2025-3-25 05:49
Shedding new light in the world of logical systems,ssion is a careful and detailed analysis of two examples, which tries to outline how the new categorical insights could help in guiding the development of a unifying theory for relations between logical systems.作者: Petechiae 時間: 2025-3-25 11:05 作者: interior 時間: 2025-3-25 13:37 作者: 怪物 時間: 2025-3-25 17:24 作者: 萬神殿 時間: 2025-3-25 22:45
A 2-categorical presentation of term graph rewriting, We exploit the categorical framework to relate term graph rewriting and term rewriting, since gs-monoidal (2-)categories can be regarded as “weak” cartesian (2-) categories, where certain (2-)naturality axioms have been dropped.作者: hedonic 時間: 2025-3-26 03:08
Presheaf models for the ,-calculus,the model, obtained from open maps, coincides with the usual bisimulation obtained from the operational semantics of the .-calculus. While attention is concentrated on the ‘late’ semantics of the .-calculus, it is indicated how the ‘early’ and other variants can also be captured.作者: 多產魚 時間: 2025-3-26 05:54
0302-9743 Santa Margheria Ligure, Italy, in September 1997..Category theory attracts interest in the theoretical computer science community because of its ability to establish connections between different areas in computer science and mathematics and to provide a few generic principles for organizing mathem作者: 忘恩負義的人 時間: 2025-3-26 10:57
Background: Train Operations and Scheduling,ms. This paper provides further support for monadic semantics of rewriting by giving a categorical proof of the most general theorem concerning the modularity of strong normalisation. In the process, we improve upon the technical aspects of earlier work.作者: 農學 時間: 2025-3-26 16:19 作者: Jingoism 時間: 2025-3-26 19:48
https://doi.org/10.1007/978-3-319-30942-2in f, x and e with this property, if (X, d. ) is locally compact. Based on Weihrauch‘s frameworks on computable metric space ([13]), we effectivize this result by showing that there is a computable function of this type. The proof is a direct construction not depending on [8].作者: Ceremony 時間: 2025-3-26 21:41
Monads and modular term rewriting,ms. This paper provides further support for monadic semantics of rewriting by giving a categorical proof of the most general theorem concerning the modularity of strong normalisation. In the process, we improve upon the technical aspects of earlier work.作者: 任意 時間: 2025-3-27 03:18
A deciding algorithm for linear isomorphism of types with complexity ,(,,(,)).,ne of the reasons to consider linear isomorphism of types instead of ordinary isomorphism was that better complexity could be expected. Meanwhile, no upper bounds reasonnably close to linear were obtained. We describe an algorithm deciding if two types are linearly isomorphic with complexity .(..(.)).作者: 過于光澤 時間: 2025-3-27 07:46 作者: SAGE 時間: 2025-3-27 09:52 作者: CRANK 時間: 2025-3-27 17:00 作者: 原來 時間: 2025-3-27 20:35
First Interlude: A Contingent Irruptionrs”. These lifted functors are used to formulate our proof principles. We test these principles by proving some elementary results for four kinds of trees (with finite or infinite breadth or depth) using the proof tool Pvs.作者: 消毒 時間: 2025-3-28 01:13 作者: PAEAN 時間: 2025-3-28 05:09
The Idea of Noir: Fiction, Signifier, Genrepproach to partiality seems new in the literature on categories of partial maps, although it is certainly implicit in the computational point of view, and it relates directly to the question of modularity.作者: 有罪 時間: 2025-3-28 10:05 作者: 聯(lián)想記憶 時間: 2025-3-28 10:27
An introduction to ,-categories, for . < . is an equivalence if it is invertible up to a (. + 1)-morphism that is an equivalence.) We discuss applications of weak .-categories to various subjects including homotopy theory and topological quantum field theory, and review the definition of weak .-categories recently proposed by Dolan and the author.作者: 后天習得 時間: 2025-3-28 14:37
Specifying interaction categories,alysed without fixing a set of axioms, merely in terms of the way in which they are specified —just like algebras are analysed in terms of equations and relations, independently on abstract characterisations of their varieties.作者: PAGAN 時間: 2025-3-28 20:15 作者: ELUDE 時間: 2025-3-29 02:36
When Do Datatypes Commute?,atatypes that one can define in a functional programming language) do indeed commute according to our specification. The framework we use is the theory of allegories, a combination of category theory with the pointfree relation calculus.作者: 大溝 時間: 2025-3-29 05:51
Lifting,pproach to partiality seems new in the literature on categories of partial maps, although it is certainly implicit in the computational point of view, and it relates directly to the question of modularity.作者: 復習 時間: 2025-3-29 07:59 作者: 歌唱隊 時間: 2025-3-29 15:02 作者: 不可磨滅 時間: 2025-3-29 19:11
0302-9743 atical theories. This book presents a selection of 15 revised full papers together with three invited contributions. The topics addressed include reasoning principles for types, rewriting, program semantics, and structuring of logical systems.978-3-540-63455-3978-3-540-69552-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: LASH 時間: 2025-3-29 23:09 作者: ESPY 時間: 2025-3-30 00:59 作者: 粗鄙的人 時間: 2025-3-30 04:29 作者: Gleason-score 時間: 2025-3-30 11:23
978-3-540-63455-3Springer-Verlag Berlin Heidelberg 1997作者: syncope 時間: 2025-3-30 16:16
Category Theory and Computer Science978-3-540-69552-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 蠟燭 時間: 2025-3-30 17:31 作者: 抱狗不敢前 時間: 2025-3-30 22:59 作者: allude 時間: 2025-3-31 03:02
Categorical modelling of structural operational rules case studies,structural operational rules is modelled categorically illustrating the versatility and modularity of the theory. Further, a novel functorial notion of guardedness is introduced which allows for a general and formal treatment of guarded recursive programs.作者: 依法逮捕 時間: 2025-3-31 05:01 作者: travail 時間: 2025-3-31 11:27
Eleni Mikroyannidi,Dong Liu,Robert Leeorphisms, together with various ways of composing them. We survey various concepts of .-category, with an emphasis on ‘weak’ .-categories, in which all rules governing the composition of .-morphisms hold only up to equivalence. (An .-morphism is an equivalence if it is invertible, while a .-morphism作者: forbid 時間: 2025-3-31 15:58
Dmitry Mouromtsev,Mathieu d’Aquinrically that kind of judicious computations, [M] introduces the notion of . derivations in its axiomatic description of Rewriting Systems: a derivation . : . → . is said to be external when the derivation e; f : M → Q is standard whenever the derivation . : . → . is standard..In this article, we sho作者: alabaster 時間: 2025-3-31 18:27
Background: Train Operations and Scheduling,. In [Lü96], this semantics was used to give a purely categorical proof of the modularity of confluence for the disjoint union of term rewriting systems. This paper provides further support for monadic semantics of rewriting by giving a categorical proof of the most general theorem concerning the mo
