Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Benson, David B.
Affiliations: Computer Science Department, Washington State University, Pullman, Washington, 99164-1210, U.S.A., csnet: [email protected]
Note: [1] Research supported in part by National Science Foundation grants DCR-8402305 and CCR-8801886.
Abstract: A categorical bimonoid consists of a monoid and a comonoid which act homomorphically on one another. In applications bimonoids are typically called bialgebras or Hopf algebras. The definitions are given at a level suitable to computer science applications and examples are included. The elements of the theory of graded bialgebras are developed and we provide a universal recursion theorem for morphisms between algebras and between coalgebras. With this theory we explicate refinements of concurrent programs and give a treatment of traces. The concluding section characterizes all coalgebras which interact with the match algebra to form a bialgebra and characterizes all algebras which interact with the fork (diagonal) coalgebra to form a bialgebra.
DOI: 10.3233/FI-1989-12402
Journal: Fundamenta Informaticae, vol. 12, no. 4, pp. 427-486, 1989
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]