December 2022 - Categories - categories.org.au

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

23 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

A fully funded postdoc position in "Quantitative Verification of Software Families based on Coalgebraic Modal Logic and Games"
by Harsh Beohar 30 Dec '22

30 Dec '22

** Apologies if you receive multiple copies of these open positions ** Applications are invited for a fully funded postdoc/research associate post in Computer Science at the University of Sheffield. Job Reference Number: UOS035797 Job Title: Research Associate in Quantitative Verification Contract Type: Fixed term until 30.11.2024 Faculty: Faculty of Engineering Department: Department of Computer Science Salary: Grade 7 £35,333 per annum Closing Date: 4th February 2023 The post is supported by the EPSRC funded project “Quantitative verification of software families based on coalgebraic modal logic and games” (EP/X019373/1) headed by the PI Dr. Harsh Beohar. For any queries, please do not hesitate to contact me at h.beohar(a)sheffield.ac.uk; for a more detailed advertisement, please visit the department website (https://www.sheffield.ac.uk/dcs/about/jobs) and search using the reference number: UOS035797. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

None
by Valeria de Paiva 29 Dec '22

29 Dec '22

Dear all, It is a pleasure to invite you to the second edition of the Brazilian Meeting on Category Theory, which takes place 20-24th March 2023 at IME, USP, São Paulo, Brazil. This meeting follows the highly successful First Brazilian Meeting on Category Theory in 2021 https://encontrocategorico.mat.br/I/. This edition will be in person with a live broadcast on YouTube. More details on the site of the event https://encontrocategorico.mat.br. Valeria, Hugo Mariano, Ana Luiza Tenorio for the Organization -- Valeria de Paiva http://vcvpaiva.github.io/ https://topos.institute/ http://www.cs.bham.ac.uk/~vdp/ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Two open positions at ILLC, University of Amsterdam
by Benno van den Berg 21 Dec '22

21 Dec '22

[APOLOGIES FOR MULTIPLE POSTINGS] Dear all, Please find below a vacancy that might be of interest to you. Best wishes, Benno ======= *Two Assistant Professors in Mathematical and Computational Logic* The *Institute for Logic, Language and Computation <https://www.illc.uva.nl/>* (ILLC) at the University of Amsterdam (UvA) is seeking to hire two new faculty members in the area of *Mathematical and Computational Logic*. These appointments are envisaged at the assistant professor level, but, in the case of an exceptionally strong candidate, one of the appointments could be made at the associate professor level. The closing date for applications is January 22, 2023. For more information, see https://vacatures.uva.nl/UvA/job/Two-Assistant-Professors-in-Mathematical-a… [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Postdoc Position on Hardware Verification via Model Learning, Royal Holloway University of London -- Application deadline 20 Jan 2023
by Sammartino, Matteo 21 Dec '22

21 Dec '22

Applications are invited for the post of Post-Doctoral Research Assistant in the Computer Science Department at Royal Holloway, University of London. The post holder will have an exciting opportunity to work on the EPSRC-funded "Verification of Hardware Concurrency via Model Learning" (CLeVer) project, led by Prof. Alexandra Silva (UCL/Cornell) and Matteo Sammartino (RHUL), in collaboration with ARM, world-leading designer of multi-core chips. For an informal discussion about the post, please contact Matteo Sammartino on matteo.sammartino(a)rhul.ac.uk. # Brief description of the project Digital devices are increasingly complex, therefore there is a pressing need to automate the assessment of their correctness. Formal verification provides highly effective techniques to assess the correctness of systems. However, formal models are usually built by humans, and as such can be error-prone and inaccurate. The project aims to develop a novel verification framework for hardware, which combines learning, testing and model-checking. Not all models are suitable for this purpose and hence specific classes of models will need to be developed, depending on the task at hand. Subsequently, learning and verification techniques for these classes need to be devised and tested in realistic case studies. We have an industrial partner, ARM, that will provide valuable guidance on the design and development of the aforementioned tasks. # The ideal candidate We are looking for candidates with a PhD in one of the following areas: model-based testing and verification, model learning, automated analysis of hardware systems. Experience in multiple areas will be valued. Candidates ideally should also have strong programming skills. # Where to apply Additional details and a link to the application can be found here: https://jobs.royalholloway.ac.uk/0922-411-R-R <https://jobs.royalholloway.ac.uk/0922-411-R> The deadline is 20 Jan 2023 (midnight). Best wishes, Matteo Sammartino ============================== Matteo Sammartino, Lecturer Royal Holloway University of London Department of Computer Science Tel.: (+44) (0) 1784 44 3690 Office: 2-07, Bedford Building https://matteosammartino.com/ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

CALCO 2023: First Call for Papers
by Thorsten Wissmann 19 Dec '22

19 Dec '22

========================================================= CALL FOR PAPERS: CALCO 2023 10th International Conference on Algebra and Coalgebra in Computer Science June 19-22, 2023 Bloomington, Indiana (USA) and online Co-located with MFPS XXXIX https://coalg.org/calco-mfps-2023/ ========================================================== Paper submission: March 8, 2023 (AoE) Author notification: Apr 28, 2023 (AoE) Final version due: May 19, 2023 ========================================================== Scope ----- Algebraic and coalgebraic methods and tools are a mainstay of computer science. From data types to development techniques and specification formalisms, both theoreticians and practitioners have benefited from the large body of research proposed and implemented since the pioneering works of the 1960s. CALCO aims to bring together researchers with interests in both foundational and applicative uses of algebra and coalgebra in computer science, traditional as well as emerging ones CALCO is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science) and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Salzburg (Austria, 2021), London (UK, 2019), Ljubljana (Slovenia,2017), Nijmegen (the Netherlands, 2015), Warsaw (Poland, 2013), Winchester (UK, 2011), Udine (Italy, 2009), Bergen (Norway, 2007), Swansea (Wales, 2005). The 10th edition will be held in Bloomington, Indiana, co-located with MFPS XXXIX. It is planned as a physical, in-person event, with support for remote presence, both for speakers and for other participants who are unable or unwilling to travel. Submission Categories --------------------- CALCO invites papers relating to all aspects of algebraic and coalgebraic theory and applications, and distinguishes between four categories of submissions. 1. Regular papers that report * results on theoretical foundations * novel methods and techniques for software development * experiences with technology transfer to industry. 2. (Co)Algebraic Pearls papers that * present possibly known material in a novel and enlightening way. 3. Early ideas abstracts that lead to * presentations of work in progress * proposals for original venues of research. 4. Tool presentation papers that * report on the features and uses of algebraic/coalgebraic tools. Topics of Interests ------------------- All topics relating to algebraic and coalgebraic theory and applications are of interest for CALCO, and among them * Models and logics - Automata and languages - Graph transformations and term rewriting - Modal logics - Proof systems - Relational systems * Algebraic and coalgebraic semantics - Abstract data types - Re-engineering techniques (program transformations) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * Methodologies in software and systems engineering - Development processes - Method integration - Usage guidelines * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Concurrent, distributed, mobile, cyber-physical, and context-aware computational paradigms - Systems theory and computational models (chemical, biological, etc.) * System specification and verification - Formal testing and quality assurance - Generative programming and model-driven development - Integration of formal specification techniques - Model-driven development - Specification languages, methods, and environments * Tools supporting algebraic and coalgebraic methods for - Advances in automated verification - Model checking - Theorem proving - Testing * String diagrams and network theory - Theory of PROPs and operads - Rewriting problems and higher-dimensional approaches - Automated reasoning with string diagrams - Applications of string diagrams * Quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra Submissions Guidelines ---------------------- All submissions will be handled via EasyChair: https://easychair.org/conferences/?conf=calco2023 The format for all submissions is specified by LIPIcs. Please use the latest version of the style: http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Regular papers -------------- Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Regular papers should be maximum 15 pages long, excluding references. Proofs omitted due to space limitations may be included in a clearly marked appendix. Proceedings will be published in the Dagstuhl LIPIcs Leibniz International Proceedings in Informatics series. A special issue of the open access journal Logical Methods in Computer Science (http://www.lmcs-online.org) containing extended versions of selected papers, is planned. (Co)algebraic pearls -------------------- This is a recent submission category. Explaining a known idea in a new way may make as strong a contribution as inventing a new idea. We encourage the submission of pearls: elegant essays that illustrate an idea in a beautiful or didactically clever way, perhaps by developing an application. Pearls are typically short and concise and so should not be longer than regular papers in the format specified by LIPIcs. Authors who feel they need a bit more space should consult with the PC co-chairs. The accepted papers will be included in the final proceedings of the conference. Each submission will be evaluated by at least two reviewers. Early ideas abstracts --------------------- Submissions should not exceed 2 pages in the format specified by LIPIcs. The volume of selected abstracts will be made available on arXiv and on the CALCO pages. Authors will retain copyright, and are also encouraged to disseminate the results by subsequent publication elsewhere. Each submission will be evaluated by at least two reviewers. Tool papers ----------- Submissions should not exceed 5 pages in the format specified by LIPIcs. The accepted tool papers will be included in the final proceedings of the conference. The tools should be made available on the web at the time of submission for download and evaluation. Each submission will be evaluated by at least three reviewers, and one or more of the reviewers will be asked to download and use the tool. Best Paper and Best Presentation Awards --------------------------------------- This edition of CALCO will feature two awards: a Best Paper Award whose recipients will be selected by the PC before the conference and a Best Presentation Award, elected by the participants. Programme Committee ------------------- * Carlos Gustavo Lopez Pombo (University of Buenos Aires) * Andreas Abel (Gothenburg University) * Vincenzo Ciancia (Consiglio Nazionale delle Ricerche, Pisa) * Patricia Johann (Appalachian State University) * Ionut Tutu (Simion Stoilow Institute of Mathematics of the Romanian Academy) * Martin Escardo (University of Birmingham) * Tarmo Uustalu (Reykjavik University) * Giorgio Bacci (Aalborg University) * Thorsten Wi??mann (Radboud University Nijmegen) * Fabio Gadducci (University of Pisa) * Shin-Ya Katsumata (National Institute of Informatics, Tokyo) * Holger Giese (Hasso Plattner Institute at the University of Potsdam) * Peter ??lveczky (University of Oslo) * Michael Johnson (Macquarie University) * Nicolas Behr (CNRS Universit?? Paris Cit??) * Henning Urbat (FAU Erlangen-N??rnberg) * Valentina Castiglioni (Reykjavik University) * Fernando Orejas (Universitat Polit??cnica de Catalunya) * Mehrnoosh Sadrzadeh (University College London) * Georgiana Caltais (University of Twente) * S??awomir Lasota (University of Warsaw) * Aleks Kissinger (University of Oxford) * Thomas Colcombet (CNRS, IRIF, Universit?? de Paris) * Sandra Kiefer (Max Planck Institute for Software Systems) * Peter Selinger (Dalhousie University) * Natasha Alechina (Utrecht University) * Sara Kalvala (University of Warwick) Chairs ------ Paolo Baldan (University of Padua) Valeria de Paiva (Topos Institute, Berkeley) Organiser --------- * Larry Moss (local) (Indiana University) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Non-cartesian closedness of Met
by ptj＠maths.cam.ac.uk 19 Dec '22

19 Dec '22

Let Met denote the category of metric spaces and nonexpansive maps. It's well known that if we equip the product of two metric spaces with the L_{\infty} metric (the max of the distances in the two coordinates), we get categorical products in Met; alternatively, if we impose the L_1 metric on the product (the sum of the two coordinate distances), we get a monoidal closed structure, at least if we weaken the usual definition of a metric by allowing metrics to take the value \infty. It's intuitively obvious that the cartesian monoidal structure on Met can't be closed. But I've never (until I wrote one down today!) seen a formal proof of this; does anyone know if it exists anywhere in the literature? My proof is not particularly elegant: it amounts to showing that a particular coequalizer in Met is not preserved by a functor of the form (-) x Y. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

4 5

RAMiCS 2023 - Call for short contributions / posters
by Michael Winter 16 Dec '22

16 Dec '22

(Apologies for multiple posting) CALL FOR SHORT CONTRIBUTIONS / POSTERS 20th International Conference on Relational and Algebraic Methods in Computer Science RAMiCS 2023 3 to 6 April 2023, Technologiezentrum Augsburg, Germany https://ramics20.lis-lab.fr/ Additionally to the standard CfP, RAMiCS is also calling for short contributions and posters. We are hence calling for presentations of original, unfinished, already published, or otherwise interesting work within the topics of the RAMiCS conferences. The submission can be in the form of a poster, an abstract, a paper submitted to or published at another conference, etc. Short contributions will *not* be published in the conference proceedings. IMPORTANT DATES: Submission: January 27, 2023 Notification: February 03, 2023 RAMiCS 2023: April 03-06, 2023 INVITED SPEAKERS: Alexander Knapp, Augsburg University, Germany John Stell, University of Leeds, UK Valeria Vignudelli, CNRS/ENS Lyon, France GENERAL INFORMATION: Since 1994, the RAMICS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond. TOPICS: We invite short submissions in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory - algebras such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras and quantales - their connections with program logics and other logics - their use in the theories of automata, concurrency, formal languages, games, networks and programming languages - the development of algebraic, algorithmic, category-theoretic, coalgebraic and proof-theoretic methods for these theories - their formalisation with theorem provers * Applications - tools and techniques for program correctness, specification and verification - quantitative and qualitative models and semantics of computing systems and processes - algorithm design, automated reasoning, network protocol analysis, social choice, optimisation and control - industrial applications SUBMISSION INSTRUCTIONS: Please send your short submission as a single pdf file to ramics2023(a)easychair.org<mailto:ramics2023@easychair.org> by January 27, 2023. ORGANIZERS: Roland Glück, Deutsches Zentrum für Luft- und Raumfahrt, Germany Luigi Santocanale, LIS, Aix-Marseille University, France Michael Winter, Brock University, Canada [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Call for applications: Applied Category Theory Adjoint School 2023
by Elena Di Lavore 16 Dec '22

16 Dec '22

CALL FOR APPLICATIONS THE ADJOINT SCHOOL 2023 February - July, 2023. Learning Seminar July 24 - 28, 2023. In-person Research Week at University of Maryland, College Park, USA Application Due: January 9, 2023 https://adjointschool.com -------------------------------------------------------------------------------------------------------------------------- Are you interested in applying category-theoretic methods to problems outside of pure mathematics? Apply to The Adjoint School! Participants are divided into four-person project teams. Each project is guided by a mentor and a TA. The Adjoint School has two main components: an online learning seminar that meets regularly between February and June, and an in-person research week held in the summer adjacent to the Applied Category Theory Conference. During the learning seminar, we will read, discuss, and respond to papers chosen by the project mentors. Every other week a pair of participants will present a paper which will be followed by a group discussion. After the learning seminar each pair of participants will also write a blog post, based on the paper they presented, for The n-Category Cafe <https://golem.ph.utexas.edu/category/>. Projects and Mentors: Message Passing Logic for Categorical Quantum Mechanics - Mentor: Priyaa SrinivasanBehavioural Metrics, Quantitative Logics and Coalgebras - Mentor: Barbara KönigConcurrency in monoidal categories - Mentor: Chris HeunenGame Comonads and Finite Model Theory - Mentor: Dan Marsden Check more information about research projects in https://adjointschool.com/2023.html Organizers Ana Luiza Tenorio Angeline Aguinaldo Elena Di Lavore Nathan Haydon [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Upcoming permanent position at Macquarie
by Richard Garner 16 Dec '22

16 Dec '22

Dear all, This is to give you advance warning that in the new year we will be advertising a permanent position here at Macquarie University in Sydney. While the position will be open to any field of mathematics, priority will be given to excellent candidates working in category theory. As many of you are probably aware, the group here is pretty active: we have Steve Lack and myself as continuing academics, Ross Street, Dominic Verity and Mike Johnson as emeritus professors, and John Power as an honorary professor; plus a community of 11 postgraduate students and a couple of postdocs. This is a Lecturer position, analogous to a UK lecturer or a US assistant professor, with a base salary of AU$110,000-$130,000, and is a balanced academic role with 40% research, 40% teaching and 20% service. We expect the formal advertisement to be live at the start of February with a closing date early in March. This rather short period is forced upon us by federal government rules, so it seems best to get word out now. Please feel free to distribute this message further, and don't hesitate to get in touch if you have any questions about anything to do with this. Richard [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0