標題: Titlebook: Algebra and Coalgebra in Computer Science; 4th International Co Andrea Corradini,Bartek Klin,Corina C?rstea Conference proceedings 2011 Spr [打印本頁] 作者: 清楚明確 時間: 2025-3-21 18:43
書目名稱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 時間: 2025-3-21 22:19 作者: Ingredient 時間: 2025-3-22 02:19
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 時間: 2025-3-22 08:11 作者: 畢業(yè)典禮 時間: 2025-3-22 11:57
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作者: 外面 時間: 2025-3-22 16:33 作者: 感情脆弱 時間: 2025-3-22 18:42
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作者: 過分 時間: 2025-3-23 00:54
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作者: 寬容 時間: 2025-3-23 01:52
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 時間: 2025-3-23 06:17
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作者: 模仿 時間: 2025-3-23 13:42
A Counterexample to Tensorability of Effectsoutput, or continuations. One of their advantages is that they allow for a modular treatment of effects, using composition operators such as sum and tensor. Here, the sum represents the non-interacting combination of effects, while the tensor imposes a high degree of interaction in the shape of a co作者: 深陷 時間: 2025-3-23 16:25
The Microcosm Principle and Compositionality of GSOS-Based Component Calculiof behaviors—yielding a behavior, where behaviors are identified with states of the final coalgebra—were observed to form an instance of the .. The microcosm principle, a term by Baez and Dolan, refers to the general phenomenon of nested algebraic structures such as a monoid in a monoidal category. 作者: IOTA 時間: 2025-3-23 20:42 作者: 難聽的聲音 時間: 2025-3-23 22:52 作者: 疲勞 時間: 2025-3-24 06:07 作者: 吊胃口 時間: 2025-3-24 09:36 作者: 表兩個 時間: 2025-3-24 12:42
https://doi.org/10.1007/978-3-322-89179-2Systems of equations over .-continuous semirings can be mapped to context-free grammars in a natural way. We show how an analysis of the derivation trees of the grammar yields new algorithms for approximating and even computing exactly the least solution of the system.作者: 違法事實 時間: 2025-3-24 16:16 作者: 有發(fā)明天才 時間: 2025-3-24 19:21 作者: MAOIS 時間: 2025-3-25 02:26
https://doi.org/10.1007/978-3-662-26470-6We define Boolean algebras over nominal sets with a function symbol И mirroring the И ‘fresh name’ quantifier (Banonas), and dual notions of nominal topology and Stone space. We prove a representation theorem over fields of nominal sets, and extend this to a Stone duality.作者: 不能強迫我 時間: 2025-3-25 04:27 作者: 歌曲 時間: 2025-3-25 09:29
Infinite Computation, Co-induction and Computational LogicWe give an overview of the coinductive logic programming paradigm. We discuss its applications to modeling .-automata, model checking, verification, non-monotonic reasoning, developing SAT solvers, etc. We also discuss future research directions.作者: 商品 時間: 2025-3-25 14:39
Finitary Functors: From , to , and ,We investigate how finitary functors on Set can be extended or lifted to finitary functors on . and . and discuss applications to coalgebra.作者: 我就不公正 時間: 2025-3-25 19:38 作者: 材料等 時間: 2025-3-25 20:06 作者: disparage 時間: 2025-3-26 02:25 作者: GEM 時間: 2025-3-26 08:14
https://doi.org/10.1007/978-3-642-22944-2automata theory; categories; coalgebraic logics; coalgebraic semantics; computational logic; duality; reve作者: 混合 時間: 2025-3-26 09:03
978-3-642-22943-5Springer-Verlag Berlin Heidelberg 2011作者: Dedication 時間: 2025-3-26 13:05 作者: Charade 時間: 2025-3-26 17:21 作者: 遺傳 時間: 2025-3-26 21:09 作者: Aromatic 時間: 2025-3-27 05:10
https://doi.org/10.1007/978-3-663-20338-4with an .-indexed family . : .?→?., where both . and . are inductively defined in such a way that the constructors for . can refer to . and vice versa. In addition, the constructors for . can refer to the constructors for .. We extend the usual initial algebra semantics for ordinary inductive data t作者: 事物的方面 時間: 2025-3-27 09:16 作者: 合適 時間: 2025-3-27 12:03 作者: bifurcate 時間: 2025-3-27 14:47
Dauerversuche mit Nietverbindungen,races 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作者: Paleontology 時間: 2025-3-27 20:48
Dauerversuche mit Nietverbindungening 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作者: 喪失 時間: 2025-3-27 22:49 作者: Engaged 時間: 2025-3-28 03:46 作者: 魔鬼在游行 時間: 2025-3-28 09:30 作者: connoisseur 時間: 2025-3-28 12:09
,‘Handling the Veil’: Charlotte Bront?,of behaviors—yielding a behavior, where behaviors are identified with states of the final coalgebra—were observed to form an instance of the .. The microcosm principle, a term by Baez and Dolan, refers to the general phenomenon of nested algebraic structures such as a monoid in a monoidal category. 作者: narcotic 時間: 2025-3-28 17:12 作者: 捐助 時間: 2025-3-28 21:00
https://doi.org/10.1007/978-1-4302-5374-7 of a supervisory control problem and design a controller called supervisor satisfying a given specification under partial observations. In this paper, plants, specifications, and supervisors are modeled by Mealy automata, automata, and Moore automata, respectively. We define a composition of a supe作者: humectant 時間: 2025-3-28 23:18 作者: minaret 時間: 2025-3-29 04:07
Algebra and Coalgebra in Computer Science978-3-642-22944-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 大吃大喝 時間: 2025-3-29 10:30
https://doi.org/10.1007/978-3-662-26471-3be lifted to a functor on .(.) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares. As an application we present Moss’s coalgebraic over posets.作者: notice 時間: 2025-3-29 13:38 作者: 委屈 時間: 2025-3-29 15:44
0302-9743 nd 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.978-3-642-22943-5978-3-642-22944-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 聾子 時間: 2025-3-29 21:26 作者: Cuisine 時間: 2025-3-30 03:52
Conference proceedings 2011 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.作者: APEX 時間: 2025-3-30 06:49
https://doi.org/10.1007/978-3-662-26470-6a types often arise as initial algebras and final coalgebras of functors on slice categories, so our key technical results give sufficent conditions under which we can construct, from a CCU (QCE) ., a fibration with base . that models indexing by . and is also a CCU (QCE).作者: engrave 時間: 2025-3-30 11:10 作者: 無可非議 時間: 2025-3-30 14:23 作者: ASSAY 時間: 2025-3-30 19:27 作者: 反感 時間: 2025-3-30 22:09
0302-9743 national 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 ma作者: FEAS 時間: 2025-3-31 01:02 作者: 復習 時間: 2025-3-31 08:30 作者: glans-penis 時間: 2025-3-31 10:13
https://doi.org/10.1007/978-3-663-07152-5proved to be the free corecursive monad, where the concept of corecursive monad is a generalization of Elgot’s iterative monads, analogous to corecursive algebras generalizing completely iterative algebras. We also characterize the Eilenberg-Moore algebras for the free corecursive monad and call them Bloom algebras.作者: Flatter 時間: 2025-3-31 16:50
Dauerversuche mit Nietverbindungen, 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 automata-theoretic approach to model checking Linear Temporal Logic over transition systems.作者: COUCH 時間: 2025-3-31 17:41
Dauerversuche mit Nietverbindungentegrated with other tools like model finders and conservativity checkers. This technique has already been applied for showing the consistency of a first-order ontology that is too large to be tackled directly by model finders.作者: Agronomy 時間: 2025-3-31 23:28
On the Statistical Thermodynamics of Reversible Communicating Processesund on energy costs which guarantees that a process converges to a probabilistic equilibrium state (a grand canonical ensemble in statistical physics terms [19]). This implies that such processes hit a success state in finite average time, if there is one.作者: 違抗 時間: 2025-4-1 03:28
Abstract Local Reasoning for Program Modulesinstance, the specification that a program reverses one list does not imply that it leaves a second list alone. To achieve this disjointness property, it is necessary to establish disjointness conditions throughout the proof.作者: Paraplegia 時間: 2025-4-1 07:22
From Corecursive Algebras to Corecursive Monadsproved to be the free corecursive monad, where the concept of corecursive monad is a generalization of Elgot’s iterative monads, analogous to corecursive algebras generalizing completely iterative algebras. We also characterize the Eilenberg-Moore algebras for the free corecursive monad and call them Bloom algebras.作者: wangle 時間: 2025-4-1 12:51 作者: GNAT 時間: 2025-4-1 17:47
Refinement Trees: Calculi, Tools, and Applicationstegrated with other tools like model finders and conservativity checkers. This technique has already been applied for showing the consistency of a first-order ontology that is too large to be tackled directly by model finders.作者: murmur 時間: 2025-4-1 18:43
https://doi.org/10.1007/978-3-663-20338-4ypes to the inductive-inductive setting by considering dialgebras instead of ordinary algebras. This gives a new and compact formalisation of inductive-inductive definitions, which we prove is equivalent to the usual formulation with elimination rules.作者: Throttle 時間: 2025-4-2 00:09
https://doi.org/10.1007/978-3-662-26471-3r second main result concerns a strong completeness result for M., provided that the functor . satisfies some additional constraints. Our proof for this result is based on the construction, for an M.-consistent set of formulas ., of a coalgebraic model in which . is satisfiable.
