We show, for an arbitrary adjunction F U : B → A with B Cauchy complete, that the functor F is comonadic if and only if the monad T on A induced by the adjunction is of effective descent type, meaning that the free T-algebra functor F : A → AT is comonadic. This result is applied to several situations: In Section 4 to give a sufficient condition for an exponential functor on a cartesian closed ...

Batch verification of digital signatures is used to improve the computational complexity when large number of digital signatures must be verified. Lee at al. [2] proposed a new method to identify bad signatures in batches efficiently. We show that the method is flawed.

Abstract. We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally cartesian closed category, whereas the additive (product and coproduct) and exponential (⊗-comonoid comonad) structures require additional properties and a...

We give a categorical semantics to the call-by-name and call-by-value versions of Parigot’s -calculus with disjunction types. We introduce the class of control categories, which combine a cartesian-closed structure with a premonoidal structure in the sense of Power and Robinson. We prove, via a categorical structure theorem, that the categorical semantics is equivalent to a CPS semantics in the...

In the first part of this note an elementary proof is given of the fact that algebraic functors, that is, functors induced by morphisms of Lawvere theories, have left adjoints provided that the category K in which the models of these theories take their values is locally presentable. The main focus however lies on the special cases of the underlying functor of the category Grp(K) of internal gr...

We propose a typed calculus of synchronous processes based on the structure of interaction categories. Our aim has been to develop a calculus for concurrency that is canonical in the sense that the typed-calculus is canonical for functional computation. We show strong connections between syntax, logic and semantics, analogous to the familiar correspondence between the typed-calculus, intuitioni...

We call a nitely complete category algebraically coherent if the change-ofbase functors of its bration of points are coherent, which means that they preserve nite limits and jointly strongly epimorphic pairs of arrows. We give examples of categories satisfying this condition; for instance, coherent categories, categories of interest in the sense of Orzech, and (compact) Hausdor algebras over a ...

In this paper I compare two well studied approaches to topological semantics| the domain-theoretic approach, exempli ed by the category of countably based equilogical spaces, Equ, and Type Two E ectivity, exempli ed by the category of Baire space representations, Rep(B ). These two categories are both locally cartesian closed extensions of countably based T0-spaces. A natural question to ask is...

Dialectical logic is the logic of dialectical processes. The goal of dialectical logic is to introduce dynamic notions into logical computational systems. The fundamental notions of proposition and truthvalue in standard logic are subsumed by the notions of process and flow in dialectical logic. Dialectical logic has a standard aspect, which can be defined in terms of the “local cartesian closu...

We introduce container functors as a representation of data types providing a new conceptual analysis of data structures and polymorphic functions. Our development exploits Type Theory as a convenient way to define constructions within locally cartesian closed categories. We show that container morphisms can be full and faithfully interpreted as polymorphic functions (i.e. natural transformatio...