Algebra and Coalgebra in Computer Science: Third by Gordon Plotkin (auth.), Alexander Kurz, Marina Lenisa,

By Gordon Plotkin (auth.), Alexander Kurz, Marina Lenisa, Andrzej Tarlecki (eds.)

This ebook constitutes the court cases of the 3rd foreign convention on Algebra and Coalgebra in laptop technology, CALCO 2009, shaped in 2005 by way of becoming a member of CMCS and WADT. This yr the convention used to be held in Udine, Italy, September 7-10, 2009.

The 23 complete papers have been conscientiously reviewed and chosen from forty two submissions. they're provided including 4 invited talks and workshop papers from the CALCO-tools Workshop. The convention used to be divided into the subsequent periods: algebraic results and recursive equations, idea of coalgebra, coinduction, bisimulation, stone duality, online game thought, graph transformation, and software program improvement techniques.

Show description

Read Online or Download Algebra and Coalgebra in Computer Science: Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings PDF

Best algebra books

Extra info for Algebra and Coalgebra in Computer Science: Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings

Sample text

Their uncut versions look as follows. Γ ✄ fst(p), n : A × 1n Γ ✄ n , snd(p) : 1n × A Γ ✄ p : A × 1n Γ ✄ p : 1n × A Consider the extra rewrite rules, capturing nondeterminism. p+∅ ∅+p p p do x ← p; (q + r) do x ← (p + q); r do x ← p; ∅ do x ← ∅; p ∅ ∅ do x ← p; q + do x ← p; r do x ← p; r + do x ← q; r (∗∗) Let λ stand for the reduction relation defined by rules in (∗), and ω for the reduction relation corresponding to the rules in (∗∗). With a slight abuse of notation use to refer to the combined relation λ ∪ ω .

3924, pp. 7–21. : Deriving backtracking monad transformers. : Combining effects: Sum and tensor. Theoret. Comput. Sci. : Coalgebras and Monads in the Semantics of Java. Theoret. Comput. Sci. : Termination of a set of rules modulo a set of equations. E. ) CADE 1984. LNCS, vol. 170, pp. 175–193. : Backtracking, interleaving, and terminating monad transformers. In: Functional Programming, ICFP 2005, pp. 192–203. : A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput.

For n > 1 and is just for n = 1. As usual, we have omitted contexts, which are easily reconstructed except possibly in the second and third rules on the left. Their uncut versions look as follows. Γ ✄ fst(p), n : A × 1n Γ ✄ n , snd(p) : 1n × A Γ ✄ p : A × 1n Γ ✄ p : 1n × A Consider the extra rewrite rules, capturing nondeterminism. p+∅ ∅+p p p do x ← p; (q + r) do x ← (p + q); r do x ← p; ∅ do x ← ∅; p ∅ ∅ do x ← p; q + do x ← p; r do x ← p; r + do x ← q; r (∗∗) Let λ stand for the reduction relation defined by rules in (∗), and ω for the reduction relation corresponding to the rules in (∗∗).

Download PDF sample

Rated 4.85 of 5 – based on 27 votes