召集会议
发表于 2025-3-21 19:44:06
书目名称Category Theory and Computer Science影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0222557<br><br> <br><br>书目名称Category Theory and Computer Science影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0222557<br><br> <br><br>书目名称Category Theory and Computer Science网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0222557<br><br> <br><br>书目名称Category Theory and Computer Science网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0222557<br><br> <br><br>书目名称Category Theory and Computer Science被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0222557<br><br> <br><br>书目名称Category Theory and Computer Science被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0222557<br><br> <br><br>书目名称Category Theory and Computer Science年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0222557<br><br> <br><br>书目名称Category Theory and Computer Science年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0222557<br><br> <br><br>书目名称Category Theory and Computer Science读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0222557<br><br> <br><br>书目名称Category Theory and Computer Science读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0222557<br><br> <br><br>
使长胖
发表于 2025-3-21 21:36:07
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.
团结
发表于 2025-3-22 04:10:23
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/222557.jpg
ALE
发表于 2025-3-22 05:21:11
Category Theory and Computer Science978-3-540-46740-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
nonsensical
发表于 2025-3-22 11:47:51
http://reply.papertrans.cn/23/2226/222557/222557_5.png
GUISE
发表于 2025-3-22 16:38:41
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:59
http://reply.papertrans.cn/23/2226/222557/222557_7.png
chlorosis
发表于 2025-3-22 22:03:08
http://reply.papertrans.cn/23/2226/222557/222557_8.png
中世纪
发表于 2025-3-23 01:31:43
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:06
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