標(biāo)題: Titlebook: Coalgebraic Methods in Computer Science; 13th IFIP WG 1.3 Int Ichiro Hasuo Conference proceedings 2016 IFIP International Federation for In [打印本頁(yè)] 作者: Radiofrequency 時(shí)間: 2025-3-21 18:25
書(shū)目名稱(chēng)Coalgebraic Methods in Computer Science影響因子(影響力)
書(shū)目名稱(chēng)Coalgebraic Methods in Computer Science影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Coalgebraic Methods in Computer Science網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Coalgebraic Methods in Computer Science網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Coalgebraic Methods in Computer Science被引頻次
書(shū)目名稱(chēng)Coalgebraic Methods in Computer Science被引頻次學(xué)科排名
書(shū)目名稱(chēng)Coalgebraic Methods in Computer Science年度引用
書(shū)目名稱(chēng)Coalgebraic Methods in Computer Science年度引用學(xué)科排名
書(shū)目名稱(chēng)Coalgebraic Methods in Computer Science讀者反饋
書(shū)目名稱(chēng)Coalgebraic Methods in Computer Science讀者反饋學(xué)科排名
作者: Infiltrate 時(shí)間: 2025-3-21 23:48 作者: 無(wú)節(jié)奏 時(shí)間: 2025-3-22 04:24 作者: absolve 時(shí)間: 2025-3-22 08:02 作者: 紀(jì)念 時(shí)間: 2025-3-22 11:53 作者: TOXIC 時(shí)間: 2025-3-22 13:44 作者: TOXIC 時(shí)間: 2025-3-22 18:38 作者: 怕失去錢(qián) 時(shí)間: 2025-3-22 23:38
0302-9743 p on Coalgebraic Methods in Computer Science,?CMCS 2016, colocated with ETAPS 2016, held in Eindhoven, The Netherlands,?in April 2016..The 10 revised full papers were carefully reviewed and selected from 13?submissions. Also included are an invited paper and two keynote talks. The papers cover a?wid作者: 強(qiáng)化 時(shí)間: 2025-3-23 01:41
Variability in component systemsg PROPs via distributive laws. We show Lawvere categories can be seen as resulting from a distributive law of two PROPs — one expressing the algebraic structure in linear form and the other expressing the ability of copying and discarding variables.作者: 最小 時(shí)間: 2025-3-23 05:46 作者: Aggrandize 時(shí)間: 2025-3-23 12:29 作者: Evacuate 時(shí)間: 2025-3-23 16:49 作者: projectile 時(shí)間: 2025-3-23 18:34
Lawvere Categories as Composed PROPs,g PROPs via distributive laws. We show Lawvere categories can be seen as resulting from a distributive law of two PROPs — one expressing the algebraic structure in linear form and the other expressing the ability of copying and discarding variables.作者: explicit 時(shí)間: 2025-3-23 23:56
Affine Monads and Side-Effect-Freeness,onads predicates are in bijective correspondence with side-effect-free instruments. Also it is shown that these instruments are commutative, in a suitable sense, for monads which are commutative (monoidal).作者: 罐里有戒指 時(shí)間: 2025-3-24 05:25
Duality of Equations and Coequations via Contravariant Adjunctions,roach to (co)algebras for (co)monads, we retrieve the duality between equations and coequations for automata proved by Ballester-Bolinches, Cosme-Llópez and Rutten, and generalize it to dynamical systems.作者: HAUNT 時(shí)間: 2025-3-24 09:20
Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness,order logic programs without existential variables. The resulting extension captures the proofs by term-matching resolution in logic programming. Refining the lax approach, we further extend it to arbitrary logic programs. We also exhibit a refinement of Bonchi and Zanasi’s saturation semantics for logic programming that complements lax semantics.作者: Yag-Capsulotomy 時(shí)間: 2025-3-24 13:54
0302-9743 full papers were carefully reviewed and selected from 13?submissions. Also included are an invited paper and two keynote talks. The papers cover a?wide range of topics in the theory, logics and applications of?coalgebras..978-3-319-40369-4978-3-319-40370-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: HILAR 時(shí)間: 2025-3-24 16:51
Variability in component systems also to non-immediate substructures, like any proper subtree of the current tree. If course-of-value induction is not sufficient yet, we can resort to define a well-founded relation on the considered structure and use the induction hypothesis for any substructure which is strictly smaller with regard to the constructed relation.作者: 燈絲 時(shí)間: 2025-3-24 20:22
Parametric design: an historical perspectivebras, we choose difunctionality as generalization of transitivity. Since in . bisimulations are known to coincide with .simulations, we are led to study the notion of .similarity, where . is a relation lifting.作者: set598 時(shí)間: 2025-3-25 00:33
Fixed Points of Functors - A Short Abstract,of systems (terminal coalgebras and coinduction) and in a number of other connections such as iterative theories (rational fixed point). In this survey we present some older and new results on the structure of the three fixed points we have mentioned.作者: Omnipotent 時(shí)間: 2025-3-25 04:54 作者: 收養(yǎng) 時(shí)間: 2025-3-25 10:23
Lawvere Categories as Composed PROPs,symmetric monoidal, Lawvere categories are cartesian. This paper formulates the connection between the two notions using Lack’s technique for composing PROPs via distributive laws. We show Lawvere categories can be seen as resulting from a distributive law of two PROPs — one expressing the algebraic作者: 缺乏 時(shí)間: 2025-3-25 13:42
Transitivity and Difunctionality of Bisimulations,al category . of .coalgebras these notions may, however, diverge. In many cases, observational equivalence, being transitive, turns out to be more useful..In this paper, we shall investigate the role of transitivity for the largest bisimulation of a coalgebra. Passing to relations between two coalge作者: ornithology 時(shí)間: 2025-3-25 18:51
Affine Monads and Side-Effect-Freeness,otions to properties in the theory of monads. A?new property of a monad (‘strongly affine’) is introduced. It is shown that for such strongly affine monads predicates are in bijective correspondence with side-effect-free instruments. Also it is shown that these instruments are commutative, in a suit作者: 小說(shuō) 時(shí)間: 2025-3-25 23:25 作者: 蠟燭 時(shí)間: 2025-3-26 03:27
Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness,where . is the cofree comonad on ., describes derivations by resolution. Using lax semantics, that correspondence may be extended to a class of first-order logic programs without existential variables. The resulting extension captures the proofs by term-matching resolution in logic programming. Refi作者: ECG769 時(shí)間: 2025-3-26 05:18
Product Rules and Distributive Laws,dy known that these product rules can be represented using distributive laws, e.g. via a suitable quotient of a GSOS law. In this paper, we cast these product rules into a general setting where we have two monads . and ., a (possibly copointed) behavioural functor ., a distributive law of . over ., 作者: 地名詞典 時(shí)間: 2025-3-26 12:32
A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors, preserving weak pullbacks. We select finitary set functors because they are quotients of polynomial functors: the polynomial functor provides a ready-made signature and the quotient provides necessary additional axioms. We also show that certain operations on functors can be expressed with uniform 作者: floodgate 時(shí)間: 2025-3-26 15:54 作者: Acumen 時(shí)間: 2025-3-26 17:37
On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems, notion of a bisimulation relation on states of a labeled transition system which requires the existence of matching transitions starting from states in such a relation, local timed bisimulation requires the existence of sufficiently short (locally defined) matching trajectories. Global timed bisimu作者: 欄桿 時(shí)間: 2025-3-26 23:48
Fixed Points of Functors - A Short Abstract,of systems (terminal coalgebras and coinduction) and in a number of other connections such as iterative theories (rational fixed point). In this survey we present some older and new results on the structure of the three fixed points we have mentioned.作者: headlong 時(shí)間: 2025-3-27 04:50
Conference proceedings 2016e,?CMCS 2016, colocated with ETAPS 2016, held in Eindhoven, The Netherlands,?in April 2016..The 10 revised full papers were carefully reviewed and selected from 13?submissions. Also included are an invited paper and two keynote talks. The papers cover a?wide range of topics in the theory, logics and applications of?coalgebras..作者: 愉快嗎 時(shí)間: 2025-3-27 07:39
Variability in component systemsThe aim of the paper is to work towards a generalisation of coalgebraic logic enriched over a commutative quantale. Previous work has shown how to dualise the coalgebra type functor . in order to obtain the modal operators and axioms describing transitions of type .. Here we give a logical description of the dual of ..作者: misanthrope 時(shí)間: 2025-3-27 12:29 作者: 確定方向 時(shí)間: 2025-3-27 15:59
On the Logic of Generalised Metric Spaces,The aim of the paper is to work towards a generalisation of coalgebraic logic enriched over a commutative quantale. Previous work has shown how to dualise the coalgebra type functor . in order to obtain the modal operators and axioms describing transitions of type .. Here we give a logical description of the dual of ..作者: Mendicant 時(shí)間: 2025-3-27 20:58 作者: SHOCK 時(shí)間: 2025-3-28 00:52 作者: Blatant 時(shí)間: 2025-3-28 02:23 作者: abracadabra 時(shí)間: 2025-3-28 09:29 作者: Oration 時(shí)間: 2025-3-28 14:20 作者: 弄皺 時(shí)間: 2025-3-28 15:28 作者: Aphorism 時(shí)間: 2025-3-28 20:40
Parametric design: an historical perspectiveof systems (terminal coalgebras and coinduction) and in a number of other connections such as iterative theories (rational fixed point). In this survey we present some older and new results on the structure of the three fixed points we have mentioned.作者: ALOFT 時(shí)間: 2025-3-29 02:42
Parametric design: an historical perspectiveof systems (terminal coalgebras and coinduction) and in a number of other connections such as iterative theories (rational fixed point). In this survey we present some older and new results on the structure of the three fixed points we have mentioned.作者: 數(shù)量 時(shí)間: 2025-3-29 04:30 作者: 柏樹(shù) 時(shí)間: 2025-3-29 08:22 作者: Memorial 時(shí)間: 2025-3-29 14:07
Parametric design: an historical perspectiveal category . of .coalgebras these notions may, however, diverge. In many cases, observational equivalence, being transitive, turns out to be more useful..In this paper, we shall investigate the role of transitivity for the largest bisimulation of a coalgebra. Passing to relations between two coalge作者: 不透明 時(shí)間: 2025-3-29 17:35
Variability in component systemsotions to properties in the theory of monads. A?new property of a monad (‘strongly affine’) is introduced. It is shown that for such strongly affine monads predicates are in bijective correspondence with side-effect-free instruments. Also it is shown that these instruments are commutative, in a suit作者: GLOOM 時(shí)間: 2025-3-29 20:55 作者: 秘密會(huì)議 時(shí)間: 2025-3-30 01:02
https://doi.org/10.1007/978-3-211-71539-0where . is the cofree comonad on ., describes derivations by resolution. Using lax semantics, that correspondence may be extended to a class of first-order logic programs without existential variables. The resulting extension captures the proofs by term-matching resolution in logic programming. Refi作者: mendacity 時(shí)間: 2025-3-30 05:14
Material complexity in facade designdy known that these product rules can be represented using distributive laws, e.g. via a suitable quotient of a GSOS law. In this paper, we cast these product rules into a general setting where we have two monads . and ., a (possibly copointed) behavioural functor ., a distributive law of . over ., 作者: 清楚 時(shí)間: 2025-3-30 09:36
https://doi.org/10.1007/978-3-211-71539-0 preserving weak pullbacks. We select finitary set functors because they are quotients of polynomial functors: the polynomial functor provides a ready-made signature and the quotient provides necessary additional axioms. We also show that certain operations on functors can be expressed with uniform
