S. Brookes and S. Geva. Computational Comonads and Intentional Semantics. Technical Report CMU-CS91 -190, School of Computer Science, Carnegie Mellon University, Pittsburgh, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... priority [CH88] divergence and deadlock [vGW89, Wal88] and probability[LS88] Work related to CCS but focusing on equivalences other than bisimulation includes [BIM88, BM89, BM90, dNH84, GS87, GV89, Hen83, Hen85, LS88, Phi86, Pnu85, VG88, dNH84] The theory and practice of CSP is discussed in [Bro83c, Bro83a, Bro83b, BHR84, BHR84, FHLd79, Hoa78, Hoa85, OH86] and elsewhere. Much of this work focuses on the failures semantics, which is an elegant fully abstract semantic based on annotated partial traces. Bro83b] give operational semantics in terms fairly similar to those of CCS. An area sharing some kinship with the theory of CCS and CSP is that of ....

....LS88, Phi86, Pnu85, VG88, dNH84] The theory and practice of CSP is discussed in [Bro83c, Bro83a, Bro83b, BHR84, BHR84, FHLd79, Hoa78, Hoa85, OH86] and elsewhere. Much of this work focuses on the failures semantics, which is an elegant fully abstract semantic based on annotated partial traces. [Bro83b] give operational semantics in terms fairly similar to those of CCS. An area sharing some kinship with the theory of CCS and CSP is that of Process Algebra, exploring equational theories of processes. Bisimulation classes of CCS processes form models for suitable process algebras. Process ....

Stephen Brookes. On the relationship of CCS and CSP. Technical Report CMU-CS-83-111, Carnegie-Mellon University, 1983.

....with effects. In fact, monads permit to focus on the relevant structure of programs disregarding details about the specific effect that a program produces. Comonads are mathematical structures, dual to monads in a categorical sense, that have been used almost entirely in semantics (see e.g. [6, 7, 31, 32]) In recent years, however, there has been a growing interest in investigating the usefulness that comonads may have in programming. Some results in this concern are given by Kieburtz [21] who argues that comonads account naturally for effects that derive from program context. This paper ....

S. Brookes and K. Van Stone. Monads and Comonads in Intensional Semantics. Technical Report CMU-CS-93-140, School of Computer Science, Carnegie Mellon University, 1993.

....with effects. In fact, monads permit to focus on the relevant structure of programs disregarding details about the specific effect that a program produces. Comonads are mathematical structures, dual to monads in a categorical sense, that have been used almost entirely in semantics (see e.g. [6, 7, 31, 32]) In recent years, however, there has been a growing interest in investigating the usefulness that comonads may have in programming. Some results in this concern are given by Kieburtz [21] who argues that comonads account naturally for effects that derive from program context. This paper ....

....taili) SA . Since f # = Nf ffi fl A = f 1 ffi tails for each f : A 1 B, and tails is an unfold, by applying unfold map fusion, law (3) we get f # = hf; taili) SA : A 1 B 1 . That is, f # (s) scons(f(s) f # (tail(s) 2 Other examples of comonads can be found in [6, 21, 31]. In this paper we are interested in studying recursive operators that involve comonadic computations. Combining recursion and comonads requires an analysis of the interaction between comonads and functors representing datatype signatures. For this analysis we will follow the guidelines given in ....

S. Brookes and S. Geva. Computational Comonads and Intensional Semantics. Technical Report CMU-CS-91-190, School of Computer Science, Carnegie Mellon University, 1991.

.... C and g : A Theta X B; and the identity on A in CX is given by fst : A Theta X A. Jacobs [Jac95] refers to this category as the simple slice category. Technically speaking, category CX corresponds to the Kleisli category of the product comonad given by functor MA = A Theta X (see e.g. [BS93]) It is possible to establish a lifting functor ( b Gamma) C CX between C and the category of X actions in the obvious way. On objects, b A = A, while on arrows, b f = f ffi fst : A Theta X B, for f : A B. For example, for each object A of CX , the identity on A in CX is the lifting of ....

S. Brookes and K. Van Stone. Monads and Comonads in Intensional Semantics. Technical Report CMU-CS-93-140, School of Computer Science, Carnegie Mellon University, 1993.

No context found.

S. Brookes and S. Geva. Computational Comonads and Intentional Semantics. Technical Report CMU-CS91 -190, School of Computer Science, Carnegie Mellon University, Pittsburgh, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC