Streams and Coalgebra Lecture 1
|
|
- Cecil Barker
- 6 years ago
- Views:
Transcription
1 Streams and Coalgebra Lecture 1 Helle Hvid Hansen and Jan Rutten Radboud University Nijmegen & CWI Amsterdam Representing Streams II, Lorentz Center, Leiden, January 2014
2 Tutorial Overview Lecture 1 (Hansen): Coalgebra as a Unifying Theory of Systems Introduction and motivation Examples of systems. Universal coalgebra: basic concepts Lecture 2 (Hansen): The Coinduction Principle Coinductive proofs: Bisimulations Coinductive definitions: Behavioural differential equations Definition format: Syntactic method. Exercises (Hansen/Rutten). Lecture 3 (Rutten): Newton Series and Shuffle Product.
3 Coalgebra: Historical background Non-wellfounded set theory (Aczel 88, Barwise-Moss 96). Solving systems of equations, self-referentiality. E.g. x = {a, y} y = {x} Program semantics: solving recursive domain equations X = F (X ) (ordered spaces, metric spaces) Transition systems as coalgebras (Rutten 95), precursor of J. Rutten. Universal Coalgebra, a theory of systems, Growing community. Established subdiscipline of theoretical computer science: automata theory, program semantics, modal logic,... Coalgebraic Methods in Computer Science (CMCS). Conf. on Algebra and Coalgebra in Comp. Science (CALCO) also: LICS, FoSSaCS, ICALP, MFPS, POPL,...
4 Coalgebra General theory of state-based systems (black-box view). Abstract notion of observable behaviour. Developed parametric in system type. General definitions of morphism, behavioural equivalence, bisimulation,... (parametric in system type). Includes many familiar systems (streams, trees, automata, relations,...)
5 Algebra vs Coalgebra Coalgebra is dual to algebra, see e.g. B. Jacobs and J.J.M.M. Rutten. An introduction to (co)algebras and (co)induction, 2011 (1997).
6 Algebra vs Coalgebra Coalgebra is dual to algebra, see e.g. B. Jacobs and J.J.M.M. Rutten. An introduction to (co)algebras and (co)induction, 2011 (1997). algebra coalgebra well-founded structures non-well-founded structures construction observation syntax behaviour
7 Algebra vs Coalgebra Coalgebra is dual to algebra, see e.g. B. Jacobs and J.J.M.M. Rutten. An introduction to (co)algebras and (co)induction, 2011 (1997). algebra coalgebra well-founded structures non-well-founded structures construction observation syntax behaviour congruence bisimulation initiality finality induction coinduction
8 Algebra vs Coalgebra Coalgebra is dual to algebra, see e.g. B. Jacobs and J.J.M.M. Rutten. An introduction to (co)algebras and (co)induction, 2011 (1997). algebra coalgebra well-founded structures non-well-founded structures construction observation syntax behaviour congruence bisimulation initiality finality induction coinduction Algebra and coalgebra both fundamental to theoretical computer science, especially their interaction.
9 Motivation What can coalgebra do for you? Unifying theory: reveal common mathematical structure. New perspective on existing results. New results/generalisations via transfer using general perspective. Theorems and proofs for many system types in one go. Mathematical tool box: morphism, bisimulation, equivalence, modal logics,...
10 Some Examples Deterministic Systems with Output (DSO) Deterministic Automata with Output (DAO) (On the board) Remarks: State space can be infinite No initial state
11 Systems as Coalgebras DSO with output in B: DAO with output in B on alphabet A: Deterministic automaton on alphabet A: X B X X B X A X 2 X A
12 Systems as Coalgebras DSO with output in B: X B X DAO with output in B on alphabet A: X B X A Deterministic automaton on alphabet A: X 2 X A Kripke frame (relation): X P(X )
13 Systems as Coalgebras DSO with output in B: X B X DAO with output in B on alphabet A: X B X A Deterministic automaton on alphabet A: X 2 X A Kripke frame (relation): X P(X ) A-labelled transition system: X P(X ) A Nondeterministic automaton on alphabet A: X 2 P(X ) A
14 Systems as Coalgebras DSO with output in B: X B X DAO with output in B on alphabet A: X B X A Deterministic automaton on alphabet A: X 2 X A Kripke frame (relation): X P(X ) A-labelled transition system: X P(X ) A Nondeterministic automaton on alphabet A: X 2 P(X ) A Markov chains: X D(X )...
15 Systems as Coalgebras DSO with output in B: X B X DAO with output in B on alphabet A: X B X A Deterministic automaton on alphabet A: X 2 X A Kripke frame (relation): X P(X ) A-labelled transition system: X P(X ) A Nondeterministic automaton on alphabet A: X 2 P(X ) A Markov chains: X D(X )... F -coalgebra: X F (X ) F defines the system type Formally, F is a functor on a category...
16 Categories A category C consists of: a collection Ob(C) of objects, and a collection Ar(C) of arrows between objects: write: f : X Y or X f Y for f is an arrow from X to Y where X, Y Ob(C). Hom(X, Y ) is the collection of all arrows from X to Y. a composition of arrows Hom(X, Y ) Hom(Y, Z) Hom(X, Z), written g f for f : X Y, g : Y Z, such that (assoc) for all f : X Y, g : Y Z, h : Z U: h (g f ) = (h g) f (id) for all X Ob(C) there is an identity arrow id X : X X such that for all f : X Y : f id X = id Y f.
17 Categories A category C consists of: a collection Ob(C) of objects, and a collection Ar(C) of arrows between objects: write: f : X Y or X f Y for f is an arrow from X to Y where X, Y Ob(C). Hom(X, Y ) is the collection of all arrows from X to Y. a composition of arrows Hom(X, Y ) Hom(Y, Z) Hom(X, Z), written g f for f : X Y, g : Y Z, such that (assoc) for all f : X Y, g : Y Z, h : Z U: h (g f ) = (h g) f (id) for all X Ob(C) there is an identity arrow id X : X X such that for all f : X Y : f id X = id Y f.
18 Categories Examples: Set = sets and functions
19 Categories Examples: Set = sets and functions Mon = monoids and monoid morphisms Ring = rings and ring homomorphisms Top = topological spaces and continuous maps.
20 Categories Examples: Set = sets and functions Mon = monoids and monoid morphisms Ring = rings and ring homomorphisms Top = topological spaces and continuous maps. Rel = sets and relations, i.e., f : X Y means f X Y. (P, ) partially ordered set P: objects are elements x, y,... P, arrows: x y iff x y (arrows are unique).... Exercise: Show that these are indeed categories.
21 Functors between Categories A functor F from a category C to a category D (F : C D) associates objects and arrows from C with objects and arrows from D: (objects) X Ob(C) F (X ) Ob(D), (arrows) f : X Y Ar(C) F (f ): F (X ) F (Y ) Ar(D) s.t.: (id) F (id X ) = id F (X ) for all X Ob(C) and (comp) F (g f ) = F (g) F (f ) for all f : X Y, g : Y Z Ar(D). An (endo)functor on C (or C-functor) is a functor F : C C.
22 Functors between Categories Examples: Identity functor on C: X X, f f. Constant functor on C for some A Ob(C): X A, f id A.
23 Functors between Categories Examples: Identity functor on C: X X, f f. Constant functor on C for some A Ob(C): X A, f id A. Powerset functor on Set: X P(X ), f f [ ] (direct image).
24 Functors between Categories Examples: Identity functor on C: X X, f f. Constant functor on C for some A Ob(C): X A, f id A. Powerset functor on Set: X P(X ), f f [ ] (direct image). Forgetful functor from Mon to Set: (X,, 1) X, f f (underlying function). Free functor from Set to Mon: X X, f : X Y unique morphism f : X Y extending f. Monotonic maps on a partially ordered set (P, ). Exercise: Show that these are indeed functors.
25 Let F : C C be a functor on C. Category of F -coalgebras
26 Let F : C C be a functor on C. Category of F -coalgebras An F -coalgebra is an arrow γ : X F (X ) in Ar(C), also written as (X, γ). An F -coalgebra morphism f : (X, γ) (Y, δ) is an arrow f : X Y in Ar(C) such that F (f ) γ = δ f, i.e., the following diagram commutes: X f Y γ F (X ) F (f ) F (Y ) Coalg(F ) denotes the category of F -coalgebras and F -coalgebra morphisms. Exercise: Verify that Coalg(F ) is indeed a category. δ
27 Basic Constructions Assume F : Set Set. (All notions generalise). (X, γ) is a subcoalgebra of (Y, δ) if X Y and inclusion map X Y is coalgebra morphism, i.e., (X, γ) (Y, δ). (Y, δ) is a quotient of (X, γ) if there is f : (X, γ) (Y, δ). the coproduct of (X, γ) and (Y, γ) is (X + Y, φ) where γ X κ 1 X + Y φ κ 2 F (X ) F κ 1 F (X + Y ) F (Y ) where φ = [F κ 1 γ, F κ 2 δ]. F κ 2 Y δ
28 Coalgebraic Modelling of DSOs Deterministic systems with output in B are F -coalgebras for Set-functor F (X ) = B X. o, d : X B X Coalgebra morphisms: o γ,d γ X f Y B X id B f B Y o δ,d δ x X : o δ (f (x)) = o γ (x) d δ (f (x)) = f (d γ (x))
29 Coalgebraic Modelling of DSOs Deterministic systems with output in B are F -coalgebras for Set-functor F (X ) = B X. o, d : X B X Coalgebra morphisms: o γ,d γ X f Y B X id B f B Y o δ,d δ x X : o δ (f (x)) = o γ (x) d δ (f (x)) = f (d γ (x)) morphisms preserve output and transitions. subsystems are transition closed subsets. quotients identify states that are equivalent. coproducts are disjoint unions. observable behaviours are streams B ω.
30 Coalgebraic Modelling of DAOs DAOs (with output in B, alphabet A) are F -coalgebras for Set-functor F (X ) = B X A. Morphisms: X o γ,d γ f Y o δ,d δ B X A id B f A B Y A where f A : X A Y A h f h x X a A : o δ (f (x)) = o γ (x) d δ (f (x))(a) = f (d γ (x)(a)) (G(X ) = X A is a functor)
31 Coalgebraic Modelling of DAOs DAOs (with output in B, alphabet A) are F -coalgebras for Set-functor F (X ) = B X A. Morphisms: X o γ,d γ f Y o δ,d δ B X A id B f A B Y A x X a A : o δ (f (x)) = o γ (x) d δ (f (x))(a) = f (d γ (x)(a)) where f A : X A Y A (G(X ) = X A is a functor) h f h morphisms preserve output and transitions. subsystems are transition closed subsets. quotients identify states that are equivalent. coproducts are disjoint unions. observable behaviours are B-valued languages B A.
32 Final F -Coalgebra An F -coalgebra (Z, ζ) is final if for all F -coalgebras (X, γ) there is a unique F -coalgebra morphism h : (X, γ) (Z, ζ): X!h Z γ F (X ) F (h) F (Z) The unique morphism h : (X, γ) (Z, ζ) is called the behaviour map. We often write [[ ]] = h. Z is the collection of all behaviours of F -coalgebras. ζ
33 Final F -Coalgebra Facts Final F -coalgebra is unique up to isomorphism (in Coalg(F )). (We speak about the final F -coalgebra.) If (Z, ζ) is final, then ζ : Z = F (Z) is an isomorphism in C (Lambek s Lemma). Final F -coalgebras do not always exist. E.g. X = P(X ) for all sets X. But P ω (X ) = {U X card(u) finite} does have final coalgebra.
34 The Final DSO of Streams Streams B ω = {σ : N B} are a DSO with output in B: B ω B B ω σ σ(0), σ where σ(0) is initial value, head of σ, σ = (σ(1), σ(2), σ(3),...) is stream derivative, tail of σ.
35 The Final DSO of Streams Streams B ω = {σ : N B} are a DSO with output in B: B ω B B ω σ σ(0), σ where σ(0) is initial value, head of σ, σ = (σ(1), σ(2), σ(3),...) is stream derivative, tail of σ. o,d X B X [[ ]] id B [[ ]] B ω B B ω ( )(0),( ) x X : [[x]](0) = o(x) [[x]] = [[d(x)]] where behaviour map is x X : [[x]](n) = o(d n (x)) n N.
36 The Final DAO of Languages The set L = B A = {L: A B} of all B-valued languages over A is a DAO (with output in B, alphabet A) : λ : L B L A L L(ε), a L a where L a (w) = L(aw) for all w A (left language derivative).
37 The Final DAO of Languages The set L = B A = {L: A B} of all B-valued languages over A is a DAO (with output in B, alphabet A) : λ : L B L A L L(ε), a L a where L a (w) = L(aw) for all w A (left language derivative). X o,d B X A [[ ]] L λ id B [[ ]] A B L A x X, a A : [[x]](ε) = o(x) [[x]] a = [[d(x)(a)]] where behaviour map is: x X : [[x]](w) = o(d(x)(w)) w A.
38 The DAO of Streams The set B ω of streams is a DAO (with output in B, alphabet A).
39 The DAO of Streams The set B ω of streams is a DAO (with output in B, alphabet A). Case A = {1, 2, 3}. For all σ B ω and j {0, 1, 2}, let: unzip j,3 (σ)(n) = σ(j + 3n). Note that unzip 3 := unzip 0,3, unzip 1,3, unzip 2,3 : B ω = (B ω ) {1,2,3} with inverse zip 3 : (B ω ) {1,2,3} B ω.
40 The DAO of Streams The set B ω of streams is a DAO (with output in B, alphabet A). Case A = {1, 2, 3}. For all σ B ω and j {0, 1, 2}, let: unzip j,3 (σ)(n) = σ(j + 3n). Note that unzip 3 := unzip 0,3, unzip 1,3, unzip 2,3 : B ω = (B ω ) {1,2,3} with inverse zip 3 : (B ω ) {1,2,3} B ω. Take as DAO structure on B ω, β = B ω ( )(0),( ) B B ω id B unzip 3 = B (B ω ) {1,2,3} = Concretely, β : B ω B (B ω ) {1,2,3} σ σ(0), j unzip j 1,3 (σ )
41 The DAO of Streams By finality of (L, λ), there is unique h : (B ω, β) (L, λ).
42 The DAO of Streams By finality of (L, λ), there is unique h : (B ω, β) (L, λ). Concretely, h(σ)(w) = σ(ν(w)) w {1, 2, 3} where ν : {1, 2, 3} = N is bijective 3-adic numeration (least significant digit first, reverse). defined by: ν(ε) = 0, ν(aw) = a + 3 ν(w) ν(n) n ε ν(ε) = ν(ε) = ν(ε) = ν(1) = ν(1) = ν(1) = ν(2) = 7..
43 The Final DAO of Streams ν bijective h : B ω L bijective h is DAO-isomorphism (B ω, β) is also final. X [[ ]] B ω o,d B X A id B [[ ]] {1,2,3} B (B ω ) {1,2,3} ( )(0),unzip 3 (( ) )
44 The Final DAO of Streams ν bijective h : B ω L bijective h is DAO-isomorphism (B ω, β) is also final. X [[ ]] B ω o,d For general k, B X A id B [[ ]] {1,2,3} B (B ω ) {1,2,3} ( )(0),unzip 3 (( ) ) Subcoalgebra σ generated by σ in (B ω, β) has as its states D(σ) = {σ(j + k e n) n N e 1 i=0 ki j e i=1 ki, e 1} {σ}. D(σ) finite iff k-kernel(σ) finite. σ is k-automatic iff σ is finite iff h(σ) is a regular language. σ is a minimal DAO that generates σ.
45 Summary Summary of today s lecture: Coalgebra is a uniform framework of state-based systems. Final coalgebras characterise observable behaviour. Streams and languages are final coalgebras. Coalgebraic perspective on automatic sequences via final DAO of streams. Next lecture: Coinduction proof principle (when are two states equivalent?) definition principle: behavioural differential equations
46 Coinduction Streams and Coalgebra Lecture 2 Helle Hvid Hansen and Jan Rutten Radboud University Nijmegen & CWI Amsterdam Representing Streams II, Lorentz Center, Leiden, January 2014
47 Coinduction Tutorial Overview Lecture 1 (Hansen): Coalgebra as a Unifying Framework Introduction and motivation Examples: Streams and languages Universal coalgebra: basic concepts Lecture 2 (Hansen): The Coinduction Principle Coinductive definitions: Behavioural differential equations Definition format: Syntactic method. Coinductive proofs: Bisimulations Exercises (Hansen/Rutten) Lecture 3 (Rutten): Newton Series and Shuffle Product
48 Coinduction Specifying Streams Methods: pointwise: σ(n) =..., n N fixed point of substitution φ: A A (morphic sequence) generated by deterministic automaton with output (DAO). Today: Coinduction (behavioural differential equations). Idea: Use universal property of final (Z, ζ) to define maps into Z. A final coalgebra yields a coinduction principle. Coinduction wrt final DSO (B ω, ( )(0), ( ) ). Coinduction wrt final DAO (B ω, ( )(0), unzip k ).
49 Coinduction Example: Binary operation on Streams Define a binary operation on streams B ω B ω B ω : B ω B ω o,d B (B ω B ω ) B ω B B ω ( )(0),( )
50 Coinduction Example: Binary operation on Streams Define a binary operation on streams B ω B ω B ω : B ω B ω o,d B (B ω B ω ) B ω B B ω ( )(0),( ) by taking as coalgebra structure on B ω B ω : σ, τ B ω, o(σ, τ) = σ(0), d(σ, τ) = τ, σ
51 Coinduction Example: Binary operation on Streams Define a binary operation on streams B ω B ω B ω : B ω B ω o,d B (B ω B ω ) zip id B zip B ω B B ω ( )(0),( ) by taking as coalgebra structure on B ω B ω : σ, τ B ω, o(σ, τ) = σ(0), d(σ, τ) = τ, σ Operation zip is defined by coinduction.
52 Coinduction Example: Binary operation on Streams Define a binary operation on streams B ω B ω B ω : B ω B ω o,d B (B ω B ω ) zip id B zip B ω B B ω ( )(0),( ) by taking as coalgebra structure on B ω B ω : σ, τ B ω, o(σ, τ) = σ(0), d(σ, τ) = τ, σ Operation zip is defined by coinduction. Commutativity of the diagram means that σ, τ B ω, zip(σ, τ)(0) = σ(0), zip(σ, τ) = zip(τ, σ ) (1) zip is a solution to the stream differential equation (SDE) (1).
53 Coinduction Behavioural Differential Equations (BDEs) Define elements of and operations on a final F -coalgebra (Z, ζ) by specifying the behavioural equations it must satisfy. More examples on N ω : σ = σ + σ, σ(0) = 0, σ (0) = 1 defines Fibonacci σ = (0, 1, 1, 2, 3, 5, 8,...). σ = σ + (σ σ), σ(0) = 1 defines σ = (1, 2, 6, 22, 90, 394, 1806, 8558, 41586,...) of (large) Schröder numbers (sequence A in OEIS), cf. [Winter-Bonsangue-Rutten 12] (n σ) = n σ (n σ)(0) = n σ(0) n N defines scalar product.
54 Coinduction Example: Hamming Numbers Stream H N ω of Hamming numbers H = (1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16,...) consists of natural numbers of the form 2 i 3 j 5 k for i, j, k 0 in increasing order (cf. Dijkstra 81, Yuen 92).
55 Coinduction Example: Hamming Numbers Stream H N ω of Hamming numbers H = (1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16,...) consists of natural numbers of the form 2 i 3 j 5 k for i, j, k 0 in increasing order (cf. Dijkstra 81, Yuen 92). We define H by the following SDEs: H(0) = 1, H = (2 H) ((3 H) (5 H)) { σ(0) if σ(0) < τ(0) and (σ τ)(0) = τ(0) if σ(0) τ(0) σ τ if σ(0) < τ(0) (σ τ) = σ τ if σ(0) = τ(0) σ τ if σ(0) > τ(0) That is, merges two streams by taking smallest initial values first, and removing duplicates. Scalar product defined as before.
56 Coinduction Ensuring Unique Solutions SDEs as specification language for streams We want unique solutions. Do all SDEs have unique solutions?
57 Coinduction Ensuring Unique Solutions SDEs as specification language for streams We want unique solutions. Do all SDEs have unique solutions? σ(0) = 1, σ = σ has many solutions. even(σ)(0) = σ(0), even(σ) = even(σ ) has unique solution, even(σ) = (σ(0), σ(2), σ(4),...) but σ(0) = 1, σ = even(σ) has no unique solution. How can we guarantee unique solutions? When is a stream definition productive?
58 Coinduction A Syntactic Format for SDEs Signature Σ: collection of operation symbols with arities. E.g. (B ω = R ω operation [r], r R X + ) arity T Σ (V ) = Σ-terms over (set of generators) V : T Σ (V ) t ::= v V [r], r R X t + t t t t
59 Coinduction A Syntactic Format for SDEs Signature Σ: collection of operation symbols with arities. E.g. (B ω = R ω operation [r], r R X + ) arity T Σ (V ) = Σ-terms over (set of generators) V : T Σ (V ) t ::= v V [r], r R X t + t t t t Def. A stream definition for Σ is a set of SDEs, one for each Σ-operation f Σ of arity k of the form: f (σ 1,..., σ k )(0) = o f (σ 1 (0),..., σ k (0)) f (σ 1,..., σ k ) = d f (σ 1 (0),..., σ k (0)) where o f (σ 1 (0),..., σ k (0)) B d f (σ 1 (0),..., σ k (0)) T Σ (σ 1,..., σ k, σ 1,..., σ k ).
60 Coinduction A Syntactic Format for SDEs (II) Example: Stream definition for stream calculus signature: [r](0) = r, [r] = [0] r R X(0) = 0, X = [1] (σ + τ)(0) = σ(0) + τ(0), (σ + τ) = σ + τ ( σ)(0) = σ(0), ( σ) = σ (σ τ)(0) = σ(0) τ(0), (σ τ) = (σ τ) + ([σ(0)] τ ) Example: Definition of Hamming numbers. The syntactic format is also known as the stream GSOS format due to analogy with GSOS format from structural operational semantics (cf. [Bartels], [Klin], [Turi-Plotkin]). Generalisations for other coalgebra types immediate from categorical framework.
61 Coinduction A Syntactic Format for SDEs (III) Theorem: [Kupke-Niqui-Rutten 11][Bartels][Klin] Given a signature Σ, any Σ-definition in the stream GSOS format has a unique solution, i.e., defines a unique interpretation of operation symbols as stream operations. Proof sketch: A stream GSOS definition induces a coalgebra structure δ on terms: T Σ (B ω ) δ B T Σ (B ω ) α id B α B ω = B B ω By coinduction, we obtain a unique term interpretation α which corresponds to unique interpretation of Σ-operations.
62 Coinduction A Syntactic Format for SDEs (IV) Examples not in the stream GSOS format: c(0) = 1, c = c, since d c = c / T Σ ( ). even(σ) = σ(0), even(σ) = even(σ ), since even(σ ) / T Σ (σ, σ ). (Note: d(0) = 1, d = even(d) is in stream GSOS format.)
63 Coinduction A Syntactic Format for SDEs (IV) Examples not in the stream GSOS format: c(0) = 1, c = c, since d c = c / T Σ ( ). even(σ) = σ(0), even(σ) = even(σ ), since even(σ ) / T Σ (σ, σ ). (Note: d(0) = 1, d = even(d) is in stream GSOS format.) Remark on causal operations: All operations defined in the stream GSOS format are causal: The n th element of output stream f (σ 1,..., σ k ) is determined by the first n elements of the input streams σ 1,..., σ k. Operation even is not causal. Conversely, all causal stream operations can be defined by a (possibly infinite) stream GSOS definition (cf. [KNR 11]).
64 Coinduction Beyond Causality Endrullis,Grabmayer,Hendriks,Isihara & Klop. Productivity of stream definitions. Theor.Comp.Sci. 411, Ghani,Hancock & Pattinson. Representations of stream processors using nested fixed points. Logical Methods in Computer Science, 5(3), Abel & Pientka. Well-founded recursion with copatterns. Int. Conf. on Functional Programming (ICFP 2013).
65 Coinduction Coinduction wrt final DAO of Streams Recall the final DAO (output in B, alphabet A = {1, 2, 3}) of streams: β = ( )(0), unzip 3 (( ) ) : B ω B (B ω ) {1,2,3}
66 Coinduction Coinduction wrt final DAO of Streams Recall the final DAO (output in B, alphabet A = {1, 2, 3}) of streams: β = ( )(0), unzip 3 (( ) ) : B ω B (B ω ) {1,2,3} Behaviour map [[ ]]: (X, o, d ) (B ω, α) is coalgebra morphism: x X : [[x]](0) = o(x) unzip 0,3 ([[x]] ) = [[d(x)(1)]] unzip 1,3 ([[x]] ) = [[d(x)(2)]] unzip 2,3 ([[x]] ) = [[d(x)(3)]] using zip 3 unzip 3 = id B ω, this is equivalent with x X : [[x]](0) = o(x) [[x]] = zip 3 ([[d(x)(1)]], [[d(x)(2)]], [[d(x)(3)]])
67 Coinduction Zip-SDEs Example of a (finite) system of zip 3 -SDEs over X = {x, y, z} with B = {a, b}: x(0) = a, x = zip 3 (y, x, x), y(0) = b, y = zip 3 (x, y, x), z(0) = b, z = zip 3 (y, z, y), Every system of zip k -SDEs has a unique stream solution [[ ]]: X B ω. TFAE (cf. [Endrullis-Grabmayer-Hendriks-Klop-Moss 11]): σ B ω is k-automatic σ is in the solution to a finite system of zip k -SDEs.
68 Coinduction Stream Calculus Recall the SDEs defining stream calculus operations on R ω : [r](0) = r, [r] = [0] r R X(0) = 0, X = [1] (σ + τ)(0) = σ(0) + τ(0), (σ + τ) = σ + τ ( σ)(0) = σ(0), ( σ) = σ (σ τ)(0) = σ(0) τ(0), (σ τ) = (σ τ) + ([σ(0)] τ ) (R ω, +,,, 0, 1) is an integral domain. Fundamental theorem: σ = σ(0) + X σ for all σ R ω. Convolution inverse: σ 1 (0) = σ(0) 1, (σ 1 ) = (σ(0) σ ) σ 1 under condition σ(0) 0 (partial operation). We write: rσ = [r] σ, 1 σ = 1/σ = σ 1 and σ τ = σ τ 1.
69 Coinduction Polynomial and Rational Streams Polynomial stream σ = a 0 + a 1 X + a 2 X 2 + a 3 X a n X n Rational stream σ = ρ π where ρ, π polynomial, and π(0) 0. Stream calculus operations will come back in several talks.
70 Coinduction How to prove stream identities? (R ω, +,,, 0, 1) is a commutative ring. Can we prove this using only the SDE definitions?
71 Coinduction Equivalence When are two systems the same? When their states encode the same set of behaviours. When do two states have the same behaviour? When [[x]] = [[y]].
72 Coinduction Equivalence When are two systems the same? When their states encode the same set of behaviours. When do two states have the same behaviour? When [[x]] = [[y]]. More generally, two states x (X, γ) and y (Y, δ) are behaviourally equivalent if there exist morphisms (X, γ) f g (Z, ζ) (Y, δ) such that f (x) = g(y). How do we prove it? We build a bisimulation.
73 Coinduction Coalgebraic Bisimulation Coalgebra morphism = structure-respecting function Coalgebra bisimulation = structure-respecting relation
74 Coinduction Coalgebraic Bisimulation Coalgebra morphism = structure-respecting function Coalgebra bisimulation = structure-respecting relation Def. (Aczel-Mendler) A bisimulation between F -coalgebras (X, γ) and (Y, δ) is a relation R X Y such that there is a coalgebra structure ρ: R F (R) such that the projections π X : (R, ρ) (X, γ) and π Y : (R, ρ) (Y, δ) are coalgebra morphisms: X γ F (X ) π X F (π X ) R ρ π Y Y F (π Y ) F (R) F (Y ) δ
75 Coinduction Bisimulation for DSOs Bisimulation diagram: X π X R π Y Y o X,d X B X id B π X ρ B R id B π Y B Y o Y,d Y Concretely: x, y R : o X (x) = o Y (y) and d X (x), d Y (y) R. Stream bisimulation (bisimulation on (B ω, ( )(0), ( ) ): σ, τ R : σ(0) = τ(0) and σ, τ R.
76 Coinduction Basic Facts about Bisimulations A map f : X Y is a coalgebra morphism f : (X, γ) (Y, δ) iff Graph(f ) = { x, f (x) x X } is a bisimulation. Bisimulations are closed under arbitrary unions. Hence the largest bisimulation ( bisimilarity, ) between two coalgebras exists: x y iff there is a bisimulation R s.t. x, y R. Coalgebra morphisms preserve bisimilarity: x y f (x) g(y) if f, g are coalgebra morphims. Bisimilarity on a single coalgebra is an equivalence relation. For all (X, γ) there is a coalgebra map γ : X / F (X / ) s.t. the quotient map q : X X / is a coalgebra morphism. Generalises existing notions from process theory and modal logic.
77 Coinduction Coinductive Proof Principle Let (Z, ζ) be a final F -coalgebra. id Z : (Z, ζ) (Z, ζ) is the unique F -coalgebra morphism. q Hence: (Z, ζ) (Z/, ζ )!h (Z, ζ) = id Z hence q is injective, and = Z (identity relation).
78 Coinduction Coinductive Proof Principle Let (Z, ζ) be a final F -coalgebra. id Z : (Z, ζ) (Z, ζ) is the unique F -coalgebra morphism. q Hence: (Z, ζ) (Z/, ζ )!h (Z, ζ) = id Z hence q is injective, and = Z (identity relation). A final coalgebra (Z, ζ) satisfies the Coinductive Proof Principle: x, y (Z, ζ) : x y x = y. By preservation of bisimilarity under morphisms, we have: For all x (X, γ) and y (Y, δ): x y [[x]] = [[y]]. A bisimulation is a proof of behavioural equivalence.
79 Coinduction Stream Bisimulation Example Prove that: σ + τ = τ + σ for all σ, τ B ω.
80 Coinduction Stream Bisimulation Example Prove that: σ + τ = τ + σ for all σ, τ B ω. Take R is a stream bisimulation: R = { σ + τ, τ + σ σ, τ B ω }. (σ + τ)(0) = σ(0) + τ(0) = τ(0) + σ(0) = (τ + σ)(0) (σ + τ) = σ + τ R τ + σ = (τ + σ)
81 Coinduction Stream Bisimulation Example Consider shuffle product defined by SDE (σ τ)(0) = σ(0) τ(0), (σ τ) = (σ τ) + (σ τ ) Prove that : σ τ = τ σ.
82 Coinduction Stream Bisimulation Example Consider shuffle product defined by SDE (σ τ)(0) = σ(0) τ(0), (σ τ) = (σ τ) + (σ τ ) Prove that : σ τ = τ σ. Compute: (σ τ) = (σ τ) + (σ τ ) (τ σ) = (τ σ) + (τ σ ) (σ τ) = ((σ τ) + (σ τ )) + ((σ τ ) + (σ τ ) (τ σ) = ((τ σ) + (τ σ )) + ((τ σ ) + (τ σ ) Problem: derivatives keep growing.
83 Coinduction Bisimulation-up-to Def. Let Σ denote a collection of stream operations. A relation R B ω B ω is a stream bisimulation-up-to-σ if for all σ, τ R: σ(0) = τ(0) and σ, τ R, where R B ω B ω is the smallest relation such that 1. R R 2. { σ, σ σ B ω } R 3. R is closed under the (element-wise application of) operations in Σ. For instance, if Σ contains addition and α, β, γ, δ R then α + γ, β + δ R. Lemma: If R is a bisimulation-up-to-σ then R is a bisimulation. (Bisimulation-up-to-Σ is sound)
84 Coinduction Bisimulation-up-to Example Back to commutativity of shuffle product: Observe: So is a bisimulation-up-to addition. (σ τ) = (σ τ) + (σ τ ) = (σ τ ) + (σ τ) (τ σ) = (τ σ) + (τ σ ) R = { σ τ, τ σ σ, τ R ω } Note: Symbolic reasoning, algorithmic. No knowledge of binomial coefficients needed.
85 Coinduction Summary Coalgebra is a uniform framework of state-based systems. final coalgebras characterise observable behaviour. final coalgebras yield a coinduction principle (proof and definition). Coinductive definitions are behavioural differential equations. streams are a final DSO stream differential eqs (SDEs). streams are a final DAO zip-sdes. stream GSOS format ensures unique solutions to SDEs. Coinductive proofs are bisimulations (up-to), circular proofs. can be constructed as a greatest fixed point.
86 Coinduction Selected Coalgebra References Universal Coalgebra: J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Theoretical Computer Science, 249(1):380, B. Jacobs and J.J.M.M. Rutten. An introduction to (co)algebras and (co)induction. In: Advanced topics in bisimulation and coinduction, Cambridge Tracts in Theor. Comp. Science Volume 52, CUP Stream Differential Equations: J.J.M.M. Rutten. Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoretical Computer Science Volume 308(1 3), pp. 1 53, C. Kupke, M. Niqui, J. Rutten. Stream Differential Equations: concrete formats for coinductive definitions. Technical Report No. RR-11-10, Oxford University, J. Winter, M. Bonsangue and J. Rutten. Coalgebraic characterizations of context-free languages. Logical Methods in Computer Science, Vol. 9 (3:14), H.H. Hansen, C. Kupke and J. Rutten. Stream differential equations, an overview. In preparation.
87 Coinduction Selected Coalgebra References Automatic Sequences: C. Grabmayer, J. Endrullis, D. Hendriks, J.W. Klop, and L.S. Moss. Automatic sequences and zip-specifications. Proceedings of LICS, C. Kupke and J. Rutten. On the final coalgebra of automatic sequences. Logic and Program Semantics, volume 7230 of LNCS, Springer, Automata and Formal Languages: F. Bonchi, M. Bonsangue, H.H. Hansen, P. Panangaden, J. Rutten, A. Silva. Algebra-coalgebra duality in Brzozowski s minimization algorithm. ACM Transactions on Computational Logic, to appear. A. Silva, F. Bonchi, M. Bonsangue, and J. Rutten. Generalizing determinization from automata to coalgebras. Logical Methods in Computer Science, 9(1), J. Rot, M. Bonsangue, J. Rutten. Coinductive Proof Techniques for Language Equivalence. 7th International Conference on Language and Automata Theory and Applications (LATA 2013). LNCS 7810, Springer.
Streams and Coalgebra Lecture 2
Streams and Coalgebra Lecture 2 Helle Hvid Hansen and Jan Rutten Radboud University Nijmegen & CWI Amsterdam Representing Streams II, Lorentz Center, Leiden, January 2014 Tutorial Overview Lecture 1 (Hansen):
More informationThe Final Deterministic Automaton on Streams
The Final Deterministic Automaton on Streams Helle Hvid Hansen Clemens Kupke Jan Rutten Joost Winter Radboud Universiteit Nijmegen & CWI Amsterdam Brouwer seminar, 29 April 2014 Overview 1. Automata, streams
More informationLecture three: Automata and the algebra-coalgebra duality
Lecture three: Automata and the algebra-coalgebra duality Jan Rutten CWI Amsterdam & Radboud University Nijmegen IPM, Tehran - 13 January 2016 This lecture will explain two diagrams: 1 x c ε σ A r x X
More information1. The Method of Coalgebra
1. The Method of Coalgebra Jan Rutten CWI Amsterdam & Radboud University Nijmegen IMS, Singapore - 15 September 2016 Overview of Lecture one 1. Category theory (where coalgebra comes from) 2. Algebras
More informationWeighted automata coalgebraically
Weighted automata coalgebraically Filippo Bonchi 4 Michele Boreale 5 Marcello Bonsangue,2 Jan Rutten,3 Alexandra Silva Centrum Wiskunde en Informatica 2 LIACS - Leiden University 3 Radboud Universiteit
More informationRealization of Coinductive Types
MFPS 2011 Realization of Coinductive Types Dexter Kozen 1,2 Department of Computer Science Cornell University Ithaca, New York 14853 7501, USA Abstract We give an explicit combinatorial construction of
More information(Co)Algebraic Characterizations of Signal Flow Graphs
(Co)Algebraic Characterizations of Signal Flow Graphs Henning Basold 1,3, Marcello Bonsangue 2,3, Helle H. Hansen 1,3, Jan Rutten 3,1 1 Radboud University Nijmegen 2 Leiden University 3 CWI Amsterdam Abstract
More informationSimulations and Bisimulations for Coalgebraic Modal Logics
Simulations and Bisimulations for Coalgebraic Modal Logics Daniel Gorín and Lutz Schröder Department of Computer Science, Universität Erlangen-Nürnberg Abstract. Simulations serve as a proof tool to compare
More informationBisimulation for Neighbourhood Structures
Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam
More informationStream Differential Equations: concrete formats for coinductive definitions
Stream Differential Equations: concrete formats for coinductive definitions Clemens Kupke 1, Milad Niqui 2 and Jan Rutten 2,3 1 University of Oxford, 2 Centrum Wiskunde & Informatica, Amsterdam, 3 Radboud
More informationBisimulation for Neighbourhood Structures
Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam
More informationOn a Categorical Framework for Coalgebraic Modal Logic
On a Categorical Framework for Coalgebraic Modal Logic Liang-Ting Chen 1 Achim Jung 2 1 Institute of Information Science, Academia Sinica 2 School of Computer Science, University of Birmingham MFPS XXX
More information(2017) : 13 (1) ISSN , /LMCS-13(1:3)2017
Hansen, Helle Hvid and Kupke, Clemens and Rutten, Jan (2017) Stream differential equations : specification formats and solution methods. Logical Methods in Computer Science, 13 (1). pp. 1-52. ISSN 1860-5974,
More informationCoalgebraic Lindström Theorems
Coalgebraic Lindström Theorems Alexander Kurz University of Leicester, UK Yde Venema ILLC, Amsterdam, The Netherlands Abstract We study modal Lindström theorems from a coalgebraic perspective. We provide
More informationCoinductive Proof Techniques for Language Equivalence
Coinductive Proof Techniques for Language Equivalence Jurriaan Rot 1,2,, Marcello Bonsangue 1,2, and Jan Rutten 2,3 1 LIACS Leiden University, Niels Bohrweg 1, Leiden, Netherlands 2 Centrum Wiskunde en
More informationContext-Free Languages, Coalgebraically
Context-Free Languages, Coalgebraically Joost Winter 1, Marcello M. Bonsangue 2,1, and Jan Rutten 1,3 1 Centrum Wiskunde & Informatica (CWI) 2 LIACS Leiden University 3 Radboud University Nijmegen Abstract.
More informationBialgebraic Methods in Structural Operational Semantics
SOS 2006 Preliminary Version Bialgebraic Methods in Structural Operational Semantics (Invited Talk) Bartek 1,2 Warsaw University, Edinburgh University Abstract Bialgebraic semantics, invented a decade
More informationConceptual Connections of Circularity and Category Theory
1/64 Conceptual Connections of Circularity and Category Theory Larry Moss Indiana University, Bloomington ESSLLI 2012, Opole 2/64 The conceptual comparison chart Filling out the details is my goal for
More informationA note on coinduction and weak bisimilarity for while programs
Centrum voor Wiskunde en Informatica A note on coinduction and weak bisimilarity for while programs J.J.M.M. Rutten Software Engineering (SEN) SEN-R9826 October 31, 1998 Report SEN-R9826 ISSN 1386-369X
More informationVietoris bisimulations
Vietoris bisimulations N. Bezhanishvili, G. Fontaine and Y. Venema July 17, 2008 Abstract Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces,
More informationProductive functions as Term-coalgebra anamorphisms in Coq
Productive functions as Term-coalgebra anamorphisms in Coq Clemens Kupke, Milad Niqui and Jan Rutten April 26, 2010 Abstract We present a method for implementing a class of productive functions in Coq.
More informationLogical connections in the many-sorted setting
Logical connections in the many-sorted setting Jiří Velebil Czech Technical University in Prague Czech Republic joint work with Alexander Kurz University of Leicester United Kingdom AK & JV AsubL4 1/24
More informationStream automata are coalgebras
Stream automata are coalgebras Vincenzo Ciancia, Yde Venema Institute of Logic, Language and Computation, University of Amsterdam Abstract. Stream automata (also called ω-automata) and ω-regular languages
More informationCategory Theory (UMV/TK/07)
P. J. Šafárik University, Faculty of Science, Košice Project 2005/NP1-051 11230100466 Basic information Extent: 2 hrs lecture/1 hrs seminar per week. Assessment: Written tests during the semester, written
More informationCoalgebra, lecture 10: Algebra and Coalgebra for Regular Expressions
Coalgebra, lecture 10: Algebra and Coalgebra for Regular Expressions Jurriaan Rot November 19, 2018 By now we ve been talking a lot about coalgebras and coinduction, as well as algebras and induction.
More information(Co-)algebraic Automata Theory
(Co-)algebraic Automata Theory Sergey Goncharov, Stefan Milius, Alexandra Silva Erlangen, 5.11.2013 Chair 8 (Theoretical Computer Science) Short Histrory of Coalgebraic Invasion to Automata Theory Deterministic
More informationNeighborhood Semantics for Modal Logic Lecture 5
Neighborhood Semantics for Modal Logic Lecture 5 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 17, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 5 1 Plan for the
More informationPreliminaries. Chapter 3
Chapter 3 Preliminaries In the previous chapter, we studied coinduction for languages and deterministic automata. Deterministic automata are a special case of the theory of coalgebras, which encompasses
More informationMonoidal Categories, Bialgebras, and Automata
Monoidal Categories, Bialgebras, and Automata James Worthington Mathematics Department Cornell University Binghamton University Geometry/Topology Seminar October 29, 2009 Background: Automata Finite automata
More informationAn introduction to (co)algebra and (co)induction
1 An introduction to (co)algebra and (co)induction 1.1 Introduction Algebra is a well-established part of mathematics, dealing with sets with operations satisfying certain properties, like groups, rings,
More informationLax Extensions of Coalgebra Functors and Their Logic
Lax Extensions of Coalgebra Functors and Their Logic Johannes Marti, Yde Venema ILLC, University of Amsterdam Abstract We discuss the use of relation lifting in the theory of set-based coalgebra and coalgebraic
More informationSimulations in Coalgebra
Simulations in Coalgebra Jesse Hughes Dept. Philosophy, Technical Univ. Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. J.Hughes@tm.tue.nl Bart Jacobs Dept. Computer Science, Univ. Nijmegen,
More information6 Coalgebraic modalities via predicate liftings
6 Coalgebraic modalities via predicate liftings In this chapter we take an approach to coalgebraic modal logic where the modalities are in 1-1 correspondence with so-called predicate liftings for the functor
More informationDuality in Probabilistic Automata
Duality in Probabilistic Automata Chris Hundt Prakash Panangaden Joelle Pineau Doina Precup Gavin Seal McGill University MFPS May 2006 Genoa p.1/40 Overview We have discovered an - apparently - new kind
More informationStep-Indexed Biorthogonality: a Tutorial Example
Step-Indexed Biorthogonality: a Tutorial Example Andrew Pitts University of Cambridge Computer Laboratory 1 Introduction The purpose of this note is to illustrate the use of step-indexing [2] combined
More informationESSLLI 2010 CHP INTRODUCTION TO CATEGORY THEORY, ALGEBRAS AND COALGEBRA. Stefan Milius
ESSLLI 2010 CHP INTRODUCTION TO CATEGORY THEORY, ALGEBRAS AND COALGEBRA Jiří Adámek Stefan Milius This is the course material for our one week course at ESSLLI 2010. The course consists of two parts. The
More informationDistributive laws for the Coinductive Solution of Recursive Equations
Distributive laws for the Coinductive Solution of Recursive Equations Bart Jacobs Institute for Computing and Information Sciences, Radboud University Nijmegen P.O. Box 9010, 6500 GL Nijmegen, The Netherlands
More informationModular Construction of Modal Logics
Modular Construction of Modal Logics Corina Cîrstea 1 and Dirk Pattinson 2 1 School of Electronics and Computer Science, University of Southampton, UK cc2@ecs.soton.ac.uk 2 Institut für Informatik, LMU
More informationProof systems for Moss coalgebraic logic
Proof systems for Moss coalgebraic logic Marta Bílková, Alessandra Palmigiano, Yde Venema March 30, 2014 Abstract We study Gentzen-style proof theory of the finitary version of the coalgebraic logic introduced
More informationPresenting Functors by Operations and Equations
j ) v Presenting Functors by Operations and Equations Marcello M. Bonsangue 1? Alexander Kurz 2?? 1 LIACS, Leiden University, The Netherlands 2 Department of Computer Science, University of Leicester,
More informationTowards Trace Metrics via Functor Lifting
Towards Trace Metrics via Functor Lifting Paolo Baldan 1,Filippo Bonchi 2, Henning Kerstan 3 and Barbara König 3 1 Università di Padova, Italy 2 CNRS, ENS Lyon, Université de Lyon, France 3 Universität
More informationAlgebras. Larry Moss Indiana University, Bloomington. TACL 13 Summer School, Vanderbilt University
1/39 Algebras Larry Moss Indiana University, Bloomington TACL 13 Summer School, Vanderbilt University 2/39 Binary trees Let T be the set which starts out as,,,, 2/39 Let T be the set which starts out as,,,,
More informationReconsidering MacLane. Peter M. Hines
Reconsidering MacLane Coherence for associativity in infinitary and untyped settings Peter M. Hines Oxford March 2013 Topic of the talk: Pure category theory... for its own sake. This talk is about the
More informationSemantical Principles in the Modal Logic of Coalgebras
Semantical Principles in the Modal Logic of Coalgebras Dirk Pattinson Institut für Informatik, Ludwig-Maximilians-Universität München Abstract. Coalgebras for a functor on the category of sets subsume
More informationOn a Purely Categorical Framework for Coalgebraic Modal Logic
On a Purely Categorical Framework for Coalgebraic Modal Logic by Liang-Ting Chen A thesis submitted to the University of Birmingham for the degree of DOCTOR OF PHILOSOPHY School of Computer Science University
More informationNewton series, coinductively
Newton series, coinductively Henning Basold, Helle Hvid Hansen, Jean-Eric Pin, Jan Rutten To cite this version: Henning Basold, Helle Hvid Hansen, Jean-Eric Pin, Jan Rutten. Newton series, coinductively.
More informationPDF hosted at the Radboud Repository of the Radboud University Nijmegen
PDF hosted at the Radboud Repository of the Radboud University Nijmegen The following full text is a preprint version which may differ from the publisher's version. For additional information about this
More information3. Categories and Functors We recall the definition of a category: Definition 3.1. A category C is the data of two collections. The first collection
3. Categories and Functors We recall the definition of a category: Definition 3.1. A category C is the data of two collections. The first collection is called the objects of C and is denoted Obj(C). Given
More informationTransformation of Corecursive Graphs
Transformation of Corecursive Graphs Towards M-Adhesive Categories of Corecursive Graphs Julia Padberg 10.2.2017 Padberg Transformation of Corecursive Graphs 10.2.2017 1 Motivation Table of Contents 1
More informationDuality in Logic and Computation
Duality in Logic and Computation Prakash Panangaden 1 1 School of Computer Science McGill University IEEE Symposium On Logic In Computer Science, June 2013 Panangaden (McGill University) Duality in Logic
More informationGames for topological fixpoint logics
Games for topological fixpoint logics Clemens Kupke University of Strathclyde, Glasgow Scotland, UK & EU joint work with Nick Bezhanishvili University of Amsterdam The Netherlands Categories, Logic & Physics,
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationCoalgebraic Semantics of Modal Logics: an Overview
Coalgebraic Semantics of Modal Logics: an Overview Clemens Kupke and Dirk Pattinson Department of Computing, Imperial College London 180 Queen s Gate, London SW7 2AZ, UK c.kupke@imperial.ac.uk, d.pattinson@imperial.ac.uk
More informationDefinability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic
Electronic Notes in Theoretical Computer Science 65 No. 1 (2002) URL: http://www.elsevier.nl/locate/entcs/volume65.html 21 pages Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal
More informationObtaining the syntactic monoid via duality
Radboud University Nijmegen MLNL Groningen May 19th, 2011 Formal languages An alphabet is a non-empty finite set of symbols. If Σ is an alphabet, then Σ denotes the set of all words over Σ. The set Σ forms
More informationDuality in Logic and Computation
Duality in Logic and Computation Prakash Panangaden 1 1 School of Computer Science McGill University IEEE Symposium On Logic In Computer Science, June 2013 Panangaden (McGill University) Duality in Logic
More informationCategorical coherence in the untyped setting. Peter M. Hines
Categorical coherence in the untyped setting Peter M. Hines SamsonFest Oxford May 2013 The Untyped Setting Untyped categories Categories with only one object (i.e. monoids) with additional categorical
More informationA few bridges between operational and denotational semantics of programming languages
A few bridges between operational and denotational semantics of programming languages Soutenance d habilitation à diriger les recherches Tom Hirschowitz November 17, 2017 Hirschowitz Bridges between operational
More informationProduct rules and distributive laws
Product rules and distributive laws Joost Winter University of Warsaw April 2, 2016 Overview Main goal of this paper: a categorical framework for a two-step determinization process in which product rules,
More informationRelational semantics for a fragment of linear logic
Relational semantics for a fragment of linear logic Dion Coumans March 4, 2011 Abstract Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic.
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationA Coalgebraic Approach to Linear-Time Logics
A Coalgebraic Approach to Linear-Time Logics Corina Cîrstea University of Southampton cc2@ecs.soton.ac.uk Abstract. We extend recent work on defining linear-time behaviour for state-based systems with
More informationCombining Bialgebraic Semantics and Equations
Combining Bialgebraic Semantics and Equations Jurriaan Rot 1 and Marcello Bonsangue 2 1 LIACS Leiden University, Niels Bohrweg 1, Leiden, The Netherlands 2 Centrum Wiskunde en Informatica, Science Park
More informationLogic for Computational Effects: work in progress
1 Logic for Computational Effects: work in progress Gordon Plotkin and John Power School of Informatics University of Edinburgh King s Buildings Mayfield Road Edinburgh EH9 3JZ Scotland gdp@inf.ed.ac.uk,
More informationSymbol Index Group GermAnal Ring AbMonoid
Symbol Index 409 Symbol Index Symbols of standard and uncontroversial usage are generally not included here. As in the word index, boldface page-numbers indicate pages where definitions are given. If a
More informationStructural Operational Semantics for Weighted Transition Systems
Structural Operational Semantics for Weighted Transition Systems Bartek Klin Warsaw University, University of Cambridge Abstract. Weighted transition systems are defined, parametrized by a commutative
More informationMix-Automatic Sequences
Mix-Automatic Sequences Jörg Endrullis 1, Clemens Grabmayer 2, and Dimitri Hendriks 1 1 VU University Amsterdam 2 Utrecht University Abstract. Mix-automatic sequences form a proper extension of the class
More informationMATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA
MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA These are notes for our first unit on the algebraic side of homological algebra. While this is the last topic (Chap XX) in the book, it makes sense to
More informationSemantics for algebraic operations
MFPS 17 Preliminary Version Semantics for algebraic operations Gordon Plotkin and John Power 1 Laboratory for the Foundations of Computer Science University of Edinburgh King s Buildings, Edinburgh EH9
More informationConstructing the Lindenbaum algebra for a logic step-by-step using duality (extended version)
Constructing the Lindenbaum algebra for a logic step-by-step using duality (extended version) Dion Coumans and Sam van Gool Abstract We discuss the incremental construction of the Lindenbaum algebra for
More informationMonoidal Company for Accessible Functors *
Monoidal Company for Accessible Functors * Henning Basold, Damien Pous, Jurriaan Rot To cite this version: Henning Basold, Damien Pous, Jurriaan Rot. Monoidal Company for Accessible Functors *. CALCO,
More informationNeighborhood Semantics for Modal Logic Lecture 4
Neighborhood Semantics for Modal Logic Lecture 4 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 16, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 4 1 Plan for the
More informationDuality in Logic. Duality in Logic. Lecture 2. Mai Gehrke. Université Paris 7 and CNRS. {ε} A ((ab) (ba) ) (ab) + (ba) +
Lecture 2 Mai Gehrke Université Paris 7 and CNRS A {ε} A ((ab) (ba) ) (ab) + (ba) + Further examples - revisited 1. Completeness of modal logic with respect to Kripke semantics was obtained via duality
More information1 Differentiable manifolds and smooth maps
1 Differentiable manifolds and smooth maps Last updated: April 14, 2011. 1.1 Examples and definitions Roughly, manifolds are sets where one can introduce coordinates. An n-dimensional manifold is a set
More informationReflection and preservation of properties in coalgebraic (bi)simulations
Reflection and preservation of properties in coalgebraic (bi)simulations Ignacio Fábregas, Miguel Palomino, and David de Frutos Escrig Departamento de Sistemas Informáticos y Computación, UCM fabregas@fdi.ucm.es
More informationModeling and reasoning with I-polynomial data types
Modeling and reasoning with I-polynomial data types Peter Padawitz, TU Dortmund, Germany September 1, 2017 (actual version: http://fldit-www.cs.uni-dortmund.de/ peter/ifip2016.pdf) 1 Road map Some examples
More informationAlgebraic Semantics for Coalgebraic Logics
CMCS 04 Preliminary Version Algebraic Semantics for Coalgebraic Logics Clemens Kupke a Alexander Kurz b,1 Dirk Pattinson c a CWI/Universiteit van Amsterdam b University of Leicester c LMU München Abstract
More informationWeak bisimulations for coalgebras over ordered functors
Weak bisimulations or coalgebras over ordered unctors Tomasz Brengos Faculty o Mathematics and Inormation Sciences Warsaw University o Technology Koszykowa 75 00-662 Warszawa, Poland t.brengos@mini.pw.edu.pl
More informationOn a Monadic Encoding of Continuous Behaviour
On a Monadic Encoding of Continuous Behaviour Renato Neves joint work with: Luís Barbosa, Manuel Martins, Dirk Hofmann INESC TEC (HASLab) & Universidade do Minho October 1, 2015 1 / 27 The main goal A
More informationSECTION 2: THE COMPACT-OPEN TOPOLOGY AND LOOP SPACES
SECTION 2: THE COMPACT-OPEN TOPOLOGY AND LOOP SPACES In this section we will give the important constructions of loop spaces and reduced suspensions associated to pointed spaces. For this purpose there
More informationAutomata and Fixed Point Logic: a Coalgebraic Perspective
Automata and Fixed Point Logic: a Coalgebraic Perspective Yde Venema Abstract This paper generalizes existing connections between automata and logic to a coalgebraic abstraction level. Let F : Set Set
More informationTopos Theory. Lectures 17-20: The interpretation of logic in categories. Olivia Caramello. Topos Theory. Olivia Caramello.
logic s Lectures 17-20: logic in 2 / 40 logic s Interpreting first-order logic in In Logic, first-order s are a wide class of formal s used for talking about structures of any kind (where the restriction
More informationCoalgebraic Walks, in Quantum and Turing Computation
Coalgebraic Walks, in Quantum and Turing Computation Bart Jacobs Institute for Computing and Information Sciences icis), Radboud University Nijmegen, The Netherlands. Webaddress: www.cs.ru.nl/b.jacobs
More informationA Weak Bisimulation for Weighted Automata
Weak Bisimulation for Weighted utomata Peter Kemper College of William and Mary Weighted utomata and Semirings here focus on commutative & idempotent semirings Weak Bisimulation Composition operators Congruence
More informationUniversity of Oxford, Michaelis November 16, Categorical Semantics and Topos Theory Homotopy type theor
Categorical Semantics and Topos Theory Homotopy type theory Seminar University of Oxford, Michaelis 2011 November 16, 2011 References Johnstone, P.T.: Sketches of an Elephant. A Topos-Theory Compendium.
More informationOperads. Spencer Liang. March 10, 2015
Operads Spencer Liang March 10, 2015 1 Introduction The notion of an operad was created in order to have a well-defined mathematical object which encodes the idea of an abstract family of composable n-ary
More informationNabla Algebras and Chu Spaces
Nabla Algebras and Chu Spaces Alessandra Palmigiano and Yde Venema Universiteit van Amsterdam, ILLC Plantage Muidergracht 24 1018 TV Amsterdam, Netherlands Abstract. This paper is a study into some properties
More informationHigher Order Containers
Higher Order Containers Thorsten Altenkirch 1, Paul Levy 2, and Sam Staton 3 1 University of Nottingham 2 University of Birmingham 3 University of Cambridge Abstract. Containers are a semantic way to talk
More informationAbstract model theory for extensions of modal logic
Abstract model theory for extensions of modal logic Balder ten Cate Stanford, May 13, 2008 Largely based on joint work with Johan van Benthem and Jouko Väänänen Balder ten Cate Abstract model theory for
More informationAlgebraic Geometry
MIT OpenCourseWare http://ocw.mit.edu 18.726 Algebraic Geometry Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.726: Algebraic Geometry
More informationA Comonadic Account of Behavioural Covarieties of Coalgebras
Under consideration for publication in Math. Struct. in Comp. Science Comonadic ccount of Behavioural Covarieties of Coalgebras R O B E R T G O L D B L T T Centre for Logic, Language and Computation, Victoria
More informationAn Introduction to the Theory of Coalgebras
An Introduction to the Theory of Coalgebras Dirk Pattinson Institut für Informatik, LMU München 2 Contents 1 Introduction 7 1.1 State Based Systems....................... 7 1.1.1 Informal Denition....................
More informationA Fixed Point Theorem in a Category of Compact Metric Spaces
A Fixed Point Theorem in a Category of Compact Metric Spaces Fabio Alessi, Paolo Baldan, Gianna Bellè Dipartimento di Matematica e Informatica, via Zanon 6, 33100 Udine (Italy) {alessi,baldan,gbelle}@dimi.uniud.it
More informationTECHNISCHE UNIVERSITÄT DRESDEN. Fakultät Informatik. Technische Berichte Technical Reports. Frank Felfe
TECHNISCHE UNIVERSITÄT DRESDEN Fakultät Informatik TUD FI05 02 Januar 2005 Technische Berichte Technical Reports ISSN 1430-211X Frank Felfe Institut für Theoretische Informatik An Approach to Computable
More informationThe algebraicity of the lambda-calculus
The algebraicity of the lambda-calculus André Hirschowitz 1 and Marco Maggesi 2 1 Université de Nice Sophia Antipolis http://math.unice.fr/~ah 2 Università degli Studi di Firenze http://www.math.unifi.it/~maggesi
More informationEndomorphism Semialgebras in Categorical Quantum Mechanics
Endomorphism Semialgebras in Categorical Quantum Mechanics Kevin Dunne University of Strathclyde November 2016 Symmetric Monoidal Categories Definition A strict symmetric monoidal category (A,, I ) consists
More informationCongruence Boolean Lifting Property
Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;
More informationSecond-Order Equational Logic
Second-Order Equational Logic (Extended Abstract) Marcelo Fiore 1 and Chung-Kil Hur 2 1 Computer Laboratory, University of Cambridge 2 Laboratoire PPS, Université Paris 7 Abstract. We extend universal
More informationTesting Semantics: Connecting Processes and Process Logics
Testing Semantics: Connecting Processes and Process Logics Dusko Pavlovic, 1,4 Michael Mislove 2,4 and James B. Worrell 3 1 Kestrel Institute, Palo Alto, CA 2 Tulane University, New Orleans, LA 3 Oxford
More informationDenability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic
Electronic Notes in Theoretical Computer Science 65 No. 1 (2007) URL: http://www.elsevier.nl/locate/entcs/volume65.html 18 pages Denability, Canonical Models, Compactness for Finitary Coalgebraic Modal
More information