Algebraic-coalgebraic specification in CoCASL

7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce CoCASL as a simple coalgebraic extension of the algebraic specification language CASL. CoCASL allows the nested combination of algebraic datatypes and coalgebraic process types. We show that the well-known coalgebraic modal logic can be expressed in CoCASL. We present sufficient criteria for the existence of cofree models, also for several variants of nested cofree and free specifications. Moreover, we describe an extension of the existing proof support for CASL (in the shape of an encoding into higher-order logic) to CoCASL. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Mossakowski, T., Reichel, H., Roggenbach, M., & Schröder, L. (2003). Algebraic-coalgebraic specification in CoCASL. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2755, 376–392. https://doi.org/10.1007/978-3-540-40020-2_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free