July 2016 - Categories - categories.org.au

Union College Math Conference
by Niefield, Susan 30 Jul '16

30 Jul '16

UNION COLLEGE MATHEMATICS CONFERENCE Schenectady, New York Saturday and Sunday December 3 - 4, 2016 This is a preliminary announcement for the 15th Union College Mathematics Conference. This year the conference topics are algebraic and applied topology, category theory, commutative algebra, differential geometry and geometric analysis, and number theory. In addition to featured lectures, there will also be shorter contributed talks in parallel sessions. For more information about the conference, please visit our website at: http://www.math.union.edu/~toddg/ucc/ We hope to see you here in December! ORGANIZERS Algebraic Topology and Applied Topology Ellen Gasparovic (gasparoe(a)union.edu) Brenda Johnson (johnsonb(a)union.edu) Kathryn Lesh (leshk(a)union.edu) Category Theory Susan Niefield (niefiels(a)union.edu) Differential Geometry and Geometric Analysis Charles P. Boyer (University of New Mexico - Albuquerque) Christina Tønnesen-Friedman (tonnesec(a)union.edu) Jeffrey Jauregui (jaureguj(a)union.edu) Number Theory Jeffrey Hatley (hatleyj(a)union.edu) George Todd (toddg(a)union.edu) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

discrete probability functor on Rel
by Paul B Levy 27 Jul '16

27 Jul '16

Dear all, I learnt years ago that the following definition gives an endofunctor D on the category Rel of sets and relations. But I have never seen a proof. - For a set A, let DA be the set of discrete probability distributions on A, i.e. functions from A to nonnegative reals whose sum is 1. (Such functions are necessarily countably supported.) - For a relation R : A -> B, let DR : DA -> DB relate d in DA to d' in DB when for every subset U of A, we have d(U) <= d'(R[U]), writing R[U] for the set of all R-images of elements of U. (It follows that for every subset V of B, we have d'(V) <= d(R^c[V]), writing R^c for the converse of R.) To show D is a functor, the hard part is to show that, for relations R : A --> B and S : B --> C, and d in DA and d'' in DC with (d,d'') in D(S.R), there exists d' in DB such that (d,d') in DR and (d',d'') in DS. I would like to see a proof of this. It's the discrete case of Theorem 1 (i)=>(ii) in https://projecteuclid.org/euclid.aop/1176995659 where two proofs are mentioned. Firstly, Nawrotski's, which is in German, which I can't read: Nawrotski K (1962) Eine Montonieeigenschaft zufaelliger Punktfolgen, Math. Nachr. 24, pages 193-200. Secondly, Strassen's: https://projecteuclid.org/euclid.aoms/1177700153 which is in English but beyond my comprehension. Strassen also cites papers of Kellerer (in German) that might also contain a proof. Can anyone give me a proof, please? Two other things: - For the subfunctor D_f of finitely supported distributions, the result is easier. It's the "splitting lemma" of probabilistic powerdomain theory, and was proved by Jones, and later by Jung and Tix, and earlier by Berge and dall'Aglio (cited by Strassen). But these proofs (at least, the ones I've seen) don't seem to adapt to the countably supported case. - I know that D, being an endofunctor on Set that preserves weak pullbacks, has a unique extension to an endofunctor on Rel. But that doesn't help. Regards, Paul -- Paul Blain Levy School of Computer Science, University of Birmingham http://www.cs.bham.ac.uk/~pbl [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

ETAPS 2017 1st call for papers
by Tarmo Uustalu 26 Jul '16

26 Jul '16

****************************************************************** JOINT CALL FOR PAPERS 20th European Joint Conferences on Theory And Practice of Software ETAPS 2017 Uppsala, Sweden, 22-29 April 2017 http://www.etaps.org/2017 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of five main annual conferences, accompanied by satellite workshops. ETAPS 2017 is the twentieth event in the series. -- MAIN CONFERENCES (24-28 April) -- * ESOP: European Symposium on Programming (PC chair Hongseok Yang, University of Oxford, UK) * FASE: Fundamental Approaches to Software Engineering (PC chairs Marieke Huisman, Universiteit Twente, The Netherlands, and Julia Rubin, University of British Columbia, Canada) * FOSSACS: Foundations of Software Science and Computation Structures (PC chairs Javier Esparza, Technische Universität München, Germany, Andrzej Murawski, University of Warwick, UK) * POST: Principles of Security and Trust (PC chairs Matteo Maffei, Universität des Saarlandes, Germany, Mark D. Ryan, University of Birmingham, UK) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs Axel Legay, INRIA Rennes, France, and Tiziana Margaria, LERO, Ireland) TACAS '17 hosts the 6th Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Michael Ernst (University of Washington, USA) Kim G. Larsen (Aalborg University, DK) * FoSSaCS invited speaker: Joel Ouaknine (University of Oxford, UK) * TACAS invited speaker: Dino Distefano (Facebook and Queen Mary University of London, UK) -- IMPORTANT DATES -- * Abstracts due (ESOP, FASE, FoSSACS, TACAS): 14 October 2016 * Papers due: 21 October 2016 * Rebuttal (ESOP and FoSSaCS only): 7-9 December 2016 * Notification: 22 December 2016 * Camera-ready versions due: 20 January 2017 -- SUBMISSION INSTRUCTIONS -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. ESOP and FoSSaCS accept only research papers. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere (this does not apply to abstracts). In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at the URL http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the EasyChair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. FASE will use a light-weight double-blind review process (see http://www.etaps.org/2017/fase) - Research papers FASE, FOSSACS and TACAS have a page limit of 15 pp (excluding bibliography of max 2 pp) for research papers, whereas POST allows at most 20 pp (excluding bibliography of max 2 pp) and ESOP 25 pp (excluding bibliography of max 2 pp). Additional material intended for the referees but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. In addition to regular research papers, TACAS solicits also case study papers (at most 15 pp, excluding bibliography of max 2 pp). Both TACAS and FASE solicit also regular tool papers (at most 15 pp, excluding bibliography of max 2 pp). The rationale of a separate page limit for the bibliography is to remove the possibility to win space for the body of a paper by cutting the bibliography, a practise that has a negative effect on our competitiveness as a community. - Tool demonstration papers Submissions should consist of two parts: * The first part, at most 4 pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool. (This part will be included in the proceedings.) * The second part, at most 6 pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated. ESOP and FOSSACS do not accept tool demonstration papers. TACAS has a page limit of 6 pages for tool demonstrations. -- SATELLITE EVENTS (22-23 April, 29 April) -- Around 20 satellite workshops will take place before and after the main conferences. -- HOST CITY -- Uppsala city holds a rich history, having for long periods been the political, religious and academic centre of Sweden. Uppsala University is over 500 years old and ranked among the top 100 in the World and has hosted many great scientists over the years, for instance Carl von Linné, Anders Celsius and Anders Jonas Ångström. The proximity to the capital of Sweden, Stockholm, provides additional benefits as a potential site for arranging both pre- and post congress tours, as well as for excursions or tourism. -- HOST INSTITUTION -- ETAPS 2017 is hosted by the Department of Information Technology, Uppsala University. -- ORGANIZERS Parosh Abdulla (General chair), Mohamed Faouzi Atig, Andreina Francisco, Kaj Lampka, Philipp Rümmer, Konstantinos Sagonas, Björn Victor, Wang Yi, Tjark Weber, Yunyun Zhu -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at parosh.abdulla(a)it.uu.se, mohamed_faouzi.atig(a)it.uu.se [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

bar construction for better-than-average monads
by John Baez 26 Jul '16

26 Jul '16

Hi - Given a monad T: C -> C, any algebra A of this monad gives rise to a simplicial algebra of this monad, say BA, via the bar construction. It's finally occurred to me to wonder: how do various extra structures on the monad give extra structures on the bar construction? For example, suppose C is monoidal. Then we say T is a "strong" monad if it's a monad not just in Cat but in the 2-category of C-actions. This amounts to having natural transformations A tensor TB -> T(A tensor B) obeying various laws. If T is strong, what does this do for its bar construction? Similarly, we say T is a "monoidal" monad if it's a monad not just in Cat but in the 2-category of monoidal categories, lax monoidal functors and monoidal natural transformations. This amounts to having a natural transformation TA tensor TB -> T(A tensor B) and a morphism I -> TI obeying various laws. If T is monoidal, what does this do for its bar construction? I could ask the same question for commutative monads, or for a pair of monads related by a distributive law. I would enjoy figuring these out, but someone must have done it already, and I'd rather enjoy doing something new. Best, jb [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Upcoming conference at the University of Leicester
by Paoli, Simona (Dr.) 26 Jul '16

26 Jul '16

Dear Colleagues, next week at the University of Leicester there will be the '31st Summer Conference on Topology and its Applications', Tuesday 2 to Friday 5 August 2016, proceeded by the Galway Colloquium on Monday 1st August 2016. Information is available on the website https://sites.google.com/site/summertopology/home The special sessions on Algebraic Topology and the one on Asymmetric Topology may be of particular interest to category theorists. All abstracts are available at the website at http://at.yorku.ca/cgi-bin/abstract/cbnc-01 The conference registration is formally closed, but if you would like to attend and you are not yet registered, please e-mail tilings(a)le.ac.uk and we may be able to accommodate you. Best regards, The Algebraic Topology session (co)chairs Julie Bergner (University of Virginia) and Simona Paoli (University of Leicester) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Call for participation - CSL 2016 (August 29 - September 1)
by Luigi Santocanale 22 Jul '16

22 Jul '16

Call for participation - CSL 2016 (August 29 - September 1) ----------------------------------------------------------- 25th EACSL Annual Conference on Computer Science Logic Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. CSL 2016 will be the 25th edition in the series. CSL 2016 is hosted by Aix-Marseille Universit=E9 and will take place in Marseille (France) from August 29 to September 1 (Satellite workshops August 28 and September 2-3). Both the main conference and its satellite workshops will be held in the city center campus of the Faculty of Science. These events are jointly organized by the Laboratoire d'Informatique Fondamentale de Marseille and the Institut de Math=E9matiques de Marseille. http://csl16.lif.univ-mrs.fr/ Invited speakers ---------------- - Libor Barto (Charles University in Prague) - Agata Ciabattoni (Technische Universit=E4t Wien) - Anca Muscholl (Universit=E9 Bordeaux) - Alexandra Silva (University College London) Conference programme -------------------- http://csl16.lif.univ-mrs.fr/planning/csl/sessions/ Satellite workshops (August 28, September 2 and 3) -------------------------------------------------- CRECOGI: Concurrent, Resourceful and Effectful Computation by Geometry of Interaction (August 28) LCC'16: Logic and Computational Complexity 2016 (September 2 and 3) PLRR: Parametricity, Logical Relations and Realizability (September 2) QSLC: Quantitative Semantics of Logic and Computation (September 2 and 3) Registration ------------ http://csl16.lif.univ-mrs.fr/registration/ Contact ------- Organisation_csl16(a)liste.lidil.univ-mrs.fr<mailto:Organisation_csl16@liste.= lidil.univ-mrs.fr> [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

LL2016: Call for participation and abstracts
by Philip Scott 22 Jul '16

22 Jul '16

=========================================================== *** Important: student grants, deadline Sep 20, 2016 *** *** Important: call for contributions, deadline Sep 10, 2016 *** ================================================================= Call for participation and submission of abstracts LL2016 - Linear Logic: interaction, proofs and computation Autumn school and workshops Lyon, France, November 7-10, 2016 https://ll2016.sciencesconf.org/ ================================================================= Linear Logic 2016 will be a four-day meeting in Lyon, including three events: - Autumn school on linear logic (Nov 7-8) - Workshop 'Linear logic and philosophy' (Nov 8, afternoon) - Workshop 'Linear logic, mathematics and computer science' (Nov 9-10) The present announcement is a call for submission of abstracts to the workshop 'Linear logic, mathematics and computer science' (Nov 9-10) and a call for participation for all three events (see below). * CONTEXT Linear logic was introduced 30 years ago and has rapidly become a pivot point between mathematical logic and computer science. This field has diversified into various chapters: proof-nets, categorical semantics, geometry of interaction, game semantics etc. These chapters have provided many tools and concepts useful in computer science to analyse, understand, control and generalise computational dynamics. The contribution of linear logic to the logical foundations of computer science has also influenced other fields, e.g. computational linguistics and quantum computing, and it has inspired philosophical investigations around the computational approach to logic. For these reasons the present event aims to gather mathematicians, computer scientists and philosophers in order to foster interaction in research on linear logic. The following three events are organised. Registration instructions for all events are below. * AUTUMN SCHOOL ON LINEAR LOGIC (Nov 7-8) This school is mainly directed towards Master's students with a background in logic and philosophy, computer science or mathematics. It is also open to PhD students and researchers who would like to learn about linear logic. The goal is to give a structured introduction to the main concepts and results in linear logic. It will assume as prerequisites only a basic knowledge of classical logic and of formal proof systems (sequent calculus or natural deduction). The aim is to allow the participants to understand, in particular, the motivations and origins of linear logic, its logical connectives, sequent calculus, proof-nets, semantics, relationships with intuitionistic and classical logic etc. The lectures will be given in English. More detailed information about the programme and the lecturers will be available on the web site. * WORKSHOP 'Linear logic and philosophy' (Nov 8, afternoon) This meeting will consist of invited talks only. It will address some of the philosophical issues raised by linear logic such as the computational foundations of logic, the problem of proof representation, and the interface between logic and physics. * WORKSHOP 'Linear logic, mathematics and computer science' (Nov 9-10) This workshop will consist of invited talks (TBA on the web page soon) and contributed ones. For contributed talks, authors are invited to submit an abstract following the instructions below. Submissions on all topics related to linear logic in its relations with mathematics and computer science are welcome, for instance, but not exclusively: - proof-nets - denotational and categorical semantics - geometry of interaction, game semantics - linear type systems - implicit computational complexity CALL FOR CONTRIBUTIONS We invite the submission of abstracts at most 2 pages long. Submission is electronic, in text or PDF format, via the web site of the workshop at at<https://ll2016.sciencesconf.org/>. - Sep 10, 2016: deadline for submission of abstracts - Sep 25, 2016: notification * VENUE - The school (Nov 7-8) will take place at Universite Lyon 3. - The workshop 'Linear logic and philosophy' (Nov 8, afternoon) will take place at Universite Lyon 3. - The workshop 'Linear logic, mathematics and computer science' (Nov 9-10) will take place at ENS Lyon. Further travel and venue information will be made available on the web site. * REGISTRATION (FOR ONE OR SEVERAL EVENTS) - Deadline for registration: Sep 30, 2016 - No registration fees - To register, see the web page:https://ll2016.sciencesconf.org/ * STUDENT GRANTS A limited number of student grants for the autumn school are available. Grants can cover local expenses (accommodation and meals) and transport. Applications to attend the four days of LL2016 will be considered favourably. Applications should contain a short curriculum vitae (mentioning the degree prepared, e.g. Master's or PhD), a letter from a person supervising the student (e.g. director of the Master's programme, Master's thesis supervisor or PhD supervisor), and a short motivation letter by the applicant. Please follow the instructions that will be made available on the web page. The deadline for application for student grants is Sep 20, 2016. * SCIENTIFIC COMMITTEE - Michele Abrusci (Univ. Roma Tre, Italy) [chair] - Patrick Baillot (CNRS, LIP, ENS Lyon, France) - Thomas Ehrhard (CNRS, IRIF, Univ. Denis Diderot - Paris 7, France) - Martin Hofmann (Ludwig-Maximilians-Universität München, Deutschland) - Jean-Baptiste Joinet (IRPhil, Univ. Jean Moulin - Lyon 3, France) - Olivier Laurent (CNRS, LIP, ENS Lyon, France) - Mitsu Okada (Univ. Keiô, Tokyo, Japan) - Myriam Quatrini (I2M, Univ. Aix-Marseille, France) - Phil Scott (Univ. Ottawa, Canada) - Lorenzo Tortora de Falco (Univ. Roma Tre, Italy) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Website updated with new papers
by Townsend, Christopher 21 Jul '16

21 Jul '16

All - I have updated my website (www.christophertownsend.org - go to 'publications') with some recent papers: 1. A paper that provides a categorical condition for when a monad is a double exponential monad, 2. A paper that shows that double exponentiability is stable under the formation of categories of G-objects, 3. A paper that shows that principal bundles can be represented using stably Frobenius adjunctions. If anyone has any comments, thoughts or questions I'd be happy to hear them. Christopher _______________________________________________________________________ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Workshop on Dualities
by majordomo＠mlist.mta.ca 21 Jul '16

21 Jul '16

Dear colleagues, a Workshop on Duality Theory in Algebra, Logic and Topology will be held in Coimbra, from September 19 to 21, 2016. In case you want to participate please send a message to Andrea Montoli (montoli(a)mat.uc.pt) as soon as possible, and not later than September 2, 2016. Participants are warmly invited to present talks. Deadline for abstract submission (by email to montoli(a)mat.uc.pt) September 2. Updated information on the scientific program can be found at the workshop webpage: www.mat.uc.pt/~wdual/ The Organizers: Alfredo Costa Andrea Montoli Jorge Picado [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

2016 Autumn School on Computational Logic
by John Patrick Gallagher 12 Jul '16

12 Jul '16

The 2016 Autumn School on Computational Logic will be held on October 16-17, 2016, in New York, affiliated to the 32nd International Conference on Logic Programming (ICLP'16). Researchers and PhD students are encouraged to attend. Student scholarships are available (Deadline for application: July 24) Association for Logic Programming 2016 Autumn School on Computational Logic http://iclp16school.webs.upv.es/ October 16-17, New York, USA (Affiliated to ICLP'16) Researchers interested in research in computational logic are invited to attend the 2016 Autumn School. The 2-day school is suited for those who wish to learn advanced topics in computational logic and logic programming. It will consist of four half-day tutorials on the following topics: 1. Constraint Logic Programming Lecturer: Roman Bartak, Charles University, Czech Republic 2. Language processing through logic grammars and constraints Lecturer: Veronica Dahl, Simon Fraser University, Canada 3. Answer Set Programming: foundations and applications Lecturer: Torsten Schaub, University of Potsdam, Germany 4. Verification and probabilistic programming Lecturer: C.R. Ramakrishnan, SUNY Stony Brook, USA A number of scholarships for students that cover local expenses for the duration of the school are available. To apply for these scholarships, students should also register to the Doctoral Consortium and send the following information to German Vidal at gvidal(a)dsic.upv.es by July 24th: - A short vita of the applicant. - A letter of recommendation from applicant's faculty advisor. - A one paragraph statement outlining how the school will benefit the applicant. The letter from the advisor should also certify that the applicant is a full-time student. Organizers: John Gallagher, Roskilde University, Denmark German Vidal, Universitat Politecnica de Valencia, Spain [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0