A view on implementing processes: Categories of circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1130, Issue , 1996, Pages 237-254

  Hensel, Ulrich ^a   Spooner, David ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; RECONFIGURABLE HARDWARE; SPECIFICATIONS;

CIRCUIT EQUATION; CO INDUCTIONS; DATA TYPE; DETERMINISTIC AUTOMATA; LIVENESS PROPERTIES; PARAMETERIZED; PARTIAL CIRCUITS; TERMINAL COALGEBRAS;

ABSTRACT DATA TYPES;

EID: 84958639327     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61629-2_46     Document Type: Conference Paper

References (14)

1. Samson Abramsky, Simon J. Gay, and Rajagopal Nagarajan. Interaction categories and the foundation of typed concurrent programming. In M.Broy, editor, Deductive Program Design: Proceedings of the 1994 Marktoberdorf Summer School, NATO ASI Series F: Computer and System Sciences. Springer Verlag, 1994.
2. Micheal Barr and Charles Wells. Category Theory for Computing Science. Series in Computer Science. Prentice Hall, second edition, 1995.
3. Francis Borceux. Handbook of Categorical Algebra, volume 1. Cambridge University Press, 1994.
4. A. Carboni, S. Kasangian, and R. Street. Bicategories of spans and relations. Journal of Pure and Applied Algebra, 33:259-267, 1984.
5. J. R. B. Cockett and D. A. Spooner. SPROC categorically. In CONCUR 94: Fifth Internation Conference on Concurrency Theory, Uppsala, Sweden, Lecture Notes in Computer Science. Springer-Verlag, 1994
6. J.R.B. Cockett. Copy categories, submitted, for a copy contact the author: rob inflcpsc. ucalgary.ca, 1995.
7. J. R. B. Cockett and D. Spencer. Strong categorical datatypes ii: A term logic for categorical programming. Theoretical Computer Science, 139:69-113, 1995.
8. J. R. B. Cockett and T. Fukushima. About charity. Technical Report 92/480/18, Department of Computer Science, University of Calgary, 1992.
9. Tatsuya Hagino. A Categorical Programming Language. PhD thesis, University of Edinburgh, 1987.
10. Ulrich Hensel and Horst Reichel. Defining equations in terminal coalgebras. In Egidio Astesiano, Gianna Reggio, and Andrzej Tarlecki, editors, Recent Trends in Data Type Specification, volume 906 of Lecture Notes in Computer Science. Springer Verlag, 1995.
11. P. Katis, N. Sabadini, and R.F.C Walters. The bicategory of processes. Journal of Pure and Applied Algebra, 1995. to appear, available via www from http://theory.doc.ic.ac.uk:80/tfm/papers/WaltersRFC/bicatproc/.
12. Robert Pare. Simply connected limits. Canadian Journal of Mathematics, XLII (4):731-746, 1990.
13. Horst Reichel. An approach to object semantics based on terminal co-algebras. Mathematical Structure in Computer Science, 5:129-152, 1995.
14. Colin Stirling. Modal and temporal logics. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter Modal and Temporal Logics. Oxford Science Publications, 1992