March 2017 - Categories - categories.org.au

Workshop / summer school on coinduction in type theory, July 2017
by Tom Hirschowitz 31 Mar '17

31 Mar '17

Dear all, We're happy to announce a little workshop / summer school on Coinduction in Type Theory in Le Bourget-du-Lac, near Chambéry, France, from July 3 to July 6, 2017. Everything you need to know should be at http://lama.univ-savoie.fr/~hirschowitz/CoTT2017 , in particular, registration is here http://lama.univ-savoie.fr/~hirschowitz/CoTT2017/registration.php . Briefly, the workshop will revolve around three mini-courses: - Henning Basold: Type Theory Based on Dependent Inductive and Coinductive Types, - Neil Ghani: Coinduction and infinite games, - Rasmus Møgelberg: Guarded dependent type theory with coinductive types. Contributed talks are solicited on theoretical and more applied topics having to do with coinduction and type theory — preferably both! —, particularly those not represented by the invited talks. In the tradition of the Réalisabilité à Chambéry workshop series, the organisers won't organise much, apart from the talks and coffee breaks. In particular, lunch is not organised and registration is free. Some things generally happen spontaneously, like a social dinner and a barbecue near Lake Bourget. The workshop website includes a few hints for accomodation and the like, but please don't hesitate to contact us in case of further questions. Hoping to see you there, Tom Hirschowitz Clovis Eberhart Pierre Hyvernat Rodolphe Lepigre Christophe Raffalli [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Second call for papers: QPL 2017
by Aleks Kissinger 27 Mar '17

27 Mar '17

SECOND CALL FOR PAPERS The 14th International Conference on Quantum Physics and Logic (QPL) July 3-7, 2017 Radboud Universiteit, Nijmegen, Netherlands http://qpl.cs.ru.nl SUBMISSION DEADLINE: 21 April, 2017 The 14th International Conference on Quantum Physics and Logic (QPL) will take place at Radboud University between Monday 3 and Friday 7 July, 2017. The conference brings together researchers working on mathematical foundations of quantum physics, quantum computing, and related areas, with a focus on structural perspectives and the use of logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical methods, and other computer science techniques applied to the study of physical behaviour in general. Work that applies structures and methods inspired by quantum theory to other fields (including computer science) is also welcome. Previous QPL events were held in Glasgow (2016), Oxford (2015), Kyoto (2014), Barcelona (2013), Brussels (2012), Nijmegen (2011), Oxford (2010), Oxford (2009), Reykjavik (2008), Oxford (2006), Chicago (2005), Turku (2004), and Ottawa (2003). REGISTRATION IS NOW OPEN! Find registration details via the QPL 2017 website or register directly at: https://rudigitalsecurity.paydro.com/qpl-2017 SATELLITES There will be a satellite workshop on Quantum Structures hosted by the International Quantum Structures Association (IQSA) from Tuesday July 4th to Friday the 7th. See the QPL website for more information. A separate call for abstracts and participation will be issued shortly. JOINT QPL-IQSA INVITED SPEAKER Miriam Backens (Bristol) QPL INVITED SPEAKERS Matthias Christandl (Copenhagen) Miguel Navasques (Vienna) Paulo Perinotti (Pavia) Jamie Vicary (Oxford) QPL INVITED TUTORIALS Bart Jacobs (Radboud) - Effectus Theory Dan Marsden (Oxford) - Categorical String Diagrams Simon Perdrix (LORIA) - Measurement-based Quantum Computation Ronald de Wolf (CWI) - Quantum Algorithms IMPORTANT DATES Submission: 21 April, 2017 Notification: 29 May Papers ready: 23 June Conference: 3-7 July SUBMISSIONS Prospective speakers are invited to submit a contribution to the conference. - Original contributions consist of a 5-12 page extended abstract which provides sufficient evidence of results of genuine interest and enough detail to allow the program committee to assess the merits of the work. Submission of substantial albeit partial results of work in progress is encouraged. Authors of accepted papers will be invited to give long or short talks, depending on the quality and/or maturity of the submission. - Extended abstracts describing work submitted/published elsewhere will also be considered, provided the work is recent and relevant to the conference. These consist of a 3 page description and should include a link to a separate published paper or preprint. Extended versions of accepted original research contributions will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the conference. Submissions should be prepared using LaTeX, and must be submitted in PDF format. Use of the EPTCS style is encouraged. Submission is done via EasyChair: https://www.easychair.org/conferences/?conf=qpl2017 There will be an award for the best paper whose authors are all students, at the discretion of the programme committee. PROGRAMME COMMITTEE Aleks Kissinger (Radboud, co-chair) Bob Coecke (Oxford, co-chair) Samson Abramsky (Oxford) Miriam Backens (Bristol) John Baez (UC Riverside) Benno van den Berg (Amsterdam) Rick Blute (Ottawa) Dan Browne (University College London) Giulio Chiribella (Hong Kong) Ross Duncan (Strathclyde) Simon Gay (Glasgow) Chris Heunen (Edinburgh) Matty Hoban (Oxford) Dominic Horsman (Durham) Bart Jacobs (Radboud) Kohei Kishida (Oxford) Joachim Kock (Barcelona) Matt Leifer (Chapman) Hans Maassen (Radboud) Paul-Andre Mellies (Paris Diderot) Michael Moortgat (Utrecht) Daniel Oi (Strathclyde) Prakash Panangaden (McGill) Dusko Pavlovic (Hawaii) Simon Perdrix (CNRS Nancy) Paolo Perinotti (Pavia) Robert Raussendorf (British Columbia) Lidia del Rio (ETH Zurich) Ana Belen Sainz (Perimeter Institute) Peter Selinger (Dalhousie) Pawel Sobocinski (Southampton) Rob Spekkens (Perimeter Institute) Isar Stubbe (Littoral-Cote-d'Opale) Benoit Valiron (Paris-Sud) Jamie Vicary (Oxford) Mingsheng Ying (UT Sydney) STEERING COMMITTEE Bob Coecke (Oxford) Prakash Panangaden (McGill) Peter Selinger (Dalhousie) LOCAL ORGANISATION Bart Jacobs Aleks Kissinger Sander Uijlen [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Visiting Assistant Professor positions
by John Baez 26 Mar '17

26 Mar '17

Hi - The University of California at Riverside is trying to hire some visiting assistant professors. We plan to make decisions quite soon. The positions are open to applicants with a minimum of Ph.D or will have a Ph.D by the beginning of the term from all research areas in Mathematics. The teaching load is six courses per year (i.e. 2 per quarter). In addition to teaching, the applicants will be responsible for attending advanced seminars and working on research projects. This is initially a one-year appointment, and with successful annual teaching review, it is renewable for up to a third year term. For more details, including how to apply, go here: https://www.mathjobs.org/jobs/jobs/10162 Best, John Baez [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

CALCO 2017: Last Call for Papers | CALCO Tools & CALCO Early Ideas: Call for Contributions
by Fabio Zanasi 24 Mar '17

24 Mar '17

========================================================= CALL FOR PAPERS: CALCO 2017 7th International Conference on Algebra and Coalgebra in Computer Science June 13 - 16, 2017 Ljubljana, Slovenia http://coalg.org/mfps-calco2017/ ========================================================== Abstract submission: April 3, 2017 Paper submission: April 7, 2017 Author notification: May 15, 2017 Final version due: May 31, 2017 ========================================================== -- SCOPE -- CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebra and coalgebra in computer science. It is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science), and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009), Winchester (UK, 2011), Warsaw (Poland, 2013) and Nijmegen (the Netherlands, 2015). The seventh edition will be held in Ljubljana, Slovenia, colocated with MFPS XXXIII. -- INVITED SPEAKERS -- Nicoletta Sabadini - University of Insubria, IT Alex Simpson - University of Ljubljana, SL *Joint Session with MFPS on Metrics, Privacy and Learning:* James Worrell - University of Oxford, UK (Tutorial) *Further Invited Speakers:* Catuscia Palamidessi - Ecole polytechnique, FR Vincent Danos - Ecole normale superieure, FR Marco Gaboardi - University at Buffalo, USA -- TOPICS OF INTEREST -- We invite submissions of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. We encourage submissions in topics included or related to those listed below. * Abstract models and logics - Automata and languages - Categorical semantics - Modal logics - Relational systems - Graph transformation - Term rewriting * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Calculi and models of concurrent, distributed, mobile, and context-aware computing - General systems theory and computational models (chemical, biological, etc.) * Algebraic and coalgebraic semantics - Abstract data types - Inductive and coinductive methods - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * System specification and verification - Algebraic and coalgebraic specification - Formal testing and quality assurance - Validation and verification - Generative programming and model-driven development - Models, correctness and (re)configuration of hardware/middleware/architectures, - Process algebra * Corecursion in Programming Languages - Corecursion in logic / constraint / functional / answer set programming - Corecursive type inference - Coinductive methods for proving program properties - Implementing corecursion - Applications * Algebra and Coalgebra in quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra * String Diagrams and Network Theory - Combinatorial approaches - Theory of PROPs and operads - Rewriting problems and higher-dimensional approaches - Automated reasoning with string diagrams - Applications of string diagrams - Connections with Control Theory, Engineering and Concurrency -- SUBMISSION GUIDELINES -- Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. Proceedings will be published in the Dagstuhl LIPIcs???Leibniz International Proceedings in Informatics series. Final papers should be no more than 15 pages long in the format specified by LIPIcs (http://www.dagstuhl.de/publikationen/lipics/anleitung-fuer-autoren/) It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Both an abstract and the full paper must be submitted by their respective submission deadlines. A special issue of the open access journal Logical Methods in Computer Science (http://www.lmcs-online.org) containing extended versions of selected papers, is also being planned. Submissions will be handled via EasyChair https://www.easychair.org/conferences/?conf=calco2017 -- BEST PAPER AND BEST PRESENTATION AWARDS -- This edition of CALCO will feature two awards: a Best Paper Award whose recipients will be selected by the PC before the conference and a Best Presentation Award, elected by the participants. -- IMPORTANT DATES -- Abstract submission: April 3, 2017 Paper submission: April 7, 2017 Author notification: May 15, 2017 Final version due: May 31, 2017 -- PROGRAMME COMMITTEE -- Andrej Bauer (University of Ljubljana, Slovenia) Filippo Bonchi (ENS Lyon, France, co-chair) Marcello Bonsangue (University of Leiden, Netherlands) Corina Cirstea (University of Southampton, UK) Robin Cockett (University of Calgary, Canada) Andrea Corradini (University of Pisa, Italy) Sergey Goncharov (Universitaet Erlangen-Nuernberg, Germany) Helle Hvid Hansen (Delft University of Technology, Netherlands) Ichiro Hasuo (University of Tokyo, Japan) Tobias Heindel (University of Copenhagen, Denmark) Tom Hirschowitz (Savoie Mont Blanc University, France) Bart Jacobs (University of Nijmegen, Netherlands) Bartek Klin (Warsaw University, Poland) Barbara Koenig (University of Duisburg-Essen, Germany, co-chair) Alexander Kurz (University of Leicester, UK) Paul Levy (University of Birmingham, UK) Radu Mardare (Aalborg University, Denmark) Stefan Milius (Universitaet Erlangen-Nuernberg, Germany) Samuel Mimram (Ecole Polytechnique, France) Till Mossakowski (Universitaet Magdeburg, Germany) Larry Moss (Indiana University, US) Daniela Petrisan (Universite Paris-Diderot, France) John Power (University of Bath, UK) Grigore Rosu (University of Illinois, US) Jan Rutten (CWI, University of Nijmegen, Netherlands) Peter Selinger (Dalhousie University, Canada) Alexandra Silva (University College London, UK) Pawel Sobocinski (University of Southampton, UK) Ana Sokolova (University of Salzburg, Austria) -- ORGANISING COMMITTEE -- Andrej Bauer (University of Ljubljana, Slovenia) Matija Pretnar (University of Ljubljana, Slovenia) -- PUBLICITY CHAIR -- Fabio Zanasi (University College London, UK) ********************************************************************** CALL FOR CONTRIBUTIONS: CALCO Tools 2017 ********************************************************************** A satellite event of CALCO 2017 June 13, 2017 http://coalg.org/calco17/tools.html ========================================================== Abstract submission: April 3, 2017 Paper submission: April 7, 2017 Author notification: May 15, 2017 Final version: May 31, 2017 ========================================================== -- SCOPE AND SUBMISSION GUIDELINES -- A special workshop at CALCO 2017 is dedicated to tools based on algebraic and/or coalgebraic principles or that are emerging from the intersection of the two approaches, such as graph grammars or coinductive proof techniques. These include systems/prototypes/tools developed specifically for design, checking, execution, and verification of (co)algebraic specifications, but also tools targeting different application domains while making core or interesting use of (co)algebraic techniques. CALCO-Tools will take place on the same dates as the main CALCO conference, with no overlap between the technical programmes of the two events. Tool submissions should not exceed 5 pages in LiPiCS format. The accepted tool papers will be included in the final proceedings of the conference. The tools should be made available on the web at the time of submission, for download and evaluation. Each submission will be evaluated by at least three reviewers; one or more of the reviewers will be asked to download and use the tool. At least one of the authors of each tool paper must attend the conference to demo the tool. Submissions will be handled via the CALCO 2017 Tools EasyChair site https://www.easychair.org/conferences/?conf=calco2017tools -- INVITED SPEAKER -- Nate Foster - Cornell University, USA ******************************************************************* CALL FOR CONTRIBUTIONS: CALCO Early Ideas 2017 ******************************************************************** A satellite event of CALCO 2017 June 13-16, 2017 http://coalg.org/calco17/ei.html ========================================================== Submission: May 1, 2017 Author notification: May 19, 2017 Final version: May 31, 2017 ========================================================== -- SCOPE AND SUBMISSION GUIDELINES -- The programme of CALCO 2017 will include special sessions reserved for the CALCO Early Ideas Workshop, featuring presentations of work in progress and original research proposals. PhD students and young researchers are particularly encouraged to contribute. Attendance at the workshop is open to all conference participants. The CALCO Early Ideas Workshop invites submissions on the same topics as the CALCO conference: reporting results of theoretical work, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. CALCO Early Ideas presentations will be selected according to originality, significance, and general interest, on the basis of submitted 2-page short contributions. It can be work in progress, a summary of work submitted to a conference or workshop elsewhere, or work that in some other way might be interesting to the CALCO audience. A booklet with the accepted short contributions will be available at the workshop. Submissions will be handled via the CALCO 2017 Early Ideas EasyChair site https://www.easychair.org/conferences/?conf=calco2017ei [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

PhD studentships at the University of Leicester
by Kurz, Alexander H. (Dr.) 23 Mar '17

23 Mar '17

Dear All, We have 8 PhD positions at the University of Leicester. 3 (so called GTA positions) involve teaching assistance, are over 4 years and can be in any area of research of our Department of Informatics, including Category Theory, in particular if related to Logic and Computer Science (with potential supervisors Roy Crole and Alexander Kurz). https://www2.le.ac.uk/departments/informatics/postgraduate/research/gta-may… 5 phd positions involve no teaching obligations, are over 3 years and on specific topics: https://www2.le.ac.uk/colleges/scieng/research/pgr/oct-2017/informatics Please pass on to whoever might be interested. I am happy to answer any further questions. Kind regards, Alexander Kurz [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Book on categorical diagrams/quantum theory
by Bob Coecke 22 Mar '17

22 Mar '17

Dear Category Theoreticians, The following book may be of interest to some of you, since it sets out the diagrammatic languages of symmetric monoidal categories, compact closed categories, Frobenius algebras, and many more structures, but in their own right in order to make the book accessible to a very wide audiences e.g. physicists, linguists, engineers, philosophers... This book gives a complete introduction to quantum foundations and quantum computation, developed from first principles using diagrams (or equivalently, algebraic structures internal to a monoidal category). It follows the courses given by us at Oxford for the past 4 years (and starting at Radboud this year), mainly for mathematicians and computer scientists at advanced undergrad/masters level. The conceptual focus is on processes and composition, and many of the methods can be extended beyond quantum theory to other theories of interacting processes. A 20% reduction is given when using the code COECKE2017 at check-out Bob & Aleks - - - - - Picturing Quantum Processes A First Course in Quantum Theory and Diagrammatic Reasoning Bob Coecke (Oxford) and Aleks Kissinger (Nijmegen) Cambridge University Press, 2017 844 pages, approx. 2500 figures, 168 exercises, hardback http://www.cambridge.org/gb/academic/subjects/physics/quantum-physics-quant… <http://www.cambridge.org/gb/academic/subjects/physics/quantum-physics-quant…> [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Term for edges between graph homomorphisms?
by Mike Stay 17 Mar '17

17 Mar '17

If we define a graph to be a tuple (E, V, s: E -> V, t: E -> V), then the category Gph of graphs and graph homomorphisms is cartesian closed (in fact, a topos). For any pair of graphs G, G', there is a "hom graph" whose vertices are graph homomorphisms from G to G' and whose edges are things I've been calling "graph shifts". A graph shift S between two graph homomorphisms F, F':G -> G' assigns to each vertex g in G an edge S(g) in G' from F(g) to F'(g). Is there a more common term for a "graph shift"? -- Mike Stay - metaweta(a)gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

3 2

CILC 2017: Preliminary Call For Papers
by Dario Della Monica 15 Mar '17

15 Mar '17

We are happy to announce the following event. ********************************************************************** CALL FOR PAPERS 32nd Italian Conference on Computational Logic (CILC 2017) -- http://cilc2017.unina.it/ Naples, Italy, September 26-29, 2017 ********************************************************************** CILC (Italian Conference on Computational Logic) is the annual conference organized by GULP (Group of researchers and Users of Logic Programming, www.programmazionelogica.it) Its 32nd edition will be held in Naples (Italy) on September 26-29, 2017. Since the first event of the series, which took place in Genoa in 1986, the annual GULP conference represents the main opportunity for users, researchers and developers working in the field of computational logic to meet and exchange ideas. Over the years the conference broadened its horizons from the specific field of logic programming to include declarative programming and applications in neighboring areas such as artificial intelligence and deductive databases. CILC 2017 is co-located with the 18th Italian Conference on Theoretical Computer Science ICTCS 2017 (http://ictcs2017.unina.it/) with which it will share part of the program. The two events will feature plenary events, on September 29, to be specified later. Contributions: -------------- The conference will feature presentations of refereed contributions, including the demonstration of software prototypes, concerning all aspects of computational logic. The conference invites two types of submissions: full papers, possibly already submitted to other conferences or journals, and short papers, which are particularly suitable for presenting work in progress, software prototypes, extended abstracts of doctoral theses, or general overviews of research projects. The topics of interest include, but are not limited to, the following: Logic Programming, Constraint Programming and other paradigms of declarative programming Extensions and integrations of declarative programming paradigms Analysis, transformation, validation, and verification of programs Instruments and environments for program development Implementations and benchmarking Model Checking Temporal logics Automated Theorem Proving Non-Monotonic Reasoning Answer Set Programming Knowledge representation and extraction Treatment of uncertain and incomplete knowledge Approximate Reasoning Abductive Logic Programming Model-based Reasoning Inductive Logic Programming Deductive Databases Data Mining and Data Integration Multi-agent systems Logics for strategic reasoning Semantic Web Natural Language Processing Computational logic for concurrency, coordination, mobility and objects Planning and scheduling Probabilistic Logic Programming Computational Logic and formal methods in Artificial Intelligence Applications of Computational Logic Pedagogy of Computational Logic Important dates: ---------------- Abstract, paper, and demo submission deadline: 25 May 2017 Notification of acceptance: 30 June 2017 Final version and early registration deadline: 24 July 2017 Conference: 26-29 September 2017 Submission instructions: ------------------------ Authors are invited to submit their manuscripts in PDF via the EasyChair system at the link: https://easychair.org/conferences/?conf=cilc2017 Articles must not exceed 15 pages for full papers and 5 pages for short papers, respectively. Manuscripts should be formatted using the Springer LNCS style. To ease the reviewing process, the authors of regular papers may add an appendix (although reviewers are not required to consider it in their evaluation). All contributions must be written in English. We invite submissions of system or prototype software descriptions which use techniques or tools of computational logic, or which themselves aid the development of applications based on computational logic. Systems of both research and industrial character are welcome. Submissions must include a brief description, prepared according to the guidelines given for short papers, and a specification of the required hardware and software equipment. For each accepted contribution, at least one of the authors is required to attend the conference and present the paper. The event is organized by GULP. Therefore, Italian attendants are required to be members of GULP (it is possible to join GULP at the conference). Proceedings: ------------ Papers accepted for presentation at the conference (both full and short) will be published on CEUR-WS.org. As in previous years, we plan to publish a selection of the best papers in a special issue of an international journal (to be determined). General chair: -------------- Aniello Murano (University of Naples "Federico II") Program co-chairs: ------------------ Dario Della Monica (Universidad Complutense de Madrid) Luigi Sauro (University of Naples "Federico II") Venue: ------ The conference will take place at the "Complesso di San Giovanni a Teduccio---Complesso Napoli Est", in Corso Nicolangelo Protopisani, 70, 80146 Napoli. -------------- For more information email cilc2017(a)easychair.org. -- Dario Della Monica, Postdoctoral Researcher Dipartimento di Ingegneria Elettrica e Tecnologie dell'Informazione (DIETI) University of Naples "Federico II" via Claudio, 21, 80125 Naples, Italy cell: (+39) 328 2477327 email: dario.dellamonica [at] unina.it skype: dariodellamonica web site: http://wpage.unina.it/dario.dellamonica/ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Grothendieck Construction
by Joseph Moeller 13 Mar '17

13 Mar '17

I'm looking for a reference where a theorem of this form was first proven: > If (C,⊗_C) is (symmetric) monoidal, F: C -> Cat a lax (symmetric) monoidal functor, and μ the associated natural transformation, then the Grothendieck category of F is (symmetric) monoidal with ⊗ defined by (c,x)⊗(d,y)=(c⊗d,μ_c,d(x,y)). The proof is a straightforward verification, so I expect it has been done before. thanks, Joe Moeller [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Fibrations of groupoids
by John Baez 13 Mar '17

13 Mar '17

Dear Category Theorists - My grad student Kenny Courser is looking for the references where it was first shown that: 1) Fibrations of groupoids are preserved by strict pullbacks. 2) For any functor between groupoids f: G -> H, we can find an equivalence of groupoids g: G -> G' and a fibration f': G' -> H such that f and f'g are naturally isomorphic. If anyone could point us in the right direction, it would be greatly appreciated. Of course these claims may have first been shown in greater generality, and that would be fine too. Best, jb [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

2 1