Titlebook: Category Theory and Computer Science; Manchester, UK, Sept David H. Pitt,David E. Rydeheard,Axel Poigné Conference proceedings 1989 Springe

召集會(huì)議

書目名稱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é)科排名

使長(zhǎng)胖

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é)

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/222557.jpg

ALE

Category Theory and Computer Science978-3-540-46740-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

nonsensical

GUISE

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

chlorosis

中世紀(jì)

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.

毀壞

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