Coinductive interpreters for process calculi

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

Volumn 2441, Issue , 2002, Pages 183-197

  Barbosa, Luís Soares ^a   Oliveira, José Nuno ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Applications; Coinductive types; Functional programming

Indexed keywords

APPLICATIONS; BIOMINERALIZATION; CALCULATIONS; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; LOGIC PROGRAMMING; NETWORK SECURITY; PATHOLOGY; RECONFIGURABLE HARDWARE;

BEHAVIOUR MODELS; COINDUCTIVE TYPES; INTERACTION STRUCTURES; PROCESS CALCULI; PROCESS LANGUAGES; PROTOTYPING PROCESS; STRUCTURAL ASPECTS;

FUNCTIONAL PROGRAMMING;

EID: 34249993479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45788-7     Document Type: Conference Paper

References (18)

1. [1] P. Aczel. Final universes of processes. In Brooks et al, editor, Proc. Math. Foundations of Programming Semantics. Springer Lect. Notes Comp. Sci. (802), 1993.
2. L. S. Barbosa. Process calculi à la Bird-Meertens. In CMCS’01 - Workshop on Coalgebraic Methods in Computer Science, pages 47–66, Genova, April 2001. ENTCS, volume 444, Elsevier.
3. [3] R. Bird and O. Moor. The Algebra of Programming. Series in Computer Science. Prentice-Hall International, 1997.
4. [4] R. Cockett and T. Fukushima. About Charity. Yellow Series Report No. 92/480/18, Dep. Computer Science, University of Calgary, June 1992.
5. [5] R. Cockett and D. Spencer. Strong categorical datatypes I. In R.A.G. Seely, editor, Proceedings of Int. Summer Category Theory Meeting, Montréal, Québec, 23–30 June 1991, pages 141–169. AMS, CMS Conf. Proceedings 13, 1992.
6. [6] T. Hagino. A typed lambda calculus with categorical type constructors. In D.H. Pitt, A. Poigné, and D.E. Rydeheard, editors, Category Theory and Computer Science, pages 140–157. Springer Lect. Notes Comp. Sci. (283), 1987.
7. [7] B. Jacobs. Objects and classes, co-algebraically. In C. Lengauer B. Freitag, C.B. Jones and H.-J. Schek, editors, Object-Orientation with Parallelism and Persistence, pages 83–103. Kluwer Academic Publishers, 1996.
8. [8] P. Jansson and J. Jeuring. PolyP - a polytypic programming language extension. In POPL’97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 470–482. ACM Press, 1997.
9. [9] R.B. Kieburtz. Codata and comonads in Haskell. Unpublished manuscript, 1998.
10. [10] A. Kock. Strong functors and monoidal monads. Archiv für Mathematik, 23:113–120, 1972.
11. [11] M. Lenisa. Themes in Final Semantics. PhD thesis, Universita de Pisa-Udine, 1998.
12. [12] L. Meertens. Paramorphisms. Formal Aspects of Computing, 4(5):413–425, 1992.
13. [13] E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In J. Hughes, editor, Proceedings of the 1991 ACM Conference on Functional Programming Languages and Computer Architecture, pages 124–144. Springer Lect. Notes Comp. Sci. (523), 1991.
14. [14] R. Milner. Communication and Concurrency. Series in Computer Science. Prentice-Hall International, 1989.
15. [15] R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (parts I and II). Information and Computation, 100(1):1–77, 1992.
16. J. Rutten. Universal coalgebra: A theory of systems. Theor. Comp. Sci., 249(1):3–80, 2000. (Revised version of CWI Techn. Rep. CS-R9652, 1996).
17. [17] D. Turi and J. Rutten. On the foundations of final coalgebra semantics: non-wellfounded sets, partial orders, metric spaces. Mathematical Structures in Computer Science, 8(5):481–540, 1998.
18. [18] U. Wolter. A coalgebraic introduction to csp. In II Workshop on Coalgebraic Methods in Computer Science. ENTCS, volume 19, Elsevier, 1999.