Algebra and Coalgebra in Computer Science: 4th International Conference, CALCO 2011, Winchester, UK, August 30 - September 2, 2011, Proceedings
Andrea Corradini, Bartek Klin, Corina CÓrstea
Springer Science & Business Media, Aug 19, 2011 - Computers - 420 pages
This book constitutes the refereed proceedings of the 4th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2011, held in Winchester, UK, in August/September 2011. The 21 full papers presented together with 4 invited talks were carefully reviewed and selected from 41 submissions. The papers report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. They cover topics in the fields of abstract models and logics, specialized models and calculi, algebraic and coalgebraic semantics, and system specification and verification. The book also includes 6 papers from the CALCO-tools Workshop, colocated with CALCO 2011 and dedicated to tools based on algebraic and/or coalgebraic principles.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abstract adjoint automata automaton axioms BAnona bisimilarity bisimulation Bloom algebra Boolean CALCO calculus coalgebra coinductive comonad component composition Computer Science construction context context-free languages corecursive corecursive algebras corresponding deﬁned Deﬁnition denote derivation trees ECBV endofunctor equations equivalent example exists extended F-coalgebra fibration final coalgebra finitary finite forgetful functor formal formula free corecursive function functor given grammar GSOS Heidelberg Heidelberg 2011 homomorphism hybrid logic induction initial algebra isomorphism Lawvere theories Lemma LNCS logic programming Maude modal logic model checking modiﬁed normal monad monad transformer monotone morphism n-filter natural transformation node nominal sets notion one-step operational semantics Poset powerset predicate liftings Preord preorder preserves proof proof calculus properties Proposition prove recursive relation result rewrite theory rules satisﬁes semiring signature speciﬁcation Springer structure syntactic tensor Theorem tool variables