標(biāo)題: Titlebook: Category Theory and Computer Science; 6th International Co David Pitt,David E. Rydeheard,Peter Johnstone Conference proceedings 1995 Spring [打印本頁] 作者: Roosevelt 時(shí)間: 2025-3-21 16:26
書目名稱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é)科排名
作者: 極微小 時(shí)間: 2025-3-21 20:24
0302-9743 e, UK in August 1995..The 15 revised full papers included in the volume document the exploitation of links between logic and category theory leading to a solid basis for much of the understanding of the semantics of computation. Notable amongst other advances is the introduction of linear logic and 作者: medium 時(shí)間: 2025-3-22 00:34 作者: 神刊 時(shí)間: 2025-3-22 04:57 作者: 紋章 時(shí)間: 2025-3-22 09:42
Ana Hategan MD,James A. Bourgeois OD, MDin the sense that we can decompose typed lambda calculus into them and, conversely, the combination of them is equivalent to typed lambda calculus. This decomposition is a consequence of a semantic analysis on typed lambda calculus due to C. Hermida and B. Jacobs [HJ94].作者: 不給啤 時(shí)間: 2025-3-22 15:56 作者: 不給啤 時(shí)間: 2025-3-22 20:39
Lifting as a KZ-doctrine, relation. By imposing further axioms we can, on the one hand, endow maps and proofs of their approximations (viz. .) with the 2-dimensional algebraic structure of a sesqui-category and, on the other, characterise lifting as a preorder-enriched lax colimit. As a consequence of the latter the . (or partial map classifier) . becomes a ..作者: 詞匯表 時(shí)間: 2025-3-22 21:27 作者: 流利圓滑 時(shí)間: 2025-3-23 05:03
Conference proceedings 1995ugust 1995..The 15 revised full papers included in the volume document the exploitation of links between logic and category theory leading to a solid basis for much of the understanding of the semantics of computation. Notable amongst other advances is the introduction of linear logic and other subs作者: exhilaration 時(shí)間: 2025-3-23 08:26
0302-9743 other substructural logics, providing a new approach to proof theory. Further aspects covered are semantics of lambda calculi and type theories, program specification and development, and domain theory..978-3-540-60164-7978-3-540-44661-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 策略 時(shí)間: 2025-3-23 12:12 作者: 嚙齒動(dòng)物 時(shí)間: 2025-3-23 17:40
Organization and Management of IVF Unitsets and transition systems can be described as dualities induced by schizophrenic objects, leading further the analogy with classical representation theorems and giving us a means to describe uniformly previously known translations between nets and automata.作者: 污穢 時(shí)間: 2025-3-23 19:39 作者: MUMP 時(shí)間: 2025-3-23 22:51 作者: disparage 時(shí)間: 2025-3-24 05:04 作者: defeatist 時(shí)間: 2025-3-24 09:46
A category-theoretic treatment of a parallel algol-like language,language [Rey83, Ole82], and a “transition traces” model for shared-variable programs [Bro93], to produce a semantics for a parallel Algol-like language. Each type is interpreted as a functor from the category of possible worlds into a category of domains and continuous functions; each well-typed ph作者: cogent 時(shí)間: 2025-3-24 12:35 作者: Legend 時(shí)間: 2025-3-24 18:45
Categorical reconstruction of a reduction free normalization proof,作者: kyphoplasty 時(shí)間: 2025-3-24 21:49 作者: 蔓藤圖飾 時(shí)間: 2025-3-25 01:16 作者: Type-1-Diabetes 時(shí)間: 2025-3-25 03:33 作者: AFFIX 時(shí)間: 2025-3-25 07:43
978-3-540-60164-7Springer-Verlag Berlin Heidelberg 1995作者: grotto 時(shí)間: 2025-3-25 13:25 作者: Incisor 時(shí)間: 2025-3-25 16:49
Effective applicative structures,position, and containing projections, universal functions and functions .. of the s-m-n theorem of Recursion Theory. The notion of EAS is developed as an abstract approach to computability, filling a notational gap between functional and combinatorial theories.作者: MAZE 時(shí)間: 2025-3-25 20:58
V-comprehensions and P space,d compatible unary and dyadic safe recursions. Here . is the partial order → ←. This characterization glues together, along the two sides of ., FP 2-comprehension based characterizations of linear space and P time.作者: CLEAR 時(shí)間: 2025-3-26 00:40 作者: 管理員 時(shí)間: 2025-3-26 05:00
Organization and Management of IVF Unitsructing the net, has been solved in the litterature for various types of nets, ranging from elementary nets to Petri nets. The common principle for the synthesis is the idea of regions in graphs, representing possible extensions of places in nets. When the synthesis problem has a solution, the set o作者: 要素 時(shí)間: 2025-3-26 12:26 作者: 安撫 時(shí)間: 2025-3-26 15:54 作者: 裂縫 時(shí)間: 2025-3-26 17:23
Intelligent Power Networks On-Chipmorphisms are those monotonie functions between posets that are “realized” by continuous functions between the associated cpos. The category of cpos is contained as a full subcategory that is preserved by lifting, sums, products and function spaces. The construction of the powerdomain uses a cpo of 作者: absorbed 時(shí)間: 2025-3-26 21:48
https://doi.org/10.1007/978-3-319-29788-0relation)— is defined. It is shown that if such a category admits . then it preorderenriches (as a cartesian closed category) with respect to the path relation. By imposing further axioms we can, on the one hand, endow maps and proofs of their approximations (viz. .) with the 2-dimensional algebraic作者: dictator 時(shí)間: 2025-3-27 04:18 作者: 非秘密 時(shí)間: 2025-3-27 06:17 作者: 油膏 時(shí)間: 2025-3-27 13:25
Ana Hategan MD,James A. Bourgeois OD, MDd compatible unary and dyadic safe recursions. Here . is the partial order → ←. This characterization glues together, along the two sides of ., FP 2-comprehension based characterizations of linear space and P time.作者: 隱士 時(shí)間: 2025-3-27 16:35
Category Theory and Computer Science978-3-540-44661-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 離開可分裂 時(shí)間: 2025-3-27 19:22
Scaling Trends of On-Chip Power Noiseposition, and containing projections, universal functions and functions .. of the s-m-n theorem of Recursion Theory. The notion of EAS is developed as an abstract approach to computability, filling a notational gap between functional and combinatorial theories.作者: 愛社交 時(shí)間: 2025-3-27 22:12
Ana Hategan MD,James A. Bourgeois OD, MDd compatible unary and dyadic safe recursions. Here . is the partial order → ←. This characterization glues together, along the two sides of ., FP 2-comprehension based characterizations of linear space and P time.作者: 有偏見 時(shí)間: 2025-3-28 05:40 作者: Fibrin 時(shí)間: 2025-3-28 09:29 作者: Diastole 時(shí)間: 2025-3-28 13:45 作者: MURKY 時(shí)間: 2025-3-28 16:58
Dualities between nets and automata induced by schizophrenic objects,ructing the net, has been solved in the litterature for various types of nets, ranging from elementary nets to Petri nets. The common principle for the synthesis is the idea of regions in graphs, representing possible extensions of places in nets. When the synthesis problem has a solution, the set o作者: Minikin 時(shí)間: 2025-3-28 21:31
Relational set theory, The relational framework of set theory provides a general methodology for the fundamental study on computer and information sciences such as theory of graph transformation, situation semantics and analysis of knowledge dynamics in distributed systems. To demonstrate the feasibility of relational se作者: harangue 時(shí)間: 2025-3-29 00:33
Effective applicative structures,position, and containing projections, universal functions and functions .. of the s-m-n theorem of Recursion Theory. The notion of EAS is developed as an abstract approach to computability, filling a notational gap between functional and combinatorial theories.作者: 截?cái)?nbsp; 時(shí)間: 2025-3-29 05:51
The convex powerdomain in a category of posets realized by cpos,morphisms are those monotonie functions between posets that are “realized” by continuous functions between the associated cpos. The category of cpos is contained as a full subcategory that is preserved by lifting, sums, products and function spaces. The construction of the powerdomain uses a cpo of 作者: 口訣 時(shí)間: 2025-3-29 10:59 作者: abduction 時(shí)間: 2025-3-29 12:06 作者: 必死 時(shí)間: 2025-3-29 18:04
Decomposing typed lambda calculus into a couple of categorical programming languages, complementary to each other — one of them provides a first-order programming style whereas the other does higher-order — and are “children” of the . in the sense that we can decompose typed lambda calculus into them and, conversely, the combination of them is equivalent to typed lambda calculus. Th作者: LUT 時(shí)間: 2025-3-29 21:58 作者: 反話 時(shí)間: 2025-3-30 00:22
9樓作者: AORTA 時(shí)間: 2025-3-30 04:35
9樓作者: nocturia 時(shí)間: 2025-3-30 09:36
9樓作者: 古董 時(shí)間: 2025-3-30 15:49
9樓作者: 傻瓜 時(shí)間: 2025-3-30 17:47
10樓作者: chalice 時(shí)間: 2025-3-30 23:51
10樓作者: 賄賂 時(shí)間: 2025-3-31 02:25
10樓作者: intrigue 時(shí)間: 2025-3-31 08:52
10樓
