October 2020 - Categories - categories.org.au

Re: "First" use of 'Category theory' to describe our field
by David Roberts 24 Feb '24

24 Feb '24

Dear Ross, no, that's pretty good! It's mildly surprising that it took ~20 years for the name to 'stick', but maybe less so given that the field grew slowly to start. Thanks, David David Roberts Webpage: https://ncatlab.org/nlab/show/David+Roberts Blog: https://thehighergeometer.wordpress.com On Thu, 11 Jul 2019 at 08:21, Ross Street <ross.street(a)mq.edu.au> wrote: > > Dear David > > From memory, the Pure Mathematics Honours (USyd) course that Max Kelly taught in 1965 > was called ``Category Theory''. It concentrated on different kinds of morphisms > and factorizations in a category, and finished with adjoint functors. > Also John Gray's (UIllinois) 1968-69 graduate course had that name. > > From Eilenberg I heard that each person using categories should have their own category of expertise. > I told this to John Gray who said that was fine; the time had come for that category to be Cat. > > I would suggest that the first category theorists to think of themselves as such were Eilenberg's students at Columbia. > However, Mac Lane was definitely a category theorist. > > This is probably not the verifiable stuff you were seeking. > > Ross > > > On 10 Jul 2019, at 10:01 PM, David Roberts <droberts.65537(a)gmail.com> wrote: > > Hi all, > > the (idle) question is: when did the phrase 'category theory' catch on > for the field? Clearly it didn't leap from either of the heads of > Eilenberg or Mac Lane full-grown, since they used the phrase 'General > theory of natural equivalences'. There are the old 'Reports of the > Midwest Category Seminar' lecture notes (the first in 1967), which > hints that 'category theory' wasn't quite the name in use. > > Even more interesting: who was the first "category theorist", by that name? > > Answers referring to verifiable sources would be best. > > Thoughts? > > David > > > > David Roberts > Webpage: https://ncatlab.org/nlab/show/David+Roberts > Blog: https://thehighergeometer.wordpress.com > [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

3 4

Assistant professor position in Theoretical Computer Science at the ILLC
by Benno van den Berg 29 Oct '20

29 Oct '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear all, The Institute for Logic, Language and Computation (part of the University of Amsterdam) will be hiring an assistant professor in Theoretical Computer Science. The official add is available here: https://ivi.uva.nl/shared/uva/en/vacancies/2020/10/20-647-assistant-profess… Best wishes, Benno [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

LMS lecture series on category theory and its applications
by Paoli, Simona (Dr.) 24 Oct '20

24 Oct '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear All, an LMS funded online lecture series, associated to the YaMCATS network, on category theory and its applications will take place from Wednesday 28 October 2020, once a week from 11:00-12:00 am for seven weeks. The invited speakers are Jean-Simon Lemay (University of Oxford) Fiona Torzewska (University of Leeds) The lecture series will be accessible to beginning PhD students. Further details can be found at https://www.icms.org.uk/V_CatTheory.php The meetings will be via Zoom via ICMS support. To access the Zoom link, please register at the above website. I hope to meet many of you online. Best wishes, Simona. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

toposes lectures by Olivia Caramello
by John Alexander Cruz Morales 23 Oct '20

23 Oct '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear category theorists community, I would like to advertise the online minicourse "the geometry of morphisms and equivalence of toposes" that Professor Olivia Caramello will be given at Universidad Nacional de Colombia on October 26, 27 and 30. More information here https://sites.google.com/view/toposeslectures/home Best, Alex [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Closed Grothendieck Construction
by Christian Williams 22 Oct '20

22 Oct '20

CAUTION: The Sender of this email is not from within Dalhousie. Hello, The equivalence of monoidal indexed categories and monoidal fibrations has been proved in "Monoidal Grothendieck Construction" by Joe Moeller and Christina Vasilakopoulou. (https://arxiv.org/abs/1809.00727) Has the analogous statement for closed structure been proved? It appears to be folklore, often assumed in categorical logic and elsewhere. It is likely that I simply haven't found the right reference. Any help is appreciated. Thank you, Christian Williams [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

ICALP 2021 Call for Workshops
by Ornela Dardha 21 Oct '20

21 Oct '20

CAUTION: The Sender of this email is not from within Dalhousie. ================================== ICALP 2021 Call for Workshops ================================== *** We are closely monitoring the development of the COVID-19 pandemic. If it is not viable to hold ICALP 2021 as a physical conference, we will run it virtually on the same dates. We will decide in January 2021 at the latest. If ICALP 2021 can go ahead as a physical conference, accepted authors may still present remotely. *** ICALP 2021 (http://easyconferences.eu/icalp2021/ <http://easyconferences.eu/icalp2021/>) will take place on the 13th - 16th of July 2021 in Glasgow, United Kingdom. The conference will be preceded by one day of workshops, held on July 12th. We invite proposals for workshops affiliated with ICALP 2021 on all topics covered by ICALP, as well as other areas of theoretical computer science. Proposals should be submitted no later than *** November 30th, 2020 *** by sending an email to the workshop selection committee (details at the end of the call). You should expect notification on the acceptance of your proposal by mid December 2020. A workshop proposal submission should consist of: - workshop's name and URL (if already available) - workshop's organisers together with their email addresses and web pages; - short description of the area covered by the workshop and the motivation behind it; - expected number of participants (if available, please include the data of previous years); - planned format of the event; - date preference (July 10th or 11th). As for the format, a standard option is a full one-day workshop consisting of invited talks by leading experts and of shorter contributed talks, either directly invited by the organisers or selected among submissions. Deviations from this standard are also warmly welcome, including a shorter or a longer time span than a full day, or other elements of the schedule like open problem sessions, discussion panels, or working sessions. If you plan to have invited speakers, please specify their expected number and, if possible, tentative names. If you plan a call for papers or for contributed talks followed by a selection procedure, the submission date should be scheduled after ICALP 2021 notification (April 28, 2021), while the notification should take place before the early registration deadline. In your submission please include details on the schedule, planned procedure of selecting papers and/or contributed talks. If you plan to have published proceedings of your workshop, please provide the name of the publisher. Please be advised that ICALP 2021 is not able to provide any financial support for publishing workshop proceedings. Important dates: Workshop Proposals Deadline: Monday November 30, 2020 Workshop Notification: Monday December 14, 2020 Workshops: Monday July 12, 2021 Conference: Tuesday July 13 - Friday July 16, 2021 Workshop selection committee: Ornela Dardha ornela.dardha(a)glasgow.ac.uk <mailto:ornela.dardha@glasgow.ac.uk> Gethin Norman gethin.norman(a)glasgow.ac.uk <mailto:gethin.norman@glasgow.ac.uk> [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

ICALP 2021 Call for Papers
by Simon Gay 20 Oct '20

20 Oct '20

CAUTION: The Sender of this email is not from within Dalhousie. ================================== ICALP 2021 - First Call for Papers ================================== http://easyconferences.eu/icalp2021/ The 48th International Colloquium on Automata, Languages, and Programming (ICALP) will take place in Glasgow, Scotland, on 13-16 July 2021. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series of workshops, which will take place on 12 July 2021. COVID-19: We will monitor the global travel situation and consider whether the conference will be physical, virtual or hybrid. If there is a physical component, remote participation for both speakers and attendees will also be an option. =============== Important dates ======================= Submission deadline: Friday 12 February 2021, 23:59 AoE Notification: Wednesday 28 April 2021 Camera-ready deadline: Friday 7 May 2021 Deadlines are firm; late submissions will not be considered. =========================== Submissions and Proceedings =========================== ICALP proceedings are published in the Leibniz International Proceedings in Informatics (LIPIcs) series. This is a series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge. Submission Guidelines --------------------- Authors are invited to submit an extended abstract of no more than 12 pages, excluding references presenting original research on the theory of computer science. All submissions must be formatted in the LIPIcs style https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/) and submitted via Easychair to the appropriate track of the conference. The use of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit. No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Technical details necessary for a proper scientific evaluation of a submission must be included in the 12-page submission or in a clearly labelled appendix, to be consulted at the discretion of program committee members. Authors are strongly encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC. Best Paper Awards ----------------- As in previous editions of ICALP, there will be best paper and best student paper awards for each track of the conference. In order to be eligible for a best student paper award, a paper should be authored only by students and should be marked as such upon submission. Topics ====== Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A: Algorithms, Complexity and Games ----------------------------------------- * Algorithmic and Complexity Aspects of Network Economics * Algorithmic Aspects of Networks and Networking * Algorithmic Aspects of Security and Privacy * Algorithms for Computational Biology * Algorithmic Game Theory and Mechanism Design * Approximation and Online Algorithms * Combinatorial Optimization * Combinatorics in Computer Science * Computational Complexity * Computational Geometry * Computational Learning Theory * Cryptography * Data Structures * Design and Analysis of Algorithms * Distributed and Mobile Computing * Foundations of Machine Learning * Graph Mining and Network Analysis * Parallel and External Memory Computing * Quantum Computing * Randomness in Computation * Theoretical Foundations of Algorithmic Fairness Track B: Automata, Logic, Semantics, and Theory of Programming ------------------------------------------------------------- * Algebraic and Categorical Models of Computation * Automata, Logic, and Games * Database Theory, Constraint Satisfaction Problems, and Finite Model Theory * Formal and Logical Aspects of Learning * Formal and Logical Aspects of Security and Privacy * Logic in Computer Science and Theorem Proving * Models of Computation: Complexity and Computability * Models of Concurrent, Distributed, and Mobile Systems * Models of Reactive, Hybrid, and Stochastic Systems * Principles and Semantics of Programming Languages * Program Analysis, Verification, and Synthesis * Type Systems and Typed Calculi =============================== ICALP 2021 Programme Committees =============================== Track A: Track A: Algorithms, Complexity and Games --------------------------------------------------- * Nikhil Bansal (CWI Amsterdam, Netherlands), Chair * Yossi Azar (Tel Aviv University, Israel) * Luca Becchetti (Sapienza University of Rome, Italy) * Aleksander Belov (University of Latvia, Latvia) * Eric Blais (University of Waterloo, Canada) * Niv Buchbinder (Tel Aviv University, Israel) * Kevin Buchin (TU Eindhoven, Netherlands) * Parinya Chalermsook (Aalto University, Finland) * Vincent Cohen-Addad (Google Research, Switzerland) * Shahar Dobzinski (Weizmann Institute, Israel) * Ran Duan (Tsinghua University, China) * Vida Dujmovic (University of Ottawa, Canada) * Yuval Filmus (Technion, Israel) * Samuel Fiorini (Universit?? libre de Bruxelles, Belgium) * Andreas Galanis (University of Oxford, UK) * Mika G????s (EPFL, Switzerland) * Inge Li G??rtz (TU Denmark, Denmark) * Heng Guo (University of Edinburgh, UK) * Prahladh Harsha (TIFR, Mumbai, India) * Sungjin Im (UC Merced, USA) * Stacey Jeffery (CWI Amsterdam, Netherlands) * Iordanis Kerenidis (CNRS - Universit?? Paris Diderot, France) * Michael Kapralov (EPFL, Switzerland) * Ravi Kumar (Google Research, USA) * Stefan Kratsch (HU Berlin, Germany) * Silvio Lattanzi (Google Research, Switzerland) * Shi Li (SUNY Buffalo, USA) * Konstantin Makarychev (Northwestern University, USA) * Marcin Mucha (University of Warsaw, Poland) * Wolfgang Mulzer (FU Berlin, Germany) * Jesper Nederlof (Utrecht University, Netherlands) * Aleksandar Nikolov (University of Toronto, Canada) * Neil Olver (LSE, UK) * Rasmus Pagh (IT University of Copenhagen, Denmark) * Merav Parter (Weizmann Institute, Israel) * Alexandros Psomas (Purdue University, USA) * Barna Saha (UC Berkeley, USA) * Thatchaphol Saranurak (University of Michigan, USA) * Rahul Savani (University of Liverpool, UK) * Mohit Singh (Georgia Tech, USA) * Sahil Singla (IAS/Princeton, USA) * Noah Stephens-Davidowitz (Cornell University, USA) * L??szl?? V??gh (LSE, UK) * Meirav Zehavi (Ben-Gurion University, Israel) Track B: Automata, Logic, Semantics, and Theory of Programming --------------------------------------------------------------- * James Worrell (University of Oxford, UK), Chair * Parosh Aziz Abdulla (Uppsala University, Sweden) * S. Akshay (Indian Institute of Technology Bombay, India) * Nathalie Bertrand (Inria Rennes, France) * Michael Blondin (Universit?? de Sherbrooke, Canada) * Olivier Carton (IRIF, Universit?? de Paris, France) * Corina C??rstea (University of Southampton, UK) * Dana Fisman (Ben Gurion University, Israel) * Paul Gastin (LSV, ENS Paris-Saclay, France) * Stefan G??ller (University of Kassel, Germany) * Radha Jagadeesan (DePaul University Chicago, USA) * Bakhadyr Khoussainov (University of Auckland, New Zealand) * Emanuel Kiero??ski (Wroc??aw University, Poland) * Bartek Klin (Warsaw University, Poland) * Barbara K??nig (University of Duisburg-Essen, Germany) * Laura Kovacs (Vienna University of Technology, Austria) * Ugo Dal Lago (University of Bologna and Inria, Italy) * Christoph L??ding (RWTH Aachen University, Germany) * Madhavan Mukund (Chennai Mathematical Institute, India) * Sebastian Maneth (University of Bremen, Germany) * Richard Mayr (University of Edinburgh, UK) * Annabelle McIver (Macquarie University, Australia) * Sophie Pinchinat (IRISA, Universit?? de Rennes, France) * Cristian Riveros (Pontificia Universidad Cat??lica de Chile, Chile) * Davide Sangiorgi (University of Bologna and Inria, Italy) * Lijun Zhang (Institute of Software, Chinese Academy of Sciences, China) =============================== ICALP 2021 Organizing Committee =============================== Simon Gay, Conference Chair Oana Andrei Ornela Dardha Jessica Enright David Manlove Kitty Meeks Alice Miller Gethin Norman Sofiat Olaosebikan Michele Sevegnani [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Seminar Talk on Category Theory and Secure Communication
by Harley D. Eades III 20 Oct '20

20 Oct '20

CAUTION: The Sender of this email is not from within Dalhousie. Hi, everyone. On Friday, Oct. 23, 2020 between 1pm and 2pm EDT, Dr. Peter Hines will be giving a presentation as part of the CS Colloquium Series at Augusta University. Presentation details can be found here: https://the-au-forml-lab.github.io/colloquium_talks/Hines.html Peter will be giving an introduction to category theory and his new results in applying categorical concepts to secure communication. These talks are open to the general public via Zoom. I'll also be living streaming it on Youtube. So if you are interested in attending the Zoom meeting please RSVP with me before the talk. Questions will be only taken from those on Zoom. If you care to watch via YouTube, please use the following link: https://youtu.be/Njw5Aad-gBQ I hope all of you, your family and friends are doing well! Very best, Harley [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Volume LXI-4 of the "Cahiers"
by Andrée Ehresmann 17 Oct '20

17 Oct '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear colleagues, We are pleased to inform you that Volume LXI-4 (4th quarter 2020) of the Cahiers is now freely downloadable from the website of the Cahiers: http://cahierstgdc.com both as a whole issue and as separate articles. Hoping this email finds you well despite the difficult global situation, Best regards, ???????????????????????????????????????????????? Andree Ehresmann, Marino Gran and Rene Guitart [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

CfP for TYPES 2020 postproceedings:
by Ugo de'Liguoro 10 Oct '20

10 Oct '20

CAUTION: The Sender of this email is not from within Dalhousie. Post-proceedings of the??TYPES 2020 ???????? 26th International Conference on Types for Proofs and Programs ?? ?? ?? ?? ?? ?? ?? ?? ?? ?? ?? ?? ?? Open call for papers TYPES is a major forum for the presentation of research on all aspects of type theory and its applications. TYPES 2020 wasn???t held in Turin as planned because of the COVID-19 outbreak. Nonetheless the significant number of submissions and registrations testified the interest for TYPES in our community, motivating us to plan publishing post-proceedings. The post-proceedings volume will be published in LIPIcs, Leibniz International Proceedings in Informatics <http://www.dagstuhl.de/en/publications/lipics>, an open-access series of conference proceedings. Submission to this post-proceedings volume is open to everyone, also to those who did not submit a contribution to the conference. We welcome high-quality descriptions of original work, as well as position papers, overview papers, and system descriptions. Submissions should be written in English, not overlapping with published or simultaneously submitted work to a journal or a conference with archival proceedings. We would like to invite all researchers that study and apply type systems to share their results. In particular, we welcome submissions on the following topics: * Foundations of type theory and constructive mathematics; * Homotopy type theory; * Applications of type theory; * Dependently typed programming; * Industrial uses of type theory technology; * Meta-theoretic studies of type systems; * Proof assistants and proof technology; * Automation in computer-assisted reasoning; * Links between type theory and functional programming; * Formalizing mathematics using type theory; * Type theory in linguistics. Important dates: * Paper submission: 19 October 31 October 2020 * Author notification: 18 January 2021 * Final version: ??15 February 2021 * Publication (presumably): end of March 2021 Details: * Papers have to be written in LaTex and adhere to the style requirements of LIPIcs <http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors>. * The recommended length of a paper is 12-15 pages, excluding front-page(s) (authors, affiliation, keywords, abstract, ...), bibliography and an appendix of max 5 pages. If you need more pages, please ask the editors. * Papers have to be submitted in pdf through EasyChair: https://easychair.org/conferences/?conf=types2020postproceed * Accepted papers will be charged of 60:00???, according to LIPIcs policy for publication costs (https://www.dagstuhl.de/en/publications/lipics/processing-charge/) * In case of questions, please contact one of the editors. Editors: * Ugo de???Liguoro (Universit?? di Torino) * Stefano Berardi (Universit?? di Torino) * Thorsten Altenkirch (University of Nottingham) -- Ugo de'Liguoro Associate Professor of Computer Science Dipartimento di Informatica Universit?? di Torino Corso Svizzera 185, 10149, Torino, Italy phone +39 011 6706766 - fax: +39 011 751603 [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0