On a Monadic Encoding of Continuous Behaviour
|
|
- Eric Perkins
- 5 years ago
- Views:
Transcription
1 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, / 27
2 The main goal A coalgebraic calculus of hybrid components. 2 / 27
3 Motivation & Context Hybrid systems possess both discrete and continuous behaviour. A discrete evolution A continuous evolution Time Time They are often complex but can be seen as the composition of (simpler) components. 3 / 27
4 Motivation & Context Hybrid systems possess both discrete and continuous behaviour. A discrete evolution A continuous evolution Time Time They are often complex but can be seen as the composition of (simpler) components. 3 / 27
5 Motivation & Context Hybrid systems possess both discrete and continuous behaviour. A discrete evolution A continuous evolution Time Time They are often complex but can be seen as the composition of (simpler) components. 3 / 27
6 Thermostat 22 A possible behaviour (c 10) y x 4 / 27
7 Water level regulator 25 A possible behaviour (d 0) y x 5 / 27
8 Hybrid components (coalgebraically) Arrows of type S I S HO where S I S defines the internal (discrete) transitions and S I HO the observable (continuous) behaviour. This favours a coalgebraic perspective! 6 / 27
9 Hybrid components (coalgebraically) Arrows of type S I S HO where S I S defines the internal (discrete) transitions and S I HO the observable (continuous) behaviour. This favours a coalgebraic perspective! 6 / 27
10 Coalgebras & Hybrid systems (related work) Object oriented hybrid systems of coalgebras plus monoid actions [Jacobs, 2000]. A coalgebra for the (discrete) assignments, a monoid for the (continuous) evolutions. Notions of bisimulation for hybrid systems (resort to open maps) [Haghverdi et al., 2005]. 7 / 27
11 Coalgebras & Hybrid systems (related work) Object oriented hybrid systems of coalgebras plus monoid actions [Jacobs, 2000]. A coalgebra for the (discrete) assignments, a monoid for the (continuous) evolutions. Notions of bisimulation for hybrid systems (resort to open maps) [Haghverdi et al., 2005]. 7 / 27
12 Components as coalgebras We view a component as s S, c : S I B(S O) where B is a (strong) monad that captures a specific type of behaviour [Barbosa, 2001]. [Barbosa, 2001] shows how to generate a rich component algebra from a strong monad. 8 / 27
13 Motivation & Context Different monads capture different types of behaviour and thus different kinds of component Maybe monad (M) faulty components Powerset monad (P) non deterministic components Distribution monad (D) probabilistic components Hybrid monad (H) hybrid components 9 / 27
14 Motivation & Context Different monads capture different types of behaviour and thus different kinds of component Maybe monad (M) faulty components Powerset monad (P) non deterministic components Distribution monad (D) probabilistic components Hybrid monad (H) hybrid components 9 / 27
15 Motivation & Context Different monads capture different types of behaviour and thus different kinds of component Maybe monad (M) faulty components Powerset monad (P) non deterministic components Distribution monad (D) probabilistic components Hybrid monad (H) hybrid components 9 / 27
16 Motivation & Context Different monads capture different types of behaviour and thus different kinds of component Maybe monad (M) faulty components Powerset monad (P) non deterministic components Distribution monad (D) probabilistic components Hybrid monad (H) hybrid components 9 / 27
17 Motivation & Context Different monads capture different types of behaviour and thus different kinds of component Maybe monad (M) faulty components Powerset monad (P) non deterministic components Distribution monad (D) probabilistic components Hybrid monad (H) hybrid components 9 / 27
18 Monad H It is defined in such a way that c : S I S HO c : S I S (O T D) unfold H where T = R 0 and D = [0, ]. Kleisli composition allows the transfer of evolution control between components. Technically, this amounts to concatenation of evolutions. 10 / 27
19 Monad H It is defined in such a way that c : S I S HO c : S I S (O T D) unfold H where T = R 0 and D = [0, ]. Kleisli composition allows the transfer of evolution control between components. Technically, this amounts to concatenation of evolutions. 10 / 27
20 Kleisli composition (thermostat revisited) c 1 i = ( λt.(i + t), 10 ), c 2 i = ( λt.(i + sin t), ) 25 c 2 c y x 11 / 27
21 Kleisli composition (thermostat revisited) c 1 i = ( λt.(i + t), 10 ), c 2 i = ( λt.(i + sin t), ) 25 c 2 c y x 11 / 27
22 Monad H and Höfner s Algebra Kleisli composition of Monad H corresponds to concatenation of evolutions in An algebra of hybrid systems [Höfner, 2009] Concatenation of evolutions Time 12 / 27
23 Assembly of monad H (underlying functor) Based upon the category of topological spaces Top. Definition Given a space X Top, HX = { (f, d) X T D f d = f } where d = id d d. Definition Given a continuous function g : X Y, Hg : HX HY, Hg = g T id Intuitively, Hg alters evolutions pointwise (but keeps durations). 13 / 27
24 Assembly of monad H (underlying functor) Based upon the category of topological spaces Top. Definition Given a space X Top, HX = { (f, d) X T D f d = f } where d = id d d. Definition Given a continuous function g : X Y, Hg : HX HY, Hg = g T id Intuitively, Hg alters evolutions pointwise (but keeps durations). 13 / 27
25 Assembly of monad H (underlying functor) Based upon the category of topological spaces Top. Definition Given a space X Top, HX = { (f, d) X T D f d = f } where d = id d d. Definition Given a continuous function g : X Y, Hg : HX HY, Hg = g T id Intuitively, Hg alters evolutions pointwise (but keeps durations). 13 / 27
26 Assembly of monad H (underlying functor) An interesting algebra HX θ X θ (f, d) = f 0 14 / 27
27 Assembly of Monad H (monad operations) Id HH η H µ Definition Given a space X Top, η X x = (x, 0) Defines the simplest continuous system of type X HX. 15 / 27
28 Assembly of Monad H (monad operations) Id HH η H µ Definition Given a space X Top,... µ X (f, d) = (θ f, d) ++ (f d) 16 / 27
29 Assembly of Monad H (monad operations) Let us reason HHX (HX) T D (HX) T (X T D) T = (X T ) T D T (X T ) T = X T T 17 / 27
30 Kleisli category Top H (An environment to study the effects of continuity over composition) Top H = Top, for any objects I, O Top H, Top H (I, O) = Top(I, HO) the identity of I is η I, and given two arrows c 1 : I HK, c 2 : K HO their (sequential) composition, is equal to c 2 c 1 : I HO µ Hc 2 c 1 18 / 27
31 Kleisli composition (of Top H ) I c 1 HK Hc 2 HHO µ HO 4 c1 0 y 3 2 Hc x 19 / 27
32 Other forms of composition (in Top H ) Choice (coproduct) c 1 : I 1 HO, c 2 : I 2 HO [c 1, c 2 ] : I 1 + I 2 HO (+) Parallelism (pullback) c 1 : I HO 1, c 2 : I HO 2 c 1, c 2 : I H(O 1 O 2 ) ( ) These operators are (co)limits, hence a number of useful laws come for free! 20 / 27
33 Other forms of composition (in Top H ) Choice (coproduct) c 1 : I 1 HO, c 2 : I 2 HO [c 1, c 2 ] : I 1 + I 2 HO (+) Parallelism (pullback) c 1 : I HO 1, c 2 : I HO 2 c 1, c 2 : I H(O 1 O 2 ) ( ) These operators are (co)limits, hence a number of useful laws come for free! 20 / 27
34 Other forms of composition (in Top H ) Choice (coproduct) c 1 : I 1 HO, c 2 : I 2 HO [c 1, c 2 ] : I 1 + I 2 HO (+) Parallelism (pullback) c 1 : I HO 1, c 2 : I HO 2 c 1, c 2 : I H(O 1 O 2 ) ( ) These operators are (co)limits, hence a number of useful laws come for free! 20 / 27
35 Other forms of composition (in Top H ) Synchronised parallelism c 1 : I HO 1, c 2 : I HO 2 c 1, c 2 : I H(O 1 O 2 ) (s) Feedback c : I HI νc : I HI (ν) 21 / 27
36 Other forms of composition (in Top H ) Synchronised parallelism c 1 : I HO 1, c 2 : I HO 2 c 1, c 2 : I H(O 1 O 2 ) (s) Feedback c : I HI νc : I HI (ν) 21 / 27
37 Top H (Parallelism) c 1 x = (λt. x + (sin t), 20 ) c 2 x = (λt. x + (sin(3 t)), 20 ) c 1, c y x 22 / 27
38 Top H (Parallelism) c 1 x = (λt. x + (sin t), 20 ) c 2 x = (λt. x + (sin(3 t)), 20 ) c 1, c y x 22 / 27
39 Top H (Parallelism) c 3 (x, y) = (λt. x + y, 0) c 3 c 1, c y x 23 / 27
40 Top H (Parallelism) c 3 (x, y) = (λt. x + y, 0) c 3 c 1, c y x 23 / 27
41 Conclusions Our goal is a coalgebraic calculus of hybrid components and monad H seems to be a promising approach for this. But mind Simulink, widely used in industry, and Hybrid automata, the standard formalism for the specification of hybrid systems. The former is highly expressive, but lacks a clear semantics. The latter is very intuitive, but does not have composition mechanisms as rich as Simulink. 24 / 27
42 Conclusions Our goal is a coalgebraic calculus of hybrid components and monad H seems to be a promising approach for this. But mind Simulink, widely used in industry, and Hybrid automata, the standard formalism for the specification of hybrid systems. The former is highly expressive, but lacks a clear semantics. The latter is very intuitive, but does not have composition mechanisms as rich as Simulink. 24 / 27
43 Conclusions Our goal is a coalgebraic calculus of hybrid components and monad H seems to be a promising approach for this. But mind Simulink, widely used in industry, and Hybrid automata, the standard formalism for the specification of hybrid systems. The former is highly expressive, but lacks a clear semantics. The latter is very intuitive, but does not have composition mechanisms as rich as Simulink. 24 / 27
44 Future work Introduction of non determinism. Development of a calculus bisimulation based. Try to answer the question: Which kind of logics does monad H gives rise to? 25 / 27
45 Future work Introduction of non determinism. Development of a calculus bisimulation based. Try to answer the question: Which kind of logics does monad H gives rise to? 25 / 27
46 Future work Introduction of non determinism. Development of a calculus bisimulation based. Try to answer the question: Which kind of logics does monad H gives rise to? 25 / 27
47 References I Barbosa, L. S. (2001). Components as coalgebras. PhD thesis, DI, Minho University. Haghverdi, E., Tabuada, P., and Pappas, G. J. (2005). Bisimulation relations for dynamical, control, and hybrid systems. Theoretical Computer Science, 342(2 3): Höfner, P. (2009). Algebraic calculi for hybrid systems. PhD thesis, University of Augsburg. 26 / 27
48 References II Jacobs, B. (2000). Object-oriented hybrid systems of coalgebras plus monoid actions. Theoretical Computer Science, 239(1): / 27
A [Monad-Based] Semantics for Hybrid Iteration
A [Monad-Based] Semantics for Hybrid Iteration Sergey Goncharov a Julian Jakob a Renato Neves b CONCUR 2018, September 4-7, Beijing a Friedrich-Alexander-Universität Erlangen-Nürnberg b INESC TEC (HASLab)
More informationBringing class diagrams to life
Bringing class diagrams to life Luis S. Barbosa & Sun Meng DI-CCTC, Minho University, Braga & CWI, Amsterdam UML & FM Workshop 2009 Rio de Janeiro 8 December, 2009 Formal Methods proofs problems structures
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 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 informationProbability as Logic
Probability as Logic Prakash Panangaden 1 1 School of Computer Science McGill University Estonia Winter School March 2015 Panangaden (McGill University) Probabilistic Languages and Semantics Estonia Winter
More informationA categorical view of computational effects
Emily Riehl Johns Hopkins University A categorical view of computational effects C mp se::conference 1. Functions, composition, and categories 2. Categories for computational effects (monads) 3. Categories
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 informationStreams and Coalgebra Lecture 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 Tutorial Overview Lecture 1 (Hansen):
More informationRelational Algebra for Just Good Enough Hardware
Relational Algebra for Just Good Enough Hardware J.N. Oliveira Inesc Tec & University of Minho RAMiCS 2014 Marienstatt im Westerwald, Germany 28 April - 1 May 2014 Motivation Motivation Software V&V compared
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 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 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 informationTowards a Flowchart Diagrammatic Language for Monad-based Semantics
Towards a Flowchart Diagrammatic Language or Monad-based Semantics Julian Jakob Friedrich-Alexander-Universität Erlangen-Nürnberg julian.jakob@au.de 21.06.2016 Introductory Examples 1 2 + 3 3 9 36 4 while
More informationDEFINITIONS: OPERADS, ALGEBRAS AND MODULES. Let S be a symmetric monoidal category with product and unit object κ.
DEFINITIONS: OPERADS, ALGEBRAS AND MODULES J. P. MAY Let S be a symmetric monoidal category with product and unit object κ. Definition 1. An operad C in S consists of objects C (j), j 0, a unit map η :
More informationAn Algebra of Hybrid Systems
Peter Höfner University of Augsburg August 22, 2008 The University of Queensland, August 2008 1 c Peter Höfner Hybrid Systems Definition hybrid systems are heterogeneous systems characterised by the interaction
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 informationDistributed transactions and reversibility
Distributed transactions and reversibility Pawel Sobocinski, University of Cambridge Southampton, 26 September 2006 based on joint work with Vincent Danos and Jean Krivine Motivation Reversible CCS (RCCS)
More informationarxiv: v1 [cs.lo] 28 Nov 2017
A UNIFORM FRAMEWORK FOR TIMED AUTOMATA AND BEYOND TOMASZ BRENGOS AND MARCO PERESSOTTI arxiv:1711.10233v1 [cs.lo] 28 Nov 2017 Faculty of Mathematics and Information Science, Warsaw University of Technology,
More informationTowards Operations on Operational Semantics
Towards Operations on Operational Semantics Mauro Jaskelioff mjj@cs.nott.ac.uk School of Computer Science & IT 22 nd British Colloquium for Theoretical Computer Science The Context We need semantics to
More informationMathematical Synthesis of Equational Deduction Systems. Marcelo Fiore. Computer Laboratory University of Cambridge
Mathematical Synthesis of Equational Deduction Systems Marcelo Fiore Computer Laboratory University of Cambridge TLCA 2009 3.VII.2009 Context concrete theories meta-theories Context concrete theories meta-theories
More informationTopological Groupoids and Exponentiability
Topological Groupoids and Exponentiability Susan Niefield (joint with Dorette Pronk) July 2017 Overview Goal: Study exponentiability in categories of topological groupoid. Starting Point: Consider exponentiability
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 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 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 informationConnecting the categorical and the modal logic approaches to Quantum Mech
Connecting the categorical and the modal logic approaches to Quantum Mechanics based on MSc thesis supervised by A. Baltag Institute for Logic, Language and Computation University of Amsterdam 30.11.2013
More informationRecursion in Coalgebras
Recursion in Coalgebras Mauro Jaskelioff mjj@cs.nott.ac.uk School of Computer Science & IT FoP Away Day 2007 Outline Brief overview of coalgebras. The problem of divergence when considering unguarded recursion.
More informationThe formal theory of adjunctions, monads, algebras, and descent
The formal theory of adjunctions, monads, algebras, and descent Emily Riehl Harvard University http://www.math.harvard.edu/~eriehl Reimagining the Foundations of Algebraic Topology Mathematical Sciences
More informationCellularity, composition, and morphisms of algebraic weak factorization systems
Cellularity, composition, and morphisms of algebraic weak factorization systems Emily Riehl University of Chicago http://www.math.uchicago.edu/~eriehl 19 July, 2011 International Category Theory Conference
More informationA Monad For Randomized Algorithms
A Monad For Randomized Algorithms Tyler Barker Tulane University 1 Domains XII August 26, 2015 1 Supported by AFOSR Tyler Barker Tulane University A Monad For Randomized Algorithms Domains XII August 26,
More informationMonads Need Not Be Endofunctors
Monads Need Not Be Endofunctors Thorsten Altenkirch, University of Nottingham James Chapman, Institute of Cybernetics, Tallinn Tarmo Uustalu, Institute of Cybernetics, Tallinn ScotCats, Edinburgh, 21 May
More informationA Coalgebraic Perspective on Logical Interpretations
M. A. Martins A. Madeira L. S. Barbosa A Coalgebraic Perspective on Logical Interpretations Abstract. In Computer Science stepwise refinement of algebraic specifications is a well-known formal methodology
More informationElements of Category Theory
Elements of Category Theory Robin Cockett Department of Computer Science University of Calgary Alberta, Canada robin@cpsc.ucalgary.ca Estonia, Feb. 2010 Functors and natural transformations Adjoints and
More informationA Linear/Producer/Consumer model of Classical Linear Logic
A Linear/Producer/Consumer model of Classical Linear Logic Jennifer Paykin Steve Zdancewic February 14, 2014 Abstract This paper defines a new proof- and category-theoretic framework for classical linear
More informationA categorical model for a quantum circuit description language
A categorical model for a quantum circuit description language Francisco Rios (joint work with Peter Selinger) Department of Mathematics and Statistics Dalhousie University CT July 16th 22th, 2017 What
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 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 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 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 informationFrom syntax to semantics of Dependent Type Theories - Formalized
RDP 2015, Jun. 30, 2015, WCMCS, Warsaw. From syntax to semantics of Dependent Type Theories - Formalized by Vladimir Voevodsky from the Institute for Advanced Study in Princeton, NJ. I will be speaking
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 informationCategory Theory. Categories. Definition.
Category Theory Category theory is a general mathematical theory of structures, systems of structures and relationships between systems of structures. It provides a unifying and economic mathematical modeling
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 informationOn simulations and bisimulations of general flow systems
On simulations and bisimulations of general flow systems Jen Davoren Department of Electrical & Electronic Engineering The University of Melbourne, AUSTRALIA and Paulo Tabuada Department of Electrical
More informationCoalg KPF : Towards a Coalgebraic Calculus for Component-Based Systems
UNU/IIST International Institute for Software Technology Coalg KPF : Towards a Coalgebraic Calculus for Component-Based Systems Sun Meng and Bernhard K. Aichernig UNU/IIST Report No. 271 R UNU/IIST and
More informationA Differential Model Theory for Resource Lambda Calculi - Part I
A Differential Model Theory for Resource Lambda Calculi - Part I Giulio Manzonetto g.manzonetto@cs.ru.nl Intelligent Systems Radboud University Nijmegen FMCS 2011 - Calgary - 11 th June 2011 Giulio Manzonetto
More informationCategories and Functors (Lecture Notes for Midlands Graduate School, 2013) Uday S. Reddy The University of Birmingham
Categories and Functors (Lecture Notes for Midlands Graduate School, 2013) Uday S. Reddy The University of Birmingham April 7, 2013 2 Contents 1 Categories 5 1.1 Categories with and without elements.......................
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 informationA unifying model of variables and names
A unifying model of variables and names Marino Miculan 1 Kidane Yemane 2 1 Dept. of Mathematics and Computing Science, University of Udine Via delle Scienze 206, I-33100 Udine, Italy. miculan@dimi.uniud.it
More informationUniform Schemata for Proof Rules
Uniform Schemata for Proof Rules Ulrich Berger and Tie Hou Department of omputer Science, Swansea University, UK {u.berger,cshou}@swansea.ac.uk Abstract. Motivated by the desire to facilitate the implementation
More informationSemantics and syntax of higher inductive types
Semantics and syntax of higher inductive types Michael Shulman 1 Peter LeFanu Lumsdaine 2 1 University of San Diego 2 Stockholm University http://www.sandiego.edu/~shulman/papers/stthits.pdf March 20,
More informationCOMMUTATIVE ALGEBRA LECTURE 1: SOME CATEGORY THEORY
COMMUTATIVE ALGEBRA LECTURE 1: SOME CATEGORY THEORY VIVEK SHENDE A ring is a set R with two binary operations, an addition + and a multiplication. Always there should be an identity 0 for addition, an
More informationRelational Algebra by Way of Adjunctions. Jeremy Gibbons (joint work with Fritz Henglein, Ralf Hinze, Nicolas Wu) DBPL, October 2015
Relational Algebra by Way of Adjunctions Jeremy Gibbons (joint work with Fritz Henglein, Ralf Hinze, Nicolas Wu) DBPL, October 2015 Relational Algebra by Way of Adjunctions 2 1. Summary bulk types (sets,
More informationQPEL Quantum Program and Effect Language
QPEL Quantum Program and Effect Language QPL 2014 Kyoto Robin Adams r.adams@cs.ru.nl 5 June 2014 R Adams 5 June 2014 QPEL 1 / 32 Introduction QPEL (Quantum Program and Effect language) is a formal system
More informationPartially ordered monads and powerset Kleene algebras
Partially ordered monads and powerset Kleene algebras Patrik Eklund 1 and Werner Gähler 2 1 Umeå University, Department of Computing Science, SE-90187 Umeå, Sweden peklund@cs.umu.se 2 Scheibenbergstr.
More informationGeneric trace semantics via coinduction
Generic trace semantics via coinduction Hasuo, I.; Jacobs, B.P.F.; Sokolova, A. Published in: Logical Methods in Computer Science DOI: 10.2168/LMCS-3(4:11)2007 Published: 01/01/2007 Document Version Publisher
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 informationStreams 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 informationSecondly, a loose semantics for graph transformation systems is dened, which
Double-Pullback Transitions and Coalgebraic Loose Semantics for raph Transformation Systems Reiko Heckel, Hartmut Ehrig and Uwe Wolter TU Berlin, FR 6-1, Franklinstrasse 28/29, 10587 Berlin, ermany freiko,
More informationHomological Algebra and Differential Linear Logic
Homological Algebra and Differential Linear Logic Richard Blute University of Ottawa Ongoing discussions with Robin Cockett, Geoff Cruttwell, Keith O Neill, Christine Tasson, Trevor Wares February 24,
More informationvia Topos Theory Olivia Caramello University of Cambridge The unification of Mathematics via Topos Theory Olivia Caramello
in University of Cambridge 2 / 23 in in In this lecture, whenever I use the word topos, I really mean Grothendieck topos. Recall that a Grothendieck topos can be seen as: a generalized space a mathematical
More informationsset(x, Y ) n = sset(x [n], Y ).
1. Symmetric monoidal categories and enriched categories In practice, categories come in nature with more structure than just sets of morphisms. This extra structure is central to all of category theory,
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 informationarxiv:math/ v1 [math.ct] 1 Apr 2004
arxiv:math/0404016v1 [math.ct] 1 Apr 2004 Are operads algebraic theories? Tom Leinster University of Glasgow T.Leinster@maths.gla.ac.uk www.maths.gla.ac.uk/ tl Abstract I exhibit a pair of non-symmetric
More informationAbout permutation algebras, (pre)sheaves and named sets
About permutation algebras, (pre)sheaves and named sets Fabio Gadducci (gadducci@di.unipi.it) Department of Computer Science, University of Pisa. via F. Buonarroti 2, 56127 Pisa, Italy. Marino Miculan
More informationIn the beginning God created tensor... as a picture
In the beginning God created tensor... as a picture Bob Coecke coecke@comlab.ox.ac.uk EPSRC Advanced Research Fellow Oxford University Computing Laboratory se10.comlab.ox.ac.uk:8080/bobcoecke/home en.html
More informationQuotients of Fully Nonlinear Control Systems
Quotients of Fully Nonlinear Control Systems Paulo Tabuada and George J. Pappas Department of Electrical and Systems Engineering University of Pennsylvania Philadelphia, PA 19104 {tabuadap,pappasg}@seas.upenn.edu
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 informationTOPOSES ARE SYMMETRIC MONOIDAL CLOSED CATEGORIES
Please cite this article as: Viliam Slodičák, Toposes are symmetric monoidal closed categories, Scientific Research of the Institute of Mathematics and Computer Science, 2012, Volume 11, Issue 1, pages
More informationLocally cartesian closed categories
Locally cartesian closed categories Clive Newstead 80-814 Categorical Logic, Carnegie Mellon University Wednesday 1st March 2017 Abstract Cartesian closed categories provide a natural setting for the interpretation
More informationON EXTENSIONS OF LAX MONADS
ON EXTENSIONS OF LAX MONADS MARIA MANUEL CLEMENTINO AND DIRK HOFMANN Abstract. In this paper we construct extensions of Set-monads and, more generally, lax Rel-monads into lax monads of the bicategory
More informationDenoting computation
A jog from Scott Domains to Hypercoherence Spaces 13/12/2006 Outline Motivation 1 Motivation 2 What Does Denotational Semantic Mean? Trivial examples Basic things to know 3 Scott domains di-domains 4 Event
More informationThe equivalence axiom and univalent models of type theory.
The equivalence axiom and univalent models of type theory. (Talk at CMU on February 4, 2010) By Vladimir Voevodsky Abstract I will show how to define, in any type system with dependent sums, products and
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 informationIntroduction to Coalgebra
Introduction to Coalgebra Bart Jacobs Institute for Computing and Information Sciences Digital Security EWSCS 2011: 16th Estonian Winter School in Computer Science 28 feb. 4 march, Estonia EWSCS 11 Bart
More informationSpectra and the Stable Homotopy Category
Peter Bonventre Graduate Seminar Talk - September 26, 2014 Abstract: An introduction to the history and application of (topological) spectra, the stable homotopy category, and their relation. 1 Introduction
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 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 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 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 informationAffine Monads and Side-Effect-Freeness
Affine Monads and Side-Effect-Freeness Bart Jacobs Institute for Computing and Information Sciences, Radboud Universiteit, Nijmegen, The Netherlands bart@cs.ru.nl Abstract. The notions of side-effect-freeness
More informationo ALGEBRAIC K-THEORY AND HIGHER CATEGORIES ANDREW J. BLUMBERG Abstract. The outline of the talk. 1. Setup Goal: Explain algebraic K-theory as a functor from the homotopical category of homotopical categories
More informationAn adjoint construction for topological models of intuitionistic modal logic Extended abstract
An adjoint construction for topological models of intuitionistic modal logic Extended abstract M.J. Collinson, B.P. Hilken, D.E. Rydeheard April 2003 The purpose of this paper is to investigate topological
More informationHOMOTOPY THEORY OF MODULES OVER OPERADS AND NON-Σ OPERADS IN MONOIDAL MODEL CATEGORIES
HOMOTOPY THEORY OF MODULES OVER OPERADS AND NON-Σ OPERADS IN MONOIDAL MODEL CATEGORIES JOHN E. HARPER Abstract. We establish model category structures on algebras and modules over operads and non-σ operads
More informationAutomata and minimization 1
Automata and minimization 1 Thomas Colcombet, IRIF, CNRS Daniela Petrişan, IRIF, CNRS Already in the seventies, strong results illustrating the intimate relationship between category theory and automata
More informationBayes Nets. CS 188: Artificial Intelligence Fall Example: Alarm Network. Bayes Net Semantics. Building the (Entire) Joint. Size of a Bayes Net
CS 188: Artificial Intelligence Fall 2010 Lecture 15: ayes Nets II Independence 10/14/2010 an Klein UC erkeley A ayes net is an efficient encoding of a probabilistic model of a domain ayes Nets Questions
More informationKleisli Category and Database Mappings
Kleisli Category and Database Mappings Zoran Majkić 1 and Bhanu Prasad 2 1 ETF, Applied Mathematics Department, University of Belgrade, Serbia 2 Department of Computer and Information Sciences, Florida
More informationLogic As A Tool For Building Theories
Logic As A Tool For Building Theories Samson Abramsky Oxford University Computing Laboratory Logic For Building Theories Practice-Based PoL: Amsterdam 2009 1 / 29 Overview The Plan Logic For Building Theories
More informationExponentiable functors between quantaloid-enriched categories
Exponentiable functors between quantaloid-enriched categories Maria Manuel Clementino, Dirk Hofmann and Isar Stubbe July 3, 2007 Abstract. Exponentiable functors between quantaloid-enriched categories
More informationOVERVIEW OF SPECTRA. Contents
OVERVIEW OF SPECTRA Contents 1. Motivation 1 2. Some recollections about Top 3 3. Spanier Whitehead category 4 4. Properties of the Stable Homotopy Category HoSpectra 5 5. Topics 7 1. Motivation There
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 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 informationDRAFT DRAFT. Introduction to Coalgebra. Towards Mathematics of States and Observations. Bart Jacobs. Draft Copy.
Introduction to Coalgebra. Towards Mathematics of States and Observations Bart Jacobs Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The
More informationLecture 15: Duality. Next we spell out the answer to Exercise It is part of the definition of a TQFT.
Lecture 15: Duality We ended the last lecture by introducing one of the main characters in the remainder of the course, a topological quantum field theory (TQFT). At this point we should, of course, elaborate
More informationQuantum Groups. Jesse Frohlich. September 18, 2018
Quantum Groups Jesse Frohlich September 18, 2018 bstract Quantum groups have a rich theory. Categorically they are wellbehaved under the reversal of arrows, and algebraically they form an interesting generalization
More informationNOTES ON ADJUNCTIONS, MONADS AND LAWVERE THEORIES. 1. Adjunctions
NOTES ON ADJUNCTIONS, MONADS AND LAWVERE THEORIES FILIP BÁR 1. Adjunctions 1.1. Universal constructions and adjunctions. Definition 1.1 (Adjunction). A pair of functors U : C D and F : D C form an adjoint
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 informationApplications of 2-categorical algebra to the theory of operads. Mark Weber
Applications of 2-categorical algebra to the theory of operads Mark Weber With new, more combinatorially intricate notions of operad arising recently in the algebraic approaches to higher dimensional algebra,
More informationTeooriaseminar. TTÜ Küberneetika Instituut. May 10, Categorical Models. for Two Intuitionistic Modal Logics. Wolfgang Jeltsch.
TTÜ Küberneetika Instituut Teooriaseminar May 10, 2012 1 2 3 4 1 2 3 4 Modal logics used to deal with things like possibility, belief, and time in this talk only time two new operators and : ϕ now and
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 informationA Coalgebraic Approach to Bidirectional Transformations
A Coalgebraic Approach to Bidirectional Transformations Faris Abou-Saleh 1 James McKinna 2 1 Department of Computer Science, University of Oxford 2 School of Informatics, University of Edinburgh April
More information