Algebraic-coalgebraic specification in CoCASL

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

Volumn 2755, Issue , 2003, Pages 376-392

  Mossakowski, Till ^a   Reichel, Horst ^b   Roggenbach, Markus ^a   Schröder, Lutz ^a  

^a UNIVERSITY OF BREMEN   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; RECONFIGURABLE HARDWARE; SPECIFICATION LANGUAGES; SPECIFICATIONS;

ALGEBRAIC DATA-TYPES; ALGEBRAIC SPECIFICATION LANGUAGES; CO-FREE; COALGEBRAIC; COALGEBRAIC SPECIFICATIONS; HIGHER ORDER LOGIC; MODAL LOGIC;

ALGEBRA;

EID: 0347587025     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40020-2_22     Document Type: Article

References (29)

1. J. Adámek, H. Herrlich, and G. E. Strecker, Abstract and concrete categories, Wiley Interscience, 1990.
2. M. Arbib and E. Manes, Parametrized data types do not need highly constrained parameters, Inform. Control 52 (1982), 139-158.
3. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114 (1993), 299-315.
4. M. Bidoit and R. Hennicker, On the integration of observability and reachability concepts, Fossacs, LNCS, vol. 2303, Springer, 2002, pp. 21-36.
5. Michel Bidoit, Rolf Hennicker, and Alexander Kurz, Observational logic, constructor-based logic, and their duality, Theoret. Comput. Sci. 298 (2003), 471-510.
6. P. Burmeister, Partial algebras - survey of a unifying approach towards a two-valued model theory for partial algebras, Algebra Universalis 15 (1982), 306-358.
7. C. Cîrstea, On specification logics for algebra-coalgebra structures: Reconciling reachability and observability, LNCS 2303 (2002), 82-97.
8. R. Cockett and T. Fukushima, About Charity, Yellow Series Report 92/480/18, Univ. of Calgary, Dept. of Comp. Sci., 1992.
9. S. P. Jones et al., Haskell 98: A non-strict, purely functional language, (1999), http://www.haskell.org/onlinereport.
10. J. Goguen, K. Lin, and G. Rosu, Conditional circular coinductive reuniting, Automated Software Engineering, IEEE Press, 2000, pp. 123-131.
11. J. A. Goguen, Hidden algebraic engineering, Algebraic Engineering (Chrystopher Nehaniv and Masami Ito, eds.), World Scientific, 1999, pp. 17-36.
12. H. P. Gumm and T. Schröder, Coalgebras of bounded type, Math. Struct. Comput. Sci. 12 (2002), 565-578.
13. D. Kozen, Results on the prepositional mu -calculus, Theoret. Comput. Sci. 27 (1983), 333-354.
14. A. Kurz, Specifying coalgebras with modal logic, Theoret. Comput. Sci. 260 (2001), 119-138.
15. _, Logics admitting final semantics, Foundations of Software Science and Computation Structures, LNCS, vol. 2303, Springer, 2002, pp. 238-249.
16. T. Mossakowski, CASL: From semantics to tools, TACAS, LNCS, vol. 1785, Springer, 2000, pp. 93-108.
17. _, Relating CASL with other specification languages: the institution level, Theoret. Comput. Sci. 286 (2002), 367-475.
18. T. Mossakowski, M. Roggenbach, and L. Schröder, CoCASL at work - modelling process algebra, CMCS 03, ENTCS, vol. 82(1), 2003.
19. ∼lschrode/papers/cocasl.ev.ps.
20. P. D. Mosses (ed.), CASL - the common algebraic specification language. Reference manual, Springer, to appear.
21. D. Pattinson, Expressive logics for coalgebras via terminal sequence induction, Tech. report, LMU München, 2002.
22. H. Reichel, An approach to object semantics based on terminal co-algebras, Math. Struct. Comput. Sci. 5 (1995), 129-152.
23. _, A uniform model theory for the specification of data and process types, WADT, LNCS, vol. 1827, Springer, 2000, pp. 348-365.
24. G. Roşu, Hidden logic, Ph-D. thesis, Univ. of California at San Diego, 2000.
25. J. Rothe, H. Tews, and B. Jacobs, The Coalgebraic Class Specification Language CCSL, J. Universal Comput. Sci. 7 (2001), 175-193.
26. J. Rutten, Universal coalgebra: A theory of systems, Theoret. Comput. Sci. 249 (2000), 3-80.
27. A. Tarlecki, On the existence of free models in abstract algebraic institutions, Theoret. Comput. Sci. 37 (1985), 269-304.
28. H. Tews, Coalgebraic methods for object-oriented languages, Ph.D. thesis, Dresden Univ. of Technology, 2002.
29. J. van den Berg and B. Jacobs, The LOOP compiler for Java and JML, LNCS 2031 (2001), 299-312.