From static to dynamic abstract data-types

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

Abstract

We show how to extend in a canonical way a given formalism for specifying (static) data types (like usual algebraic specification frameworks) with dynamic features. We obtain in this way a corresponding formalism for specifying dynamic data-types based on the “state-as-algebra” approach: a dynamic data-type models a dynamically evolving system in which any state can be viewed as a static data type in the underlying formalism, and the dynamic evolution is given by operations on states. Formally, our construction is a transformation of (pre)institutions.

Cite

CITATION STYLE

APA

Zucca, E. (1996). From static to dynamic abstract data-types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1113, pp. 579–590). Springer Verlag. https://doi.org/10.1007/3-540-61550-4_180

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