Titlebook: Category Theory and Computer Science; Edinburgh, UK, Septe David H. Pitt,Axel Poigné,David E. Rydeheard Conference proceedings 1987 Springe

Daguerreotype

書目名稱Category Theory and Computer Science影響因子(影響力)




書目名稱Category Theory and Computer Science影響因子(影響力)學科排名




書目名稱Category Theory and Computer Science網(wǎng)絡公開度




書目名稱Category Theory and Computer Science網(wǎng)絡公開度學科排名




書目名稱Category Theory and Computer Science被引頻次




書目名稱Category Theory and Computer Science被引頻次學科排名




書目名稱Category Theory and Computer Science年度引用




書目名稱Category Theory and Computer Science年度引用學科排名




書目名稱Category Theory and Computer Science讀者反饋




書目名稱Category Theory and Computer Science讀者反饋學科排名

溝通

integral

Foundations of equational deduction: A categorical treatment of equational proofs and unification ature of equational deduction is captured by a 2-category. Using this formulation, algorithms for solving equations are derived from general constructions in category theory. The basic unification algorithm arises from constructions of colimits. We also consider solving equations in the presence of t

Phenothiazines

A typed lambda calculus with categorical type constructors, structure includes categorical objects like products and coproducts as well as recursive types like natural numbers and lists. It also allows duals of recursive types, i.e. lazy types, like infinite lists. It has generalized iterators for recursive types and duals of iterators for lazy types. We wi

性冷淡

Final algebras, cosemicomputable algebras, and degrees of unsolvability,of finality to model minimal-state realizations of abstract (software) machines. Given a finite many-sorted signature Σ and a set . of visible sorts, for every Σ-algebra . with co-r.e. behavior and nontrivial, computable .-behavior, there is a finite signature extension Σ′ of Σ (without new sorts) a

profligate

Good functors ... are those preserving philosophy!,ant properties of the . when dealing with so-called . in a hierarchical approach. All our results and counter-examples are very simple, nevertheless they shed light on many common errors in the abstract specification field. We also summarize some properties of the category of models “protecting pred

profligate

Eructation

Connections between partial maps categories and tripos theory,n features: they are both able to model typed first-order logic, and in both structures one can build topoi. In this paper we compare the two structures and we show that, under some conditions, they give rise to equivalent topoi.

額外的事

A category of Galois connections,r in their hom-sets; in the most general category the morphisms are pairs of functions which commute with the maps of the domain and codomain Galois connections. One of our main results is that one of the categories—the one which is the most closely related to the closed and open elements of the Gal

碳水化合物

Definition of Operational Amplifiers,or else there is a continuum of such congruences. There are several necessary and sufficient conditions which separate these two cases. We introduce the notion of the Turing degree of a minimal algebra. Using the results above prove that there is a fixed one-sorted signature such that for every r.e.