Systematic software development using VDM
Systematic software development using VDM
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Algebra of programming
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Category Theory and Computer Science
Galois connections and fixed point calculus
Algebraic and coalgebraic methods in the mathematics of program construction
Safety of abstract interpretations for free, via logical relations and Galois connections
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Coalgebraic foundations of linear systems
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Pointfree factorization of operation refinement
FM'06 Proceedings of the 14th international conference on Formal Methods
Exercises in quantifier manipulation
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Transforming Data by Calculation
Generative and Transformational Techniques in Software Engineering II
Software components as invariant-typed arrows
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
A Coalgebraic Perspective on Logical Interpretations
Studia Logica
| Hi-index | 0.00 |
Invariants, bisimulations and assertions are the main ingredients of coalgebra theory applied to software systems. In this paper we reduce the first to a particular case of the second and show how both together pave the way to a theory of coalgebras which regards invariant predicates as types. An outcome of such a theory is a calculus of invariants' proof obligation discharge, a fragment of which is presented in the paper.The approach has two main ingredients: one is that of adopting relations as "first class citizens" in a pointfree reasoning style; the other lies on a synergy found between a relational construct, Reynolds' relation on functionsinvolved in the abstraction theoremon parametric polymorphism and the coalgebraic account of bisimulations and invariants. This leads to an elegant proof of the equivalence between two different definitions of bisimulation found in coalgebra literature (due to B. Jacobs and Aczel & Mendler, respectively) and to their instantiation to the classical Park-Milner definition popular in process algebra.