標(biāo)題: Titlebook: Category Theory and Computer Science; Paris, France, Septe David H. Pitt,Pierre-Louis Curien,David E. Rydehea Conference proceedings 1991 S [打印本頁] 作者: HBA1C 時間: 2025-3-21 16:36
書目名稱Category Theory and Computer Science影響因子(影響力)
書目名稱Category Theory and Computer Science影響因子(影響力)學(xué)科排名
書目名稱Category Theory and Computer Science網(wǎng)絡(luò)公開度
書目名稱Category Theory and Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Category Theory and Computer Science被引頻次
書目名稱Category Theory and Computer Science被引頻次學(xué)科排名
書目名稱Category Theory and Computer Science年度引用
書目名稱Category Theory and Computer Science年度引用學(xué)科排名
書目名稱Category Theory and Computer Science讀者反饋
書目名稱Category Theory and Computer Science讀者反饋學(xué)科排名
作者: 忍受 時間: 2025-3-21 20:17
Two results on set-theoretic polymorphism, topos..The second is the . applicable to reflective subcategories of .. It clarifies the way in which they can be regarded as PER models, and has applications to the interpretation of subtyping and bounded quantification.作者: Airtight 時間: 2025-3-22 03:08
Eduardo F. D’Azevedo,Neena Imame coherence theorem. Thus the result extends the theorem with respect to implicational formulas. The set of relevantly balanced formulas is characterized as the set of irrelevant substitution instances of principal type-schemes of BCK-λ-terms.作者: MIRE 時間: 2025-3-22 05:50 作者: Mawkish 時間: 2025-3-22 08:51 作者: MELD 時間: 2025-3-22 16:16
Constructions and predicates,modular approach to programming..Our main result tells that, despite (2), the theory of predicates is as powerful as the theory of constructions: the constructions obstructed by (2) can be recovered in another form using (1). In fact, the theory of constructions is equivalent with a special case of the theory of predicates.作者: MELD 時間: 2025-3-22 18:26
0302-9743 mber3-6, 1991. Category theorycontinues to be an important tool in foundationalstudies incomputer science. It has been widely applied by logicianstoget concise interpretations of many logical concepts. Linksbetweenlogic and computer science have been developed nowfor over twenty years, notably via t作者: 猛然一拉 時間: 2025-3-23 00:03 作者: Optic-Disk 時間: 2025-3-23 03:49 作者: FEIGN 時間: 2025-3-23 08:32 作者: Schlemms-Canal 時間: 2025-3-23 10:36
Categories of information systems,lass of endofunctors continuous on the cpo of morphisms is proved, thus giving canonical solution of domain equations. An effective version of these results, in the general setting, is also provided. Some basic examples of categories of information systems are dealt with.作者: 老巫婆 時間: 2025-3-23 14:47 作者: rods366 時間: 2025-3-23 19:07 作者: 使無效 時間: 2025-3-23 22:58
BCK-formulas having unique proofs,e coherence theorem. Thus the result extends the theorem with respect to implicational formulas. The set of relevantly balanced formulas is characterized as the set of irrelevant substitution instances of principal type-schemes of BCK-λ-terms.作者: 鞭子 時間: 2025-3-24 05:58 作者: 神圣在玷污 時間: 2025-3-24 07:38
Conference proceedings 1991991. Category theorycontinues to be an important tool in foundationalstudies incomputer science. It has been widely applied by logicianstoget concise interpretations of many logical concepts. Linksbetweenlogic and computer science have been developed nowfor over twenty years, notably via the Curry-H作者: 管理員 時間: 2025-3-24 11:24
Bifinite domains: Stable case,rty I are necessary for preserving the ω-algebraicity of the functional space. The remaining "1/3" of property I is also necessary under rather mild hypothesis. As a fall out we show that a stable, countably based, version of L-domains, introduced by Coquand, is contained in . and that such L-domain作者: 向外才掩飾 時間: 2025-3-24 15:04 作者: Congruous 時間: 2025-3-24 19:13 作者: 盟軍 時間: 2025-3-25 03:11
Leila Hadded,Faouzi Ben Charrada,Samir Tatarty I are necessary for preserving the ω-algebraicity of the functional space. The remaining "1/3" of property I is also necessary under rather mild hypothesis. As a fall out we show that a stable, countably based, version of L-domains, introduced by Coquand, is contained in . and that such L-domain作者: BURSA 時間: 2025-3-25 03:47
Prabodh Illukpitiya,Pramatma Khanaltegory of (well-formed) terms. This embedding is exploited to show that rewriting (in the sense of term rewriting systems) over this algebra models faithfully the direct derivations of graphs, described by a double pushout construction along the guidelines of [Eh79]. In particular, we show that also作者: puzzle 時間: 2025-3-25 09:03 作者: exceptional 時間: 2025-3-25 15:24
Local variables and non-interference in algol-like languages,作者: 良心 時間: 2025-3-25 19:09 作者: instulate 時間: 2025-3-25 22:00
David H. Pitt,Pierre-Louis Curien,David E. Rydehea作者: 系列 時間: 2025-3-26 03:41
Conference proceedings 1991logic:the reconstruction of logic based on propositions asresources leads to alternatives to traditional syntaxes. Theproceedings of the previous three category theoryconferences appear as Lecture Notes in Computer ScienceVolumes 240, 283 and 389.作者: 描繪 時間: 2025-3-26 06:15
0302-9743 s. Linear logic:the reconstruction of logic based on propositions asresources leads to alternatives to traditional syntaxes. Theproceedings of the previous three category theoryconferences appear as Lecture Notes in Computer ScienceVolumes 240, 283 and 389.978-3-540-54495-1978-3-540-38413-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: antenna 時間: 2025-3-26 09:56 作者: 結(jié)果 時間: 2025-3-26 15:59 作者: oblique 時間: 2025-3-26 18:10
Eduardo F. D’Azevedo,Neena Imamque normal form proof. Such formulas are defined by the ‘relevance relation’ between type variables in a formula. The set of balanced formulas (or equivalently one-two-formulas) is included in the relevantly balanced formulas. The uniqueness of normal form proofs is known for balanced formulas as th作者: 認(rèn)識 時間: 2025-3-26 21:04 作者: sundowning 時間: 2025-3-27 04:28 作者: 薄荷醇 時間: 2025-3-27 08:29 作者: 橡子 時間: 2025-3-27 10:37 作者: SEVER 時間: 2025-3-27 14:30
George E. Boyhan,Suzanne P. Stonehe so-called ., which form an internal category . in the topos that is, in a certain sense, complete. Polymorphic types are modelled as products indexed by the object of modest sets. The same idea lets us model polymorphism in reflective subcategories of the category of modest sets—for example, the 作者: 幻影 時間: 2025-3-27 17:58 作者: 機制 時間: 2025-3-28 01:18
Optimal Search for Moving Targetsy sending messages over FIFO message channels. In a previous paper, we showed that dataflow networks could be represented as certain spans in a category of automata, or more abstractly, in a category of domains, and we identified some universal properties of various operations for building networks 作者: 摘要 時間: 2025-3-28 05:29 作者: JECT 時間: 2025-3-28 07:57
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/222555.jpg作者: disparage 時間: 2025-3-28 14:13 作者: maladorit 時間: 2025-3-28 15:13
David Knaak,Naveen NamashivayamProof nets, a natural deduction system for multiplicative linear logic (mLL), see作者: badinage 時間: 2025-3-28 20:16
Collapsing graph models by preorders,We present a strategy for obtaining extensional (partial) combinatory algebras by slightly modifying the well-known construction of graph models for the untyped lambda calculus. Using the notion of weak cartesian closed category an elegant interpretation of our construction in a category theoretical setting is given.作者: 惰性女人 時間: 2025-3-28 23:27 作者: 高調(diào) 時間: 2025-3-29 05:01
Applications of the calculus of trees to process description languages,te concurrent calculus. Then, suitable motors that constructively define canonical representatives for strong and observational congruence based on the notion of bisimulation are introduced in a clean and straightforward way. This enables us to provide the calculus with a fully abstract semantics up to the above congruences.作者: Endometrium 時間: 2025-3-29 10:16
https://doi.org/10.1007/BFb0013452Category Theory; Domain Theory; Linear Logic; Lineare Logic; Programming Languages; Semantics; Semantik vo作者: 有雜色 時間: 2025-3-29 12:28
978-3-540-54495-1Springer-Verlag Berlin Heidelberg 1991作者: 時代 時間: 2025-3-29 16:08 作者: 經(jīng)典 時間: 2025-3-29 20:19
Optimal Search for Moving Targetste concurrent calculus. Then, suitable motors that constructively define canonical representatives for strong and observational congruence based on the notion of bisimulation are introduced in a clean and straightforward way. This enables us to provide the calculus with a fully abstract semantics up to the above congruences.作者: resilience 時間: 2025-3-30 02:23
Bifinite domains: Stable case,nites (or equivalently sfp) over .. Its objects are characterized as ω-algebraic Cpos∧ satisfying a "combination" of property M, as in Smyth theorem, and property ., as introduced by Berry, that we call property (MI)*..We "test" the category . via a series of classical constructions in domain theory作者: Ligneous 時間: 2025-3-30 06:50
Categories of information systems, proposed axioms introduce a global partial order on the morphisms of the category, making them an ω-algebraic cpo. An initial algebra theorem for a class of endofunctors continuous on the cpo of morphisms is proved, thus giving canonical solution of domain equations. An effective version of these r作者: Cryptic 時間: 2025-3-30 12:13 作者: ARIA 時間: 2025-3-30 13:10
Tail recursion from universal invariants,eting tail recursion by means of the colimit of a loop diagram, i.e. its universal invariant. Parametrised initial algebras always have universal invariants, while the converse holds in the presence of equalisers..Consequences include categorical descriptions of vectors and matrices, which allow def作者: 健壯 時間: 2025-3-30 20:26 作者: Alienated 時間: 2025-3-30 23:01
Constructions and predicates,ints: (1) a simple new operation is added — to represent a constructive version of the .; (2) a restriction on contexts is imposed — "sets" must not depend on "proofs" of "predicates". The resulting theory is called .. Sufficiently constructive arguments from naive set theory can be directly written作者: anus928 時間: 2025-3-31 04:23
Relating models of impredicative type theories,onstructions and Higher Order ML. The latter is particularly interesting because it is a two-level type theory with type dependency at both levels. Having described appropriate categorical structures for these calculi, we establish translations back and forth between all of them. Most of the researc作者: 叫喊 時間: 2025-3-31 08:57 作者: callous 時間: 2025-3-31 12:46
An algebra of graphs and graph rewriting,ay be interpreted as graphs having both a concrete part and an abstract part (defined up to isomorphism). Morphisms between pa-graphs are pushout squares. We show that the basic notions of the algebraic theory of graph grammars [Eh79] (instantiated to a suitable category of graphs) can be rephrased 作者: HEPA-filter 時間: 2025-3-31 17:26 作者: 性冷淡 時間: 2025-3-31 20:55
Applications of the calculus of trees to process description languages,te concurrent calculus. Then, suitable motors that constructively define canonical representatives for strong and observational congruence based on the notion of bisimulation are introduced in a clean and straightforward way. This enables us to provide the calculus with a fully abstract semantics up
