Titlebook: Algebra and Coalgebra in Computer Science; 4th International Co Andrea Corradini,Bartek Klin,Corina C?rstea Conference proceedings 2011 Spr

清楚明確

書目名稱Algebra and Coalgebra in Computer Science影響因子(影響力)




書目名稱Algebra and Coalgebra in Computer Science影響因子(影響力)學科排名




書目名稱Algebra and Coalgebra in Computer Science網(wǎng)絡公開度




書目名稱Algebra and Coalgebra in Computer Science網(wǎng)絡公開度學科排名




書目名稱Algebra and Coalgebra in Computer Science被引頻次




書目名稱Algebra and Coalgebra in Computer Science被引頻次學科排名




書目名稱Algebra and Coalgebra in Computer Science年度引用




書目名稱Algebra and Coalgebra in Computer Science年度引用學科排名




書目名稱Algebra and Coalgebra in Computer Science讀者反饋




書目名稱Algebra and Coalgebra in Computer Science讀者反饋學科排名

KEGEL

Ingredient

From Corecursive Algebras to Corecursive Monadsebras are obtained as a coproduct of the final coalgebra (considered as an algebra) and with free algebras. The monad of free corecursive algebras is proved to be the free corecursive monad, where the concept of corecursive monad is a generalization of Elgot’s iterative monads, analogous to corecurs

Surgeon

畢業(yè)典禮

Model Constructions for Moss’ Coalgebraic Logic given by Kupke, Kurz and Venema. Based on the one-step completeness of this system, we first construct a finite coalgebraic model for an arbitrary M.-consistent formula. This construction yields a simplified completeness proof for the logic M. with respect to the intended, coalgebraic semantics. Ou

外面

感情脆弱

Model Checking Linear Coalgebraic Temporal Logics: An Automata-Theoretic Approachraces for finite such coalgebras. We then consider . coalgebraic temporal logics interpreted over non-deterministic coalgebras, and show how to reduce the model checking problem for such logics to the problem of deciding the winner in a regular two-player game. Our approach is inspired by the automa

過分

Refinement Trees: Calculi, Tools, and Applicationsing correctness of refinements as well as their consistency. Both calculi have been implemented in the Heterogeneous Tool Set (Hets), and have been integrated with other tools like model finders and conservativity checkers. This technique has already been applied for showing the consistency of a fir

寬容

On the Fusion of Coalgebraic Logicsecidability are known to transfer from the component logics to their fusion. In this paper we investigate to what extent these results can be generalised to the case of arbitrary coalgebraic logics. Our main result generalises a construction of Kracht and Wolter and confirms that completeness transf

JAMB

Indexed Induction and Coinduction, Fibrationally key directions. First, we present a sound coinduction rule for any data type arising as the final coalgebra of a functor, thus relaxing Hermida and Jacobs’ restriction to polynomial data types. For this we introduce the notion of a . (QCE), which both abstracts the standard notion of a fibration of