August 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

Topos objects
by David Roberts 04 Sep '20

04 Sep '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear all, We know from work of Burroni, Lambek, Macdonald–Stone and Dubuc–Kelley that toposes are monadic over Graph and over Cat (the 1-category), and even (and I don't know to whom this is due) 2-monadic over Cat (the 2-category). I was wondering recently if there is a sensible notion of a *topos object* in a 2- or bicategory K. One would need suitable structure on K to support this, I presume finite limits (of the appropriate weakness) at minimum. I would imagine possibly also an involution akin to (-)^op, for the following reason. In the work of the above authors, the definition of topos is taken to be that of a cartesian closed category with subobject classifier. However, one could take the terminal object + pullbacks + power objects definition instead, provided one gave these as functors satisfying certain conditions. And here I'm not sure if one would take the covariant or contravariant power object functor. If the latter, we clearly need that involution. Alternatively, one could take the approach that the relation \in appearing in the definition of power object is a universal relation, and one could potentially think of Rel(E) as a suitable completion in Cat of the putative topos E, and abstract this. It seems a fair bit more overhead though, and probably more complicated than it's worth (modulo the fact this whole exercise might also be so!) My motivation for this, such as it is, is that if one could define topos objects in a suitable bicategory K, one could take, for instance, K to be fibrations over a suitable base, or categories and anafunctors or a combination of these. Maybe it's a sledgehammer approach, but it seems curious and maybe interesting in its own right. Best regards, 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 2

TYPES 2020 Post-proccedings CfP
by Ugo de Liguoro 31 Aug '20

31 Aug '20

CAUTION: The Sender of this email is not from within Dalhousie. ?? ?? ?? ?? ?? ?? ?? ?? ?? ?? ?? ?? ?? Open call for papers ?? ?? ?? ?? ?? ?? ???? Web: https://types2020.di.unito.it/cfp.html ?????????????????????????????????????????????????? Post-proceedings of the TYPES 2020 ???????? 26th International Conference on Types for Proofs and Programs 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 descriptionsof 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 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. Longer submissions will not be considered. * Papers have to be submitted in pdf through EasyChair: https://easychair.org/conferences/?conf=types2020postproceed * 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

Postdoctoral position in string diagrams
by Dan Ghica 29 Aug '20

29 Aug '20

CAUTION: The Sender of this email is not from within Dalhousie. 3 year postdoc at the University of Birmingham UK working on a String Diagrams research project in collaboration with Fabio Zanasi and Alexandra Silva (University College London). https://www.jobs.ac.uk/job/CBF820/research-fellow-in-theoretical-computer-s… For any questions please contact me. Dan Ghica [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Certified Programs and Proofs (CPP) 2021: Final Call for Papers
by Andrei Popescu 27 Aug '20

27 Aug '20

CAUTION: The Sender of this email is not from within Dalhousie. Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm for their work. CPP spans areas of computer science, mathematics, logic, and education. CPP 2021 (https://popl21.sigplan.org/home/CPP-2021) will be held on 18-19 January 2021 and will be co-located with POPL 2021. CPP 2021 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. NEWS * CPP 2021 will feature Distinguished Paper Awards. * CPP 2021 will take place on January 18-19, 2021 as a virtual or hybrid physical-virtual meeting. This means that the authors will be able to present their papers online. The POPL and CPP organizers are monitoring the COVID-19 situation, and in September/October they will make an announcement on whether there will also be a physical meeting in Copenhagen; but irrespective of that decision, the online paper presentation option will be guaranteed. * The submission deadline is one month earlier than usual. IMPORTANT DATES * Abstract Deadline: 16 September 2020 at 23:59 AoE (UTC-12h) * Paper Submission Deadline: 22 September 2020 at 23:59 AoE (UTC-12h) * Notification: 24 November 2020 * Camera Ready Deadline: 15 December 2020 * Conference: 18-19 January 2021 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. TOPICS OF INTEREST We welcome submissions in research areas related to formal certification of programs and proofs. The following is a non-exhaustive list of topics of interest to CPP: * certified or certifying programming, compilation, linking, OS kernels, runtime systems, security monitors, and hardware; * certified mathematical libraries and mathematical theorems; * proof assistants (e.g, ACL2, Agda, Coq, Dafny, F*, HOL4, HOL Light, Idris, Isabelle, Lean, Mizar, Nuprl, PVS, etc); * new languages and tools for certified programming; * program analysis, program verification, and program synthesis; * program logics, type systems, and semantics for certified code; * logics for certifying concurrent and distributed systems; * mechanized metatheory, formalized programming language semantics, and logical frameworks; * higher-order logics, dependent type theory, proof theory, logical systems, separation logics, and logics for security; * verification of correctness and security properties; * formally verified blockchains and smart contracts; * certificates for decision procedures, including linear algebra, polynomial systems, SAT, SMT, and unification in algebras of interest; * certificates for semi-decision procedures, including equality, first-order logic, and higher-order unification; * certificates for program termination; * formal models of computation; * mechanized (un)decidability and computational complexity proofs; * formally certified methods for induction and coinduction; * integration of interactive and automated provers; * logical foundations of proof assistants; * applications of AI and machine learning to formal certification; * user interfaces for proof assistants and theorem provers; * teaching mathematics and computer science with proof assistants. DISTINGUISHED PAPER AWARDS Around 10% of the accepted papers at CPP 2021 will be designated as Distinguished Papers. This award highlights papers that the CPP program committee thinks should be read by a broad audience due to their relevance, originality, significance and clarity. SUBMISSION GUIDELINES Prior to the paper submission deadline, the authors should upload their anonymized paper in PDF format through the HotCRP system at https://cpp2021.hotcrp.com The submissions must be written in English and provide sufficient detail to allow the program committee to assess the merits of the contribution. They must be formatted following the ACM SIGPLAN Proceedings format (http://www.sigplan.org/Resources/Author/) using the acmart style with the sigplan option, which provides a two-column style, using 10 point font for the main text, and a header for double blind review submission, i.e., \documentclass[sigplan,10pt,anonymous,review]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false} The submitted papers should not exceed 12 pages, including tables and figures, but excluding bibliography and clearly marked appendices. The papers should be self-contained without the appendices. Shorter papers are welcome and will be given equal consideration. Submissions not conforming to the requirements concerning format and maximum length may be rejected without further consideration. CPP 2021 will employ a lightweight double-blind reviewing process. To facilitate this, the submissions must adhere to two rules: (1) author names and institutions must be omitted, and (2) references to authors' own related work should be in the third person (e.g., not "We build on our previous work ..." but rather “We build on the work of ..."). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing it more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their papers as usual. For example, authors may post drafts of their papers on the web or give talks on their research ideas. POPL has answers to frequently asked questions addressing many common concerns: https://popl20.sigplan.org/track/POPL-2020-Research-Papers#Submission-and-R… We encourage the authors to provide any supplementary material that is required to support the claims made in the paper, such as proof scripts or experimental data. This material must be uploaded at submission time, as an archive, not via a URL. Two forms of supplementary material may be submitted: (1) Anonymous supplementary material is made available to the reviewers before they submit their first-draft reviews. (2) Non-anonymous supplementary material is made available to the reviewers after they have submitted their first-draft reviews and have learned the identity of the authors. Please use anonymous supplementary material whenever possible, so that it can be taken into account from the beginning of the reviewing process. The submitted papers must adhere to the SIGPLAN Republication Policy (https://www.sigplan.org/Resources/Policies/Republication/) and the ACM Policy on Plagiarism (https://www.acm.org/publications/policies/plagiarism) Concurrent submissions to other conferences, journals, workshops with proceedings, or similar forums of publication are not allowed. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper is expected to present it at the (totally or partly virtual) conference. PUBLICATION, COPYRIGHT AND OPEN ACCESS The limit for the camera-ready version is 14 pages, excluding the bibliography (so 2 pages extra compared with the submission). The CPP proceedings will be published by the ACM, and authors of accepted papers will be required to choose one of the following publication options: (1) Author retains copyright of the work and grants ACM a non-exclusive permission-to-publish license and, optionally, licenses the work under a Creative Commons license. (2) Author retains copyright of the work and grants ACM an exclusive permission-to-publish license. (3) Author transfers copyright of the work to ACM. For authors who can afford it, we recommend option 1, which will make the paper Gold Open Access, and also encourage such authors to license their work under the CC-BY license. ACM will charge you an article processing fee for this option (currently, US$700), which you have to pay directly with the ACM. For everyone else, we recommend option (2), which is free and allows you to achieve Green Open Access, by uploading a preprint of your paper to a repository that guarantees permanent archival such as arXiv (https://arxiv.org) or HAL (https://hal.archives-ouvertes.fr) This is anyway a good idea for timely dissemination even if you chose option (1). Ensuring timely dissemination is particularly important for this edition, since, because of the very tight schedule, the official proceedings might not be available in time for CPP. The official CPP 2021 proceedings will also be available via SIGPLAN OpenTOC (http://www.sigplan.org/OpenTOC/#cpp) For ACM's take on this, see their Copyright Policy (http://www.acm.org/publications/policies/copyright-policy) and Author Rights (http://authors.acm.org/main.html) PROGRAM COMMITTEE Cătălin Hriţcu, MPI-SP, Germany (co-chair) Andrei Popescu, University of Sheffield, UK (co-chair) Reynald Affeldt, National Institute of Advanced Industrial Science and Technology (AIST), Japan June Andronick, CSIRO's Data61 and UNSW, Australia Arthur Azevedo de Amorim, Carnegie Mellon University, USA Joachim Breitner, DFINITY Foundation, Germany Jesper Cockx, TU Delft, Netherlands Cyril Cohen, Université Côte d’Azur, Inria, France Nils Anders Danielsson, University of Gothenburg / Chalmers University of Technology, Sweden Brijesh Dongol, University of Surrey, UK Floris van Doorn, University of Pittsburgh, USA Yannick Forster, Saarland University, Germany Shilpi Goel, Centaur Technology, Inc., USA Chung-Kil Hur, Seoul National University, South Korea Moa Johansson, Chalmers University of Technology, Sweden Ekaterina Komendantskaya, Heriot-Watt University, UK Angeliki Koutsoukou-Argyraki, University of Cambridge, UK Robert Y. Lewis, Vrije Universiteit Amsterdam, Netherlands Hongjin Liang, Nanjing University, China Andreas Lochbihler, Digital Asset GmbH, Switzerland Petar Maksimović, Imperial College London, UK William Mansky, University of Illinois at Chicago, USA Anders Mörtberg, Stockholm University, Sweden Sam Owre, SRI International, USA Karl Palmskog, KTH Royal Institute of Technology, Sweden Johannes Åman Pohjola, CSIRO's Data61 / University of New South Wales, Australia Damien Pous, CNRS, ENS Lyon, France Tahina Ramananandro, Microsoft Research, USA Ilya Sergey, Yale-NUS College and National University of Singapore, Singapore Natarajan Shankar, SRI International, USA Kathrin Stark, Princeton University, USA René Thiemann, University of Innsbruck, Austria Amin Timany, Aarhus University, Denmark Josef Urban, Czech Technical University in Prague, Czech Republic Christoph Weidenbach, MPI-INF, Germany Freek Wiedijk, Radboud University Nijmegen, Netherlands Yannick Zakowski, University of Pennsylvania, USA CONTACT For any questions please contact the two PC chairs: Catalin Hritcu <catalin.hritcu(a)gmail.com>, Andrei Popescu <andrei.h.popescu(a)gmail.com> [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

A book
by Marco Grandis 27 Aug '20

27 Aug '20

CAUTION: The Sender of this email is not from within Dalhousie. This book has been published in Aug 2020 (although the formal publishing date is 2021): M. Grandis An Elementary Overview of Mathematical Structures. Algebra, Topology and Categories World Scientific Publishing Co., 2021. - Info at WS: https://www.worldscientific.com/worldscibooks/10.1142/11828 - Downloadable Introduction https://www.worldscientific.com/doi/pdf/10.1142/9789811220326_0001 ________ PREFACE Since the last century, a large part of Mathematics is concerned with the study of mathematical structures, from groups to fields and vector spaces, from lattices to Boolean algebras, from metric spaces to topological spaces, from topological groups to Banach spaces. More recently, these structured sets and their transformations have been assembled in higher structures, called categories. We want to give a structural overview of these topics, where the basic facts of the different theories are unified through the 'universal properties' that they satisfy, and their particularities stand out, perhaps even more. This book can be used as a textbook for Undergraduate Studies and for self-study. It can provide students of Mathematics with a unified perspective of subjects which are often kept apart. It is also addressed to students and researchers of disciplines having strong interactions with Mathematics, like Physics and Chemistry, Statistics, Computer Science, Engineering. ________ Regards, MG [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

websites for CT2014 and PSSL100 back up
by Julia Goedecke 26 Aug '20

26 Aug '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear all, some of you have asked me where the websites for CT2014 and PSSL100 had gone. They are now "back", you can find them on http://www.julia-goedecke.de/conference.html The reason they disappeared was my move from Cambridge to Leicester, and the reason I couldn't sort it out sooner was health-related. But both websites and health now resolved :-) Best wishes, Julia -- Dr Julia Goedecke Teaching Fellow in Mathematics University of Leicester julia.goedecke(a)leicester.ac.uk 0116 252 5352 [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

operad pop-up conference, august 11. second announcement
by Philip Hackney 04 Aug '20

04 Aug '20

CAUTION: The Sender of this email is not from within Dalhousie. This is a second announcement for the following conference. Registration is now open at operads.com. OPERAD POP-UP What: 24-Hour conference on operads, their applications, and related topics When: 11 August, 2020 (Tuesday). 00:00 UTC - 23:59 UTC. Where: Zoom (register for details) and twitch.tv/operads More information / registration: https://operads.com Speakers: Luciana Basualdo Bonatto (University of Oxford) Nathaniel Bottman (University of Southern California) Anna Cepek (IBS Center for Geometry and Physics) Michael Ching (Amherst College) Richard Garner (Macquarie University) Syunji Moriya (Osaka Prefecture University) Joost Nuiten (Université de Montpellier) Dan Petersen (Stockholm university) Sophie Raynor (Macquarie University) María Ronco (Universidad de Talca) Dmitry Vaintrob (University of California, Berkeley) Bruno Vallette (Sorbonne Université Paris Nord) Organizers: Philip Hackney Geoffroy Horel Marcy Robertson Sponsor: Mathematical Research Institute MATRIX https://www.matrix-inst.org.au [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

CMCS 2020: Call for Participation
by Henning Basold 03 Aug '20

03 Aug '20

CAUTION: The Sender of this email is not from within Dalhousie. Call for Participation The 15th International Workshop on Coalgebraic Methods in Computer Science (CMCS'20) ONLINE, Sept-Oct 2020 https://coalg.org/cmcs20 Update: CMCS 2020 will be held virtually, as a series of approximately three hour sessions spread across five weeks, according to the following tentative schedule: – 21/09/2020, 15:00 – 18:00 CEST – 28/09/2020, 10:00 – 13:00 CEST – 05/10/2020, 15:00 – 18:00 CEST – 12/10/2020, 10:00 – 13:00 CEST – 19/10/2020, 10:00 – 13:00 CEST The exact schedule will be determined and announced in August. Registration will be free (details will follow), but please subscribe to the coalgebra mailing list for updates: https://framalistes.org/sympa/subscribe/coalgebra Objectives and scope -------------------- Established in 1998, the CMCS workshops aim to bring together researchers with a common interest in the theory of coalgebras, their logics, and their applications. As the workshop series strives to maintain breadth in its scope, areas of interest include neighbouring fields as well. Topics of interest include, but are not limited to, the following: - the theory of coalgebras (including set theoretic and categorical approaches); - coalgebras as computational and semantical models (for programming languages, dynamical systems, term rewriting, etc.); - coalgebras in (functional, object-oriented, concurrent, and constraint) programming; - coalgebraic data types, type systems and behavioural typing; - coinductive definition and proof principles for coalgebras (including "up-to" techniques); - coalgebras and algebras; - coalgebras and (modal) logic; - coalgebraic specification and verification; - coalgebra and control theory (notably of discrete event and hybrid systems); - coalgebra in quantum computing; - coalgebra and game theory; - tools exploiting coalgebraic techniques. Venue and event --------------- Online, see above. Keynote Speaker --------------- Yde Venema (ILLC, University of Amsterdam, The Netherlands) Invited Speakers ---------------- Nathanaël Fijalkow (CNRS, LaBRI, University of Bordeaux, France) Koko Muroya (RIMS, Kyoto University, Japan) Invited Tutorial Speakers ------------------------- There will be a special session on probabilistic couplings, with invited tutorials by: Marco Gaboardi (University at Buffalo, US) Justin Hsu (University of Wisconsin-Madison, US) Programme committee ------------------- Henning Basold, Leiden University, The Netherlands Nick Bezhanishvili, University of Amsterdam, The Netherlands Corina Cirstea, University of Southampton, United Kingdom Mai Gehrke, CNRS and Université Côte d'Azur, France Helle Hvid Hansen, Delft University of Technology, The Netherlands Shin-Ya Katsumata, National Institute of Informatics, Japan Bartek Klin, Warsaw University, Poland Ekaterina Komendantskaya, Heriot-Watt University, United Kingdom Barbara König, University of Duisburg-Essen, Germany Dexter Kozen, Cornell University, USA Clemens Kupke, University of Strathclyde, United Kingdom Alexander Kurz, Chapman University, USA Daniela Petrisan, Université de Paris, IRIF, France Andrei Popescu, Middlesex University London, United Kingdom Damien Pous, CNRS and ENS Lyon, France Jurriaan Rot, UCL and Radboud University, The Netherlands Davide Sangiorgi, University of Bologna, Italy Ana Sokolova, University of Salzburg, Austria David Sprunger, National Institute of Informatics, Japan Henning Urbat, University of Erlangen-Nuremberg, Germany Fabio Zanasi, University College London, United Kingdom Publicity chair --------------- Henning Basold, Leiden University, The Netherlands PC co-chairs -------------- Daniela Petrisan, Université de Paris, IRIF, France Jurriaan Rot, UCL and Radboud University, The Netherlands Steering committee ------------------ Filippo Bonchi, University of Pisa, Italy Marcello Bonsangue, Leiden University, The Netherlands Corina Cirstea, University of Southampton, United Kingdom Ichiro Hasuo, National Institute of Informatics, Japan Bart Jacobs, Radboud University Nijmegen, The Netherlands Bartek Klin, University of Warsaw, Poland Alexander Kurz, Chapman University, USA Marina Lenisa, University of Udine, Italy Stefan Milius (chair), University of Erlangen-Nuremberg, Germany Larry Moss, Indiana University, USA Dirk Pattinson, Australian National University, Australia Lutz Schröder, University of Erlangen-Nuremberg, Germany Alexandra Silva, University College London, United Kingdom Accepted papers --------------------- For a list of accepted papers and short contributions, see https://www.coalg.org/cmcs20/accepted-papers/ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0