標(biāo)題: Titlebook: Category Theory and Computer Science; Manchester, UK, Sept David H. Pitt,David E. Rydeheard,Axel Poigné Conference proceedings 1989 Springe [打印本頁] 作者: 召集會議 時間: 2025-3-21 19:44
書目名稱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 21:36
Graded multicategories of polynomial-time realizers,ents. This system is sound for a notion of polynomial-time realizability. An extension of the grading is also considered, giving a notion of “dependant grades”, which is also sound. Furthermore, we define a notion of closed graded multicategory, and show how the structure of polynomial-time realizers has that structure.作者: 團(tuán)結(jié) 時間: 2025-3-22 04:10
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/222557.jpg作者: ALE 時間: 2025-3-22 05:21
Category Theory and Computer Science978-3-540-46740-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: nonsensical 時間: 2025-3-22 11:47 作者: GUISE 時間: 2025-3-22 16:38
Sudip Misra,Barun Kumar Saha,Sujata Palists a model where all syntactical concepts can be interpreted with one exception: in the model the strong sum of a family of propositions indexed over a proposition need not be a proposition again. The method of proof consists of restricting the set of propositions in the well-known ω-Set model due to E. Moggi.作者: GUISE 時間: 2025-3-22 18:14 作者: chlorosis 時間: 2025-3-22 22:03 作者: 中世紀(jì) 時間: 2025-3-23 01:31
A note on categorical datatypes,It is shown how Hagino‘s categorical datatypes can be expressed in the polymorphic typed λ-calculus. This gives a way of passing from a description of a datatype in terms of its universal properties, to a representation in terms of λ-expressions.作者: 毀壞 時間: 2025-3-23 08:10
https://doi.org/10.1007/978-3-319-28793-5eaving and “truly concurrent”, distributed aspects of CCS (without recursion). Among the objects of . and . we choose two . models, called M and . respectively. We show that our interleaving model M essentially coincides with the classical transition system of CCS, while the distributed model . fait作者: 破裂 時間: 2025-3-23 10:26
Bases and Transforms of Set Functions,vents, and the event labels represent the actions performed. In this paper we extend this basis to encompass other temporal metrics by generalizing partial orders to generalized metric spaces, an interpretation of enriched categories due to Lawvere..Two needs then arise: a means of specifying kinds 作者: BAIL 時間: 2025-3-23 17:43
A Geometric Approach to MV-Algebras, . : . → . and .are morphisms of C. We define an algebra of relations in C, including operations of “relabeling,” “sequential composition,” “parallel composition,” and “feedback,” which correspond intuitively to ways in which processes can be composed into networks. Each of these operations is defin作者: colony 時間: 2025-3-23 21:49
A Geometric Approach to MV-Algebras,es to labels. We study a second-order type system over these operations, supporting both subtyping and polymorphism. Our approach unifies and extends previous notions of records, bounded quantification, record extension, and parametrization by row-variables. The general aim is to provide foundations作者: 寄生蟲 時間: 2025-3-24 00:31 作者: 受人支配 時間: 2025-3-24 05:56
https://doi.org/10.1007/978-3-319-28880-2inction between compile-time, when type-expressions are evaluated, and run-time, when value-expressions are evaluated. This paper proposes a new explanation based on “programming languages as indexed categories” and illustrates, as an application, how ML should be extended to support higher order mo作者: NUL 時間: 2025-3-24 06:46 作者: STEER 時間: 2025-3-24 11:24
Sudip Misra,Barun Kumar Saha,Sujata Palactorisation through candidates. There are many mathematical examples, including the . of a ring (as shown by Diers [81]) and the . of a polynomial, but we are mainly interested in Berry‘s [78] .. In fact we begin with a completely non-mathematical example..The aim is to find domain models in which 作者: 哎呦 時間: 2025-3-24 17:19
Sudip Misra,Barun Kumar Saha,Sujata Palents. This system is sound for a notion of polynomial-time realizability. An extension of the grading is also considered, giving a notion of “dependant grades”, which is also sound. Furthermore, we define a notion of closed graded multicategory, and show how the structure of polynomial-time realizer作者: irradicable 時間: 2025-3-24 19:10
Sudip Misra,Barun Kumar Saha,Sujata Palrt) in set-theoretical formulation and one category-theoretical by Seely, based on hyperdoctrines. Using notions from Hayashi [1985], we adapt Seely‘s definition in such a way that a model of (non-extensional) 2. order λ-calculus is obtained that satisfies the ζ-rules for the interpretation with val作者: 暫時過來 時間: 2025-3-24 23:36 作者: craven 時間: 2025-3-25 05:37
Deepa Bose MBBS, FRCS, FRCS (Tr & Orth)lopment environment. In previous work we have developed a theory of representation of logics in a logical framework and considered the behaviour of structured theory presentations under representation. That work was based on the simplifying assumption that logics are characterized as families of con作者: CEDE 時間: 2025-3-25 10:47
https://doi.org/10.1007/978-3-319-29122-2is yields algebraic characterizations of unification type unitary (resp. finitary for unification with constants). We thus obtain the well-known results for abelian groups, abelian monoids and idempotent abelian monoids as well as some new results as corollaries to a general theorem. In addition, it作者: orthodox 時間: 2025-3-25 13:57 作者: 潔凈 時間: 2025-3-25 18:20
Staff Management: Leading by Examplesh a systematic correspondence between Petri nets, linear logic theories, and linear categories. Such a correspondence sheds new light on the relationships between linear logic and concurrency, and on how both areas are related to category theory. Categories are here viewed as concurrent systems who作者: giggle 時間: 2025-3-25 23:27
https://doi.org/10.1007/BFb0018340Denotationelle Semantik; Kategorientheorie; Lamda-Kalkül; Semantik von Programmiersprachen; calculus; log作者: 職業(yè)拳擊手 時間: 2025-3-26 04:08 作者: ACME 時間: 2025-3-26 07:41 作者: Irrepressible 時間: 2025-3-26 10:09 作者: PAGAN 時間: 2025-3-26 15:29
https://doi.org/10.1007/978-3-319-28793-5ransition systems, which embody synchronization algebras. Another advantage of categories is the use of free adjoints of forgetful functors for constructing the models and for comparing transition systems having similar, but different, structures.作者: Mettle 時間: 2025-3-26 19:32 作者: 心神不寧 時間: 2025-3-26 22:07 作者: Creditee 時間: 2025-3-27 04:19
Sudip Misra,Barun Kumar Saha,Sujata Palot fully describe the function-spaces, which should be equipped with the “.”; this turns out to mean that function-tokens must have “internal symmetries”. It is our purpose to describe the smallest cartesian closed category with these function-spaces which contains Set (the simplest non-trivial quan作者: Judicious 時間: 2025-3-27 08:52
An algebraic view of interleaving and distributed operational semantics for CCS,ransition systems, which embody synchronization algebras. Another advantage of categories is the use of free adjoints of forgetful functors for constructing the models and for comparing transition systems having similar, but different, structures.作者: 藐視 時間: 2025-3-27 10:27
Temporal structures, and . ? ? that of .-structured ?-labeled spaces. Finally we establish the continuity of these operators..We define the kind language KL whose terms are formed via the operators ! and ? from constants for the basic kinds. A KL kind is the denotation of a KL term, by induction on which we obtain that作者: 幸福愉悅感 時間: 2025-3-27 17:27
Compositional relational semantics for indeterminate dataflow networks,en define a category EvDom of “event domains,” a (non-full) subcategory of the category of Scott domains and continuous maps, and we obtain a coreflection between Auto and EvDom. It follows, by the limit-preserving properties of coreflectors, that the denotational semantics in which dataflow network作者: Spirometry 時間: 2025-3-27 19:31 作者: crease 時間: 2025-3-28 01:25
An algebraic view of interleaving and distributed operational semantics for CCS,eaving and “truly concurrent”, distributed aspects of CCS (without recursion). Among the objects of . and . we choose two . models, called M and . respectively. We show that our interleaving model M essentially coincides with the classical transition system of CCS, while the distributed model . fait作者: N斯巴達(dá)人 時間: 2025-3-28 04:17 作者: forthy 時間: 2025-3-28 08:59
Compositional relational semantics for indeterminate dataflow networks, . : . → . and .are morphisms of C. We define an algebra of relations in C, including operations of “relabeling,” “sequential composition,” “parallel composition,” and “feedback,” which correspond intuitively to ways in which processes can be composed into networks. Each of these operations is defin作者: MAG 時間: 2025-3-28 10:29 作者: 概觀 時間: 2025-3-28 18:33
Projections for polymorphic strictness analysis,erpret parameterised types as functors in a suitable category, and show that they preserve monics and epics. Then we define “strong” and “weak” polymorphism — the latter admitting certain projections that are not polymorphic in the usual sense. We prove that, under the right conditions, a weakly pol作者: 刺耳的聲音 時間: 2025-3-28 21:29 作者: faculty 時間: 2025-3-29 00:26 作者: 執(zhí)拗 時間: 2025-3-29 05:25 作者: 檔案 時間: 2025-3-29 09:08 作者: Heart-Rate 時間: 2025-3-29 12:44
On the semantics of second order lambda calculus: From bruce-meyer-mitchell models to hyperdoctrinert) in set-theoretical formulation and one category-theoretical by Seely, based on hyperdoctrines. Using notions from Hayashi [1985], we adapt Seely‘s definition in such a way that a model of (non-extensional) 2. order λ-calculus is obtained that satisfies the ζ-rules for the interpretation with val作者: blackout 時間: 2025-3-29 15:48
Declarative continuations: An investigation of duality in programming language semantics,tension of the typed λ-calculus is introduced, where values and continuations play dual roles, permitting mirror-image syntax for dual categorical concepts like products and coproducts. An implementable semantic description and a static type system for this calculus are presented. We also give a cat作者: inscribe 時間: 2025-3-29 22:20
Logic representation in LF,lopment environment. In previous work we have developed a theory of representation of logics in a logical framework and considered the behaviour of structured theory presentations under representation. That work was based on the simplifying assumption that logics are characterized as families of con作者: 逗它小傻瓜 時間: 2025-3-30 03:04 作者: 修改 時間: 2025-3-30 07:32
An abstract formulation for rewrite systems,ate some fundamental properties of rewrites. Recent developments in the general theory of 2-categories are then used to give a theorem stating conditions under which rewrite derivations exist, and to give further conditions under which there is a normal form for a derivation, hence a deterministic m作者: 整潔漂亮 時間: 2025-3-30 12:13 作者: CROAK 時間: 2025-3-30 12:43 作者: indicate 時間: 2025-3-30 18:18 作者: 洞穴 時間: 2025-3-30 21:04 作者: addition 時間: 2025-3-31 04:06
Operations on records,previous notions of records, bounded quantification, record extension, and parametrization by row-variables. The general aim is to provide foundations for concepts found in object-oriented languages, within the framework of typed lambda-calculus.作者: Dignant 時間: 2025-3-31 07:19
Declarative continuations: An investigation of duality in programming language semantics,cepts like products and coproducts. An implementable semantic description and a static type system for this calculus are presented. We also give a categorical description of the language, by presenting a correspondence with a system of combinatory logic, similar to a cartesian closed category, but with a completely symmetrical set of axioms.作者: 芭蕾舞女演員 時間: 2025-3-31 09:19
Unification properties of commutative theories: A categorical treatment,ts for abelian groups, abelian monoids and idempotent abelian monoids as well as some new results as corollaries to a general theorem. In addition, it is shown that constant-free unification problems in “commutative” theories are either unitary or of unification type zero and we give an example of a “commutative” theory of type zero.作者: 流眼淚 時間: 2025-3-31 14:41
https://doi.org/10.1007/978-3-319-28880-2 polymorphic information to a particular instance very simply. The categorical approach simplifies our proofs, enabling them to be carried out at a higher level, and making them independent of the precise form of the programming language to be analysed.作者: inchoate 時間: 2025-3-31 18:55
Deepa Bose MBBS, FRCS, FRCS (Tr & Orth)ow how they may be induced from a logical system of closed sentences. The technical notions of a logic presentation and a uniform encoding of a logical system in LF are generalized to the present setting.作者: MEEK 時間: 2025-3-31 23:09 作者: Hemodialysis 時間: 2025-4-1 02:14 作者: TOM 時間: 2025-4-1 08:14 作者: Gastric 時間: 2025-4-1 11:55
