Algebra and Coalgebra in Computer Science 计算机科学中的代数与共代数/会议录

出版时间：2005-9  出版社：北京燕山出版社  作者：Fiadeiro, Jose Luiz; Harman, Neil; Roggenbach, Markus  页数：455  

内容概要

The LNCS series reports state-of-the-art results in computer science research，development，and education，at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community，with numerous individuals，as well as with prestigious organizations and societies，LNCS has grown into the most comprehensive computer science research forum available.    The scope of LNCS，including its subseries LNAI，spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material published traditionally includes.    —proceedings （published in time for the respective conference）    —post-proceedings （consisting of thoroughly revised final full papers）    —research monographs（which may be based on outstanding PhD work，research projects，technical reports，etc.）.

书籍目录

Invited Talks　Abstract Scalars, Loops, and Free Traced and Strongly Compact　Closed Categories　Labels from Reductions: Towards a General Theory　Adequacy for Algebraic Effects with StateContributed Papers　Bisimilarity Is Not Finitely Based over BPA with Interrupt　Algebra N Coalgebra = Presheaves　Strong Splitting Bisimulation Equivalence　Complete Axioms for Stateless Connectors　On the Semantics of Coinductive Types in Martin-L6f Type Theory　Look: Simple Stochastic Relations Are Just, Well, Simple　Modelling Fusion Calculus Using HD-Automata　An Algebraic Framework for Verifying the Correctness of Hardware with Input and Output: A Formalization in HOL　Using Proofs by Coinduction to Find "Traditional" Proofs　From T-Coalgebras to Filter Structures and Transition Systems　Context-Free Languages via Coalgebraic Trace Semantics　Towards a Coalgebraic Semantics of the Ambient Calculus　The Least Fibred Lifting and the Expressivity of Coalgebraic　Modal Logic　Ultrafilter Extensions for Coalgebras　Equational Logic of Recursive Program Schemes　The Category Theoretic Solution of Recursive Program Schemes　A Categorical Approach to Simulations　Behavioral Extensions of InstitutionsDiscrete Lawvere Theories　Final Semantics for Event-Pattern Reactive Programs　Complete Symbolic Reachability Analysis Using Back-and-Forth　Narrowing　Final Sequences and Final Coalgebras for Measurable Spaces　Bireachability and Final Multialgebras　Parametrized Exceptions　Property Preserving Redesign of SpecificationsAuthor Index