31 search results - page 5 / 7 » iandc 2010 |
IANDC
2010
14 years 8 months ago
2010
We study the set TA of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on ...
101
click to vote
IANDC
2010
14 years 7 months ago
2010
In a previous paper, we developed an algebraic theory of threads, interleaving of threads, and interaction between threads and services. In the current paper, we extend that theory...
IANDC
2010
14 years 7 months ago
2010
There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious opera...
IANDC
2010
14 years 8 months ago
2010
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
IANDC
2010
14 years 8 months ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...