May 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

Categories everywhere
by Michael Barr, Prof. 05 Jun '20

05 Jun '20

CAUTION: The Sender of this email is not from within Dalhousie. I think it interesting to know that categories are now apparently used in Ramsey theory, one of the last places I would have expected it: https://arxiv.org/abs/1506.01221 Michael [1506.01221] Categorical Constructions and the Ramsey Property<https://arxiv.org/abs/1506.01221> It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the Ramsey property and the dual Ramsey property in the context of categories of finite structures and investigate the invariance of these properties under some ... arxiv.org [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

2 1

Old question of McLarty on triposes
by David Roberts 27 May '20

27 May '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear all, way back in 1998 Colin McLarty raised the following question: >Can the adjoint lifting theorem for triposes (from Andy Pitts's dissertation) >be gracefully transported to regular categories (presumably >with some supplemental conditions)? If so, the theory of >realizability toposes could be radically simplified, >among other things (see Japp van Oosten's dissertation). has there been any progress on or toward this in the last 22 years? Best regards, 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/ ]

1 0

Several four-year PhD grants at the Faculty of Computer Science of the Free University of Bozen-Bolzano in Italy
by Enrico Franconi 27 May '20

27 May '20

CAUTION: The Sender of this email is not from within Dalhousie. 18 four-year grants are offered by the Faculty of Computer Science of the Free University of Bozen-Bolzano in Italy for its PhD programme. Each grant amounts to 68,000 € (i.e., 17,000 euro per year, net after taxes); for research visits abroad the grant increases up to 50%. Additional substantial extra funding (including a personal budget of 2,500 euro per year) is available for participation to international conferences, schools, workshops, research visits. Some of the 18 PhD grants are supported by FBK, CNR, University of Ume?, and by software companies, and interested candidates might carry out their PhD research in collaboration with these external partners. The language of the PhD programme is English. The deadline for applications will be on the 13th of July, 2020. For more info, the call, and applications look at: www.unibz.it/en/faculties/computer-science/phd-computer-science The university is located in one of the most fascinating European regions, the Dolomites. This young university has already established itself as an important research institution, both in Italy and abroad. According to the Times Higher Education World University Rankings 2019, the university is the ninth world’s best small university and it is the second best young Italian University, and its Faculty of Computer Science is ranked among the 150 best Computer Science departments worldwide (in absolute terms) and it is the 21st best Computer Science department worldwide for scientific citations. According to the same ranking, the Faculty of Computer Science of the Free University of Bozen-Bolzano is the third best Italian computer science department, it is the best for international outlook Italian computer science department, and it is the best for citations Italian computer science department. At this time of global uncertainty, you may be wondering whether your application to the PhD programme will be affected. The Free University of Bozen-Bolzano is in constant contact with the competent authorities to monitor the development of the COVID-19 emergency to provide the adequate preventive actions for the university community. It is possible that by November 2020, when the PhD programme starts, some restrictive measures may be in place: the university will support new students to go through the initial process as smoothly as possible. The KRDB Research Centre for Knowledge and Data of the faculty is widely recognised as one of the internationally leading groups in Artificial Intelligence Knowledge Representation research, with a synergy between foundational and application-oriented research. Among the various available PhD topics (fully described in the call), the KRDB Research Centre is looking for PhD students interested in: 1 Logic-based languages for knowledge representation; 2 Intelligent data access and integration; 3 Semantic technologies; 4 Conceptual and cognitive modelling; 5 Data-aware process modelling, verification, and synthesis; 6 Business process monitoring, mining, and conformance; 7 Temporal aspects of data and knowledge; 8 Extending database technologies; 9 Visual and verbal paradigms for information exploration; 10 Reasoning with uncertain and imprecise knowledge. To get in contact with the KRDB Research Centre and discuss about the opportunities of this call contact prof. Alessandro Artale at artale(a)inf.unibz.it [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Postdoc in Proof Theory - University of Birmingham, UK.
by A.Das＠bham.ac.uk 26 May '20

26 May '20

CAUTION: The Sender of this email is not from within Dalhousie. Research Fellow in Proof Theory - School of Computer Science, University of Birmingham, UK. The School of Computer Science at the University of Birmingham is seeking to appoint up to 2 Research Fellows (postdocs) in Proof Theory, for a duration of 2 years (with possibility of extension). The theory group at the University of Birmingham is one of the leading groups in logical foundations of computer science, with expertise not only in Proof Theory but also related areas such as Type Theory, Category Theory and Mathematical Logic: <https://www.cs.bham.ac.uk/research/groupings/theory/> These positions are funded by a UKRI Future Leaders Fellowship "StrIP: Structure vs Invariants in Proofs", led by Dr Anupam Das. The project aims to develop the theory of 'cyclic proofs' and their connections to automata theory. The principal responsibility of the fellow(s) will be to conduct research, both collaboratively with Dr Das and other researchers at Birmingham, and independently. The fellow(s) will also be supported in career development and encouraged to pursue independent opportunities. Qualifications and expertise You will have (or be close to completing) a PhD in Logic (computer science, mathematics or philosophy), or equivalent qualifications. You will have an excellent research record, with expertise in some of the following areas: * Proof theory (in particular, deep inference or cyclic proofs). * Automata theory (in particular, infinite word and tree automata). * Mathematical logic (in particular, fragments of arithmetic or set theory). Application Informal inquiries prior to application are encouraged and should be directed to Dr Anupam Das <a.das(a)bham.ac.uk>. You may find further details on the positions and instructions for applying here: <https://www.jobs.ac.uk/job/CAD990/research-fellow-in-proof-theory> Practical information Starting salary range: £30,942 - £40,322 (potentially progressing to £42,792). Application deadline: 24 June 2020. Starting date: As soon as possible, but ideally no later than October 2020. Duration: 2 years (with possibility of extension) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

CfP: ICTAC 2020
by radu.muschevici＠nottingham.edu.my 22 May '20

22 May '20

CAUTION: The Sender of this email is not from within Dalhousie. Call for papers 17th International Colloquium on Theoretical Aspects of Computing (ICTAC 2020). https://ictac2020.github.io/ ---------------------------------------------------------------------- Concerning COVID-19 The Program Chairs and the Steering Committee of ICTAC 2020 are closely following the situation regarding COVID-19 and will take appropriate measures if and when needed, following the recommendations of relevant national and international bodies, such as the World Health Organization. These measures will be adapted to the actual situation and may e.g., include the possibility of remote paper presentations or a full electronic implementation of the conference. ---------------------------------------------------------------------- ****** ABOUT ICTAC 2020 ****** We are pleased to invite you to submit papers for the 17th International Colloquium on Theoretical Aspects of Computing (ICTAC 2020), which will take place in Macao S.A.R., China on 30 November- 4 December, 2020. The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas, and solutions for their problems in theoretical aspects of computing. ICTAC also aims to promote research cooperation between developing and industrial countries. The proceedings will be published as a volume of Springer's LNCS series. ****** IMPORTANT DATES ****** Abstract submission: Monday, 22 June 2020 (AoE) Paper submission: Friday, 26 June 2020 (AoE) Notification: Monday, 14 September 2020 (AoE) Camera-ready: Wednesday, 30 September 2020 (AoE) Main Conference: 30 November - 4 December 2020 ****** OBJECTIVES and SCOPE ****** Established in 2004 by the International Institute for Software Technology of the United Nations University (UNU-IIST), the ICTAC conference series aims at bringing together researchers and practitioners from academia, industry and government to present research and exchange ideas and experience addressing challenges in both theoretical aspects of computing and the exploitation of theory through methods and tools for system development. ICTAC also aims to promote research cooperation between developing and industrial countries. The topics of the conference include, but are not limited to: - Languages and automata - Semantics of programming languages - Logic in computer science - Lambda calculus, type theory and category theory - Domain-specific languages - Theories of concurrency and mobility - Theories of distributed, grid and cloud computing - Models of objects and components - Coordination models Models of software architectures - Timed, hybrid, embedded and cyber-physical systems - Static analysis - Software verification - Software testing - Program generation and transformation - Model checking and automated theorem proving - Interactive theorem proving - Verified software, formalized programming theory ****** SUBMISSION OF CONTRIBUTIONS ****** We solicit the following types of papers: - Regular papers, with original research contributions; - Short papers, with original work in progress or with proposals of new ideas and emerging challenges; - Tool papers, on tools that support formal techniques for software modelling, system design, and verification. Submissions must adhere to the LNCS format and must not exceed 18 pages (excluding bibliography of maximum 2 pages). Short- and tool papers should not exceed 10 pages. Submissions must not have been published or be under consideration for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. All contributions to ICTAC 2020 have to be submitted electronically in PDF format via Easy Chair (https://easychair.org/conferences/?conf=3Dictac2020) All accepted papers must be presented at the conference. Their authors must be prepared to sign a copyright transfer statement. At least one author of each accepted paper must register to the conference by the early registration date, and present the paper. The ICTAC committee will evaluate and select the best paper award winner. Authors should consult Springer's authors' guidelines (ftp://ftp.springernature.com/cs-proceeding/svproc/guidelines/Springer_Guid= elines_for_Authors_of_Proceedings.pdf) and use their proceedings templates, either for LaTeX (ftp://ftp.springernature.com/cs-proceeding/llncs/llncs2e.zip) or for Word (ftp://ftp.springernature.com/cs-proceeding/llncs/word/splnproc1703.zi= p), for the preparation of their papers. Springer encourages authors to include their ORCIDs (https://goo.gl/hbsa4D) in their papers. In addition, the corresponding author of each paper, acting on behalf of all of the authors of that paper, must complete and sign a Consent-to-Publish form. The corresponding author signing the copyright form should match the corresponding author marked on the paper. Once the files have been sent to Springer, changes relating to the authorship of the papers cannot be made. ****** Organization ****** *** Program Committee Chairs *** Violet Ka I Pun (Western Norway University of Applied Sciences, NO) Adenilso da Silva Sim=C3=A3o (University of S=C3=A3o Paulo, BR) Volker Stolz (Western Norway University of Applied Sciences, NO) *** Workshop/Tutorial Chairs *** Antonio Cerone (Nazarbayev University, KZ) Einar Broch Johnsen (University of Oslo, NO) *** Local Organisation Chairs *** Xiaoshan Li (University of Macau, MO) Ignacio Marcovecchio (UNU-CS, MO) Joseph Chi Man Pun (University of Macau, MO) *** Publicity Chairs *** Zhiming Liu (Southwest University, CN) Radu Muschevici (University of Nottingham, MY) *** Program Committee *** Erika =C3=81brah=C3=A1m (RWTH Aachen University, DE) Kamel Barkaoui (CNAM, FR) Fr=C3=A9d=C3=A9ric Blanqui (INRIA, FR) Simon Bliudze (INRIA, FR) Benedikt Bollig (LSV, ENS Cachan, CNRS, FR) Eduardo Bonelli (Stevens Institute of Technology, US) Ana Cavalcanti (University of York, UK) Antonio Cerone (Nazarbayev University, KZ) Yu-Fang Chen (National Taiwan University, TW) Uli Fahrenberg (LIX, FR) Bernd Fischer (Stellenbosch University, ZA) Paola Giannini (Universit=C3 del Piemonte Orientale, Alessandria, IT) Edward Hermann Haeusler (Pontif=C3=ADcia Universidade Cat=C3=B3lica do Rio = de Janeiro, BR) Thomas Troels Hildebrandt (University of Copenhagen, DK) Ross Horne (University of Luxembourg, LU) Reiner H=C3=A4hnle (Technische Universit=C3=A4t Darmstadt, DE) Eun-Young Kang (University of Southern Denmark, DK) Jan K=C5(tm)et=C3=ADnsk=C3=BD (Technische Universit=C3=A4t M=C3=BCnchen, DE= ) Lars Michael Kristensen (Western Norway University of Applied Sciences, NO) Martin Leucker (University of L=C3=BCbeck, DE) Michael Lienhardt (ONERA, FR; University of Turin, IT) Dominique M=C3=A9ry (LORIA, FR) Mohammad Reza Mousavi (University of Leicester, UK) Maciej Pir=C3=B3g (Wroclaw University, PL) Sanjiva Prasad (IIT Delhi, IN) Riadh Robbana (INSAT, TN) Kristin Yvonne Rozier (Iowa State University, US) Augusto Sampaio (Universidade Federal de Pernambuco, BR) C=C3=A9sar S=C3=A1nchez (IMDEA Software Institute, ES) Marjan Sirjani (M=C3=A4lardalen University, SE; Reykjavik University, IS) Georg Struth (University of Sheffield, UK) Jing Sun (University of Auckland, NZ) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Workshop on Logic Programming: Trends, Extensions, Applications, 28-29 May 2020
by Henning Basold 22 May '20

22 May '20

CAUTION: The Sender of this email is not from within Dalhousie. We invite participants to the on-line workshop TEASE-LP on Trends, Extensions, Applications and Semantics of Logic Programming Logic programming is a framework for expressing programs, propositions and relations as Horn clause theories, and for automatic inference in these theories. Horn clause theories are famous for their well-understood declarative semantics, in which models of logic programs are given inductively or coinductively. At the same time, Horn clauses give rise to efficient inference procedures, usually involving resolution. Logic programming found applications in type inference, verification, and AI. While logic programming was originally conceived for describing simple propositional facts, it was extended to account for much more complex theories. This includes first-order theories, higher-order theories, inductive and coinductive data, and stochastic/probabilistic theories. The aim of this workshop is to bring together researchers that work on extensions of logic programming and inference methods, and to foster an exchange of methods and applications that have emerged in different communities. Keynote talk: Dale Miller. Structural Proof-Theory and Logic Programming Invited tutorial: Uli Sattler. Description Logics and Ontology Languages - an introduction and overview In light of COVID-19, we organise TEASE-LP as a virtual workshop and online-only event. To achieve broad participation, we use three different mediums: Discussion Forum, Pre-recorded lightning talks, Live sessions with invited and contributed live talks. Further details can be found here: https://www.coalg.org/tease-lp/workshop-schedule/. Registration is free, but we require all participants to sign up at https://teaselp.flarum.cloud/ For any further queries, please contact the organisers: Henning Basold <h.basold(a)liacs.leidenuniv.nl> Katya Komendantskaya <ek19(a)hw.ac.uk> [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Update: Workshop on ∞-categories and their applications
by Bruno Stonek 21 May '20

21 May '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear colleagues, Given the current pandemic situation, we regret to inform that the workshop ∞-categories and their applications to be held at the Max Planck Institute for Mathematics, Bonn, Germany on August 17-21, 2020, has had to change form. Previously, it was scheduled to consist of four minicourses, eight plenary talks, and several contributed talks. We have decided to cancel the plenary and contributed talks. The minicourses will be maintained at the same dates, but in an online form. The minicourses are: Minicourse 1: Models for homotopical higher categories, by Bergner, Julie (University of Virginia) Minicourse 2: Introduction to ∞-operads by Haugseng, Rune (NTNU) Minicourse 3: Higher Categories and Algebraic K-Theory by Nikolaus, Thomas (WWU Münster) Minicourse 4: Exodromy and compactifications of arithmetic schemes by Barwick, Clark (University of Edinburgh) All interested in attending should register via the website https://www.mpim-bonn.mpg.de/node/10159 Technical details and the schedule will appear in the website when we are closer to the dates. Best, Hongyi Chu and Bruno Stonek [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

MFPS 2020 -- Call for Participation
by Vladimir Zamdzhiev 21 May '20

21 May '20

CAUTION: The Sender of this email is not from within Dalhousie. 36th International Conference on Mathematical Foundations of Programming Semantics ??? MFPS 2020 June 2 ??? 6, 2020 To be jointly held with QPL'20. https://www.monoidal.net/paris2020/mfps/ # About MFPS conferences are dedicated to the areas of mathematics, logic, and computer science that are related to models of computation in general, and to semantics of programming languages in particular. This is a forum where researchers in mathematics and computer science can meet and exchange ideas. The participation of researchers in neighbouring areas is strongly encouraged. Topics include, but are not limited to, the following: concurrent qualitative and quantitative distributed systems; process calculi; probabilistic systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; programming-language theory; quantum computation; security; topological models; logic; type systems; type theory. We also welcome contributions that address applications of semantics to novel areas such as complex systems, markets, and networks, for example. # Online Event MFPS 2020 will be held online, jointly with the 17th International Conference on Quantum and Physics Logic (QPL) 2020. We will hold a live meeting using video and online discussion platforms. Registration is free but mandatory. Please follow this link: https://forms.gle/Bozgh92BoLUQxVaD7 to register. # Invited Speakers and Organizers of Special Sessions As in previous years, MFPS will have several invited speakers and special session highlighting areas within programming languages semantics. We are pleased to announce the following invited speakers and organizers of special sessions: * Gilles Barthe (IMDEA) - plenary speaker * Christine Tasson (Paris VII) - plenary speaker Special session on Probabilistic programming languages * Dexter Kozen (Cornell) - plenary speaker * Fredrik Dahlqvist (London) * Ohad Kammar (Edinburgh) * Radu Mardare (Strathclyde) * Valeria Vignudelli (Lyon) Special session on Quantum programming - joint with QPL * Alexandre Miquel (Montevideo) - plenary speaker * Pierre Clairambault (Lyon) * Claudia Faggian (Paris VII) * Vladimir Zamdzhiev (LORIA, Nancy) # Accepted Papers * Gordon Plotkin. A complete axiomatisation of partial differentiation. * Alejandro Aguirre and Shin-ya Kastumata. Weakest preconditions in ?? fibrations * Abbas Edalat, Amin Farjudian, Mina Mohammadian and Dirk Pattinson. ?? Domain Theoretic Second-Order Euler???s Method for Solving Initial Value ?? Problems. * Tao Gu, Alexandra Silva and Fabio Zanasi. Hennessy-Milner Results for ?? Probabilistic PDL. * Linan Chen, Florence Clerc and Prakash Panangaden. Towards a ?? classification of behavioural equivalences in continuous-time Markov ?? processes. * Niels Voorneveld. Combining Algebraic Effect Descriptions using the ?? Tensor of Complete Lattices. * Tarmo Uustalu, Niccol?? Veltri and Noam Zeilberger. Eilenberg-Kelly ?? reloaded. * Paolo Perrone and Tobias Fritz. Monads, partial evaluations, and ?? rewriting. * Thomas Paine. A pebbling comonad for finite rank and variable logic, ?? and an application to the equirank-variable homomorphism preservation ?? theorem. * Ernest Manes. Continuous Monads. * Roy Crole, Samuele Buro and Isabella Mastroeni. Equational Logic and ?? Categorical Semantics for Multi-Languages. * Nicolas Blanco and Noam Zeilberger. Bifibrations of Polycategories and ?? Classical Linear Logic. * Ryan Kavanagh. Some Properties of Parametrized Fixed Points on ?? O-Categories. # Program All talks will be available on YouTube and there will be a forum organised on Slack where participants can discuss the talks. A schedule will be posted soon on the conference website. See https://www.monoidal.net/paris2020/mfps/ for more information. # Program Committee Danel Ahman (University of Ljubljana) Andrej Bauer (University of Ljubljana) Stephen Brookes (Carnegie Mellon University) Ugo Dal Lago (University of Bologna & INRIA Sophia Antipolis) Dan Ghica (Huawei Research and University of Birmingham) Pierre Hyvernat (Universit?? Savoie Mont Blanc) Mauro Jaskelioff (Universidad Nacional de Rosario) Patricia Johann (Appalachian State University) - Chair Achim Jung (University of Birmingham) Barbara K??nig (Universitaet Duisburg-Essen) Dexter Kozen (Cornell University) Catherine Meadows (NRL) Mike Mislove (Tulane University) Joel Ouaknine (MPI-SWS) Prakash Panangaden (McGill University) Dirk Pattinson (Australian National University) Maciej Pirog (University of Wroclaw) Peter Selinger (Dalhousie University) Alexandra Silva (University College London) Kristina Sojakova (Cornell University) Ana Sokolova (University of Salzburg) Sam Staton (University of Oxford) Tarmo Uustalu (Reykjavik University) # Organising Committee Pablo Arrighi (AMU & INRIA) Aleks Kissinger (University of Oxford) Shane Mansfield (Sorbonne Universit??) Beno??t Valiron (U. Paris Saclay) John van de Wetering (Radboud University Nijmegen ??? Wiz Team) James Hefford (University of Oxford ??? Wiz Team) Matthew Wilson (University of Oxford ??? Wiz Team) Vladimir Zamdzhiev (Loria, Nancy) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

PhD studentships
by Martin Escardo 14 May '20

14 May '20

CAUTION: The Sender of this email is not from within Dalhousie. We have funding for PhD studentships in mathematics and computation in our Theoretical Computer Science group https://www.cs.bham.ac.uk/research/groupings/theory/ If you are interested, please approach an academic from the above web page, with Cc: to Martin Escardo, briefly explaining your research interests and academic qualifications. After you approach us we will give you further information and instructions. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0