Galois connections and computer science applications
Proceedings of a tutorial and workshop on Category theory and computer programming
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Exercises in Coalgebraic Specification
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Components as coalgebras: the refinement dimension
Theoretical Computer Science - Algebraic methodology and software technology
Transposing partial components: an exercise on coalgebraic refinement
Theoretical Computer Science - Components and objects
On refinement of software architectures
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Generic forward and backward simulations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
| Hi-index | 0.00 |
The technique of Galois connections has been applied successfully in many areas of computer science. By employing coalgebras as models for software components, we claim that different forms of behavior model and types of state transitions for components are instances of a single form of coalgebra in a Kleisli category. Based on the Kleisli category, the results on forward/backward morphisms and refinement of components in Set are still satisfied in this more generic framework. We propose a notion of pre-Galois connection in the context of coalgebras for refinement of state-based software components which takes into consideration not only the refinement ordering but also the dynamics of the components, and we study its properties in the Kleisli category. This notion is a powerful tool for relating a component to its refinement and for relating a component to its abstraction. Thus it provides a basis for reasoning about state-based software designs and reverse engineering.