Adding recursive constructs to bialgebraic semantics

Journal of Logic and Algebraic Programming

Volumn 60-61, Issue SUPPL., 2004, Pages 259-286

  Klin, Bartek ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; ERROR CORRECTION; PROBLEM SOLVING;

ALGEBRA HOMOMORPHISM; BIALGEBRAIC SEMANTICS; MONARDS; SYNTACTIC FORMATS;

SEMANTICS;

EID: 2942580820     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2004.03.005     Document Type: Article

References (20)

1. Abramsky S. A domain equation for bisimulation. Inform. and Comput. 92:1991;161-218.
2. Aceto L., Fokkink W.J., Verhoef C. Structural operational semantics. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;197-292 Elsevier, Amsterdam.
3. P. Aczel, J. Adámek, J. Velebil, A coalgebraic view of infinite trees and iteration, in: Proc. CMCS'01, ENTCS 44.1, 2001.
4. Bergstra J.A., Fokkink W.J., Ponse A. Process algebra with recursive operations. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;333-385 Elsevier, Amsterdam.
5. Bloom B., Istrail S., Meyer A.R. Bisimulation can't be traced. J. ACM. 42:1995;232-268.
6. Klin B., Sobociński P. Congruence formats for free: an abstract approach to process equivalence. in: Proc. 14th CONCUR Conf. LNCS 2761. 2003;Springer-Verlag.
7. Fiore M., Plotkin G., Turi D. Abstract syntax and variable binding. in: Proc. 14th LICS Conf. 1999;193-202 IEEE Computer Society Press.
8. Fiore M., Turi D. Semantics of name and value passing. in: Proc. 16th LICS Conf. 2001;93-104 IEEE Computer Society Press.
9. Goguen J.A., Thatcher J.W., Wagner E.G., Wright J.B. Initial algebra semantics and continuous algebras. J. Assoc. Comput. Mach. 24:1977;68-95.
10. M. Lenisa, J. Power, H. Watanabe, Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads, in: ENTCS 33, 2000.
11. Mac Lane S. Categories for the Working Mathematician. 1971;Springer-Verlag.
12. S.B. Lassen, P.D. Mosses, D.A. Watt, An introduction to AN-2, the proposed new version of action notation, in: Proc. 3rd Intl. Workshop on Action Semantics, BRICS Note NS-00-6, Aarhus University, 2000, pp. 19-36.
13. G. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Department of Computer Science, Aarhus University, 1981.
14. J. Rothe, D. Mašulović, Towards weak bisimulation for coalgebras, in: ENTCS 68.1, Elsevier Science, 2002.
15. J. Rutten, A note on coinduction and weak bisimilarity for while programs, Report SEN-R9826, CWI, Amsterdam, 1998.
16. Rutten J., Turi D. Initial algebra and final coalgebra semantics for concurrency. in: Proc. of the REX workshop A Decade of Concurrency - Reflections and Perspectives. LNCS 803. 1994;530-582 Springer-Verlag.
17. D. Turi, Functorial operational semantics and its denotational dual, Ph.D. Thesis, Vrije Universiteit, Amsterdam, 1996.
18. Turi D. Categorical modelling of structural operational rules: case studies. in: Proc. 7th CTCS Conf. LNCS 1290. 1997;127-146 Springer-Verlag.
19. Turi D., Plotkin G. Towards a mathematical operational semantics. in: Proc. 12th LICS Conf. 1997;280-291 IEEE Computer Society Press.
20. H. Watanabe, Well-behaved translations between structural operational semantics, in: ENTCS 65.1, Elsevier Science, 2002.