IANDC 2010 - PDF Preprint Papers

IANDC 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IANDC-2010 Paper

click to vote

IANDC
2010

160views more IANDC 2010»

Coequational logic for accessible functors

13 years 10 months ago

Download www.iti.cs.tu-bs.de

Covarieties of coalgebras are those classes of coalgebras for an endofunctor H on the category of sets that are closed under coproducts, subcoalgebras and quotients. Equivalently,...

Daniel Schwencke

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	160	Coequational logic for accessible functors	claim
2	151	Complete sets of cooperations	claim
3	141	Regaining cut admissibility in deduction modulo using abstract completion	claim
4	132	The expressive power of the shuffle product	claim
5	128	A coinductive calculus of binary trees	claim
6	125	Continuation semantics for the Lambek-Grishin calculus	claim
7	125	A thread calculus with molecular dynamics	claim
8	121	Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms	claim
9	119	Cut elimination in coalgebraic logics	claim
10	116	Weak bisimulation is sound and complete for pCTL*	claim
11	115	18th International Conference on Concurrency Theory	claim
12	113	Numerical constraints on XML data	claim
13	109	Compositional verification and 3-valued abstractions join forces	claim
14	107	Equational properties of iterative monads	claim
15	105	Symmetries, local names and dynamic (de)-allocation of names	claim
16	102	Presenting functors on many-sorted varieties and applications	claim
17	95	Structured anaphora to quantifier domains	claim
18	91	Functional interpretations of linear and intuitionistic logic	claim
19	87	Effective symbolic dynamics, random points, statistical behavior, complexity and entropy	claim
20	84	Modules over monads and initial semantics	claim
21	84	Underapproximation for model-checking based on universal circuits	claim
22	83	Static analysis of topology-dependent broadcast networks	claim
23	79	Complexity of deciding bisimilarity between normed BPA and normed BPP	claim
24	78	An efficient simulation algorithm based on abstract interpretation	claim
25	68	On the complexity of checking semantic equivalences between pushdown processes and finite-state processes	claim
26	67	Parameterized computational complexity of Dodgson and Young elections	claim
27	66	Mind change optimal learning of Bayes net structure from dependency and independency data	claim
28	62	Logic, language, information and computation	claim
29	58	Efficient algorithms for the block edit problems	claim
30	57	Non-interleaving bisimulation equivalences on Basic Parallel Processes	claim
31	45	Models of active learning in group-structured state spaces	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers