March 2019 - Categories - categories.org.au

TbiLLC2019: Final call for papers (extended deadline)
by Alex Simpson 30 Mar '19

30 Mar '19

This conference, which includes talks on logic and computation, will be of interest to some categories subscribers. Further attractions are the location and the famed Georgian hospitality. The deadline for the submission of three-page abstracts has been extended by two weeks to 15th April. --- THE THIRTEENTH INTERNATIONAL TBILISI SYMPOSIUM ON LOGIC, LANGUAGE AND COMPUTATION 16-20 September, 2019 Batumi, Georgia http://events.illc.uva.nl/Tbilisi/Tbilisi2019/ *********************************************************************** CALL FOR PAPERS - EXTENDED DEADLINE (new deadline 15 April 2019) The Thirteenth International Tbilisi Symposium on Logic, Language, and Computation will be held 16-20 September 2019 in Castello Mare Hotel in Tsikhisdziri near Batumi, Georgia. The Programme Committee invites submissions for contributions on all aspects of logic, language, and computation. Work of an interdisciplinary nature is particularly welcome. Areas of interest include, but are not limited to: * Natural language syntax, semantics, and pragmatics * Linguistic typology and semantic universals * Language evolution and learnability * Historical linguistics, history of logic * Natural logic, inference and entailment in natural language * Logic, games, and formal pragmatics * Logics for artificial intelligence and computer science * Constructive, modal and algebraic logic * Categorical logic * Algorithmic game theory * Computational social choice * Formal models of multiagent systems * Information retrieval, query answer systems * Distributional and probabilistic models of information, meaning and computation * Models of computation Authors can submit an abstract of three pages (including references) at the EasyChair conference system here: https://easychair.org/conferences/?conf=tbillc2019 Submissions must be original, unpublished work PROGRAMME The programme will include the following tutorials and a series of invited lecturers. Tutorials: Logic: Graham Leigh (University of Gothenburg) Language: Fabian Bross (University of Stuttgart) Computation: Daniela Petrisan (CNRS, Universit?? Paris Diderot) Invited speakers: Logic Philippe Balbiani (CNRS, Universit?? Toulouse III), Adam Bjorndahl (Carnegie Mellon University) Language Berit Gehrke (HU Berlin), Thomas Ede Zimmermann (University of Frankfurt) Computation Libor Barto (Charles University Prague), Elham Kashefi (CNRS, University of Edinburgh) WORKSHOPS There will be two workshops: "Syntax, Semantics, and Pragmatics of Aspect Across Modalities (SSPAM)" Organizers: Berit Gehrke (HU Berlin) and Fabian Bross (University Stuttgart) For more details see the workshop webpage https://sites.google.com/view/sspam2019/call-for-papers and "Topology and Modal Logic" Organizer: Adam Bjorndahl (Carnegie Mellon University) Speakers: Tamar Lando (Columbia University), Ayb??ke ??zg??n (ILLC, University of Amsterdam), Others to be confirmed. More information will be available on the TbiLLC website: http://events.illc.uva.nl/Tbilisi/Tbilisi2019/ Programme Committee Bahareh Afshari (University of Gothenburg) Rusiko Asatiani (Tbilisi State University) Guram Bezhanishvili (New Mexico State University) Nick Bezhanishvili (University of Amsterdam) Valeria de Paiva (Nuance Communications) David Gabelaia (TSU Rasmadze Mathematical Institute) Katharina Hartmann (University of Frankfurt/Main) Jules Hedges (University of Oxford) Daniel Hole (co-chair, University of Stuttgart) Sebastian L??bner (University of D??sseldorf) Matteo Mio (CNRS/ENS-Lyon) Sara Negri (University of Helsinki) Sebastian Pad?? (University of Stuttgart) Alessandra Palmigiano (Technical University of Delft) Roland Pfau (University of Amsterdam) Martin Sch??fer (University of Anglia Ruskin) Lutz Schr??der (University of Erlangen-N??rnberg) Kerstin Schwabe (Leibniz-ZAS Berlin) Alexandra Silva (UC London) Alex Simpson (co-chair, University of Ljubljana) Luca Spada (University of Salerno) Ronnie B. Wilbur (Purdue University) Fan Yang (University of Helsinki) PUBLICATION INFORMATION Post-proceedings of the symposium will be published in the LNCS series of Springer. IMPORTANT DATES Submission deadline: 15 April 2019 (Extended!) Notification: 3 June 2019 Final abstracts due: 1 July 2019 Early registration deadline: 31 July 2019 Late registration deadline: 31 August 2019 Symposium: 16-20 September 2019 Programme and submission details can be found at: http://events.illc.uva.nl/Tbilisi/Tbilisi2019/ LOCATION Castello Mare Hotel & Wellness Resort - Tsikhisdziri, Batumi, Georgia http://castellomare.com Information about getting to the conference site will be made available on the TbiLLC website. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

PhD position EFFICIENT AND NATURAL PROOFS AND ALGORITHMS at the University of Bath
by Alessio Guglielmi 29 Mar '19

29 Mar '19

We are recruiting for a PhD position on EFFICIENT AND NATURAL PROOFS AND ALGORITHMS Deadline: 18 April 2019 Mathematical Foundations Group <https://www.bath.ac.uk/projects/mathematical-foundations-of-computation/> Department of Computer Science University of Bath *** Description Proofs and algorithms are everyday objects in our discipline, but they are still very mysterious. Suffice to say that we are currently unable to decide whether two given proofs or two given algorithms are the same; this is an old problem that dates back to Hilbert. Also, proofs and algorithms are intimately connected in the most famous open problem in mathematics: P vs NP. We make progress by trying to unveil the fundamental structure behind proofs and algorithms, what we call their semantics. In other words, we are interested in the following questions: What is a proof? What is an algorithm? How can we define them so that they have efficient and natural semantics? The questions above are interesting in their own right, but we note that answering them will enable technological advances of great impact on society and the economy. For example, it will be possible to build a worldwide, universal tool for developing, validating, communicating and teaching mathematics. Also, quickly producing provably bug-free and secure software will become possible, so solving one of the most complex and important open engineering problems. In order to understand proofs and algorithms, we create new mathematics starting from proof theory and semantics. The methods we use are mostly discrete, algebraic and combinatorial, but there is a growing geometrical component. The recent advances which our methods are mostly based on are linear logic, game semantics and deep inference. You can find more information at <http://alessio.guglielmi.name/res/cos/> Our group is very well financed via several grants. Thanks to our international relations, working with us means having a truly multicultural experience together with all the researchers at the forefront of this worldwide research effort. As a result, all our graduates work and publish at the highest level. The facilities at the University of Bath are outstanding and the city is so beautiful that UNESCO recognises it as a World Heritage Site. *** Contact For questions about the project or the application process, please contact us: Alessio Guglielmi A.Guglielmi(a)bath.ac.uk Willem Heijltjes W.B.Heijltjes(a)bath.ac.uk *** How to apply Applicants should hold, or expect to gain, a First Class or good Upper Second Class Honours degree, or the equivalent from an overseas university. A master’s level qualification would also be advantageous. Formal applications should be made via the University of Bath’s online application form for a PhD in Computer Science: <https://samis.bath.ac.uk/urd/sits.urd/run/siw_ipp_lgn.login?process=siw_ipp…> Anticipated start date: 30 September 2019. *** Funding Research Council funding is available on a competition basis to Home and EU students who have been resident in the UK for 3 years prior to the start of the project. For more information on eligibility, see: <https://epsrc.ukri.org/skills/students/help/eligibility/> Funding will cover Home/EU tuition fees, a stipend (£14,777 per annum for 2018/19) and a training support fee of £1,000 per annum for 3.5 years. Applicants classed as Overseas for tuition fee purposes are NOT eligible for funding; however, we welcome all-year-round applications from self-funded candidates and candidates who can source their own funding. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

position
by rosicky 25 Mar '19

25 Mar '19

The Department of Mathematics and Statistics at Masaryk University invites applications for the following postdoctoral position http://www.math.muni.cz/aktuality/591-call-for-research-positions-in-algebr… [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Re: a copy of Bunge's "Categories of set-valued functors"
by peter＠easthope.ca 23 Mar '19

23 Mar '19

From: Marta Bunge <martabunge(a)hotmail.com> Date: Wed, 29 Aug 2018 01:02:41 +0000 > I suppose that my thesis must be stored in microfilm at the > University of Pennsylvania. I only have my own copy and never bothered > to try to obtain one such. Subject to permission of the copyright holder, Wikisource is a potential repository for a thesis. https://en.wikisource.org/wiki/Wikisource:What_Wikisource_includes#Scientif… The procedure to add a source is described here. https://en.wikisource.org/wiki/Help:Beginner%27s_guide_to_sources Translation from graphical form (DjVu or PDF) to wikitext is labour-intensive but assistance of volunteers is possilble. Regards, ... Peter E. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Second CFS (extended deadline): International Conference on Homotopy Type Theory 2019
by Michael Shulman 21 Mar '19

21 Mar '19

************************************************************** Second Call for Submissions -- Extended Deadline INTERNATIONAL CONFERENCE ON HOMOTOPY TYPE THEORY 12-17 August 2019 Carnegie Mellon University Pittsburgh USA https://hott.github.io/HoTT-2019 ************************************************************** Submissions of talks are open for the International Homotopy Type Theory conference (HoTT 2019), to be held from August 12th to 17th, 2019, at Carnegie Mellon University in Pittsburgh, USA. Contributions are welcome in all areas related to homotopy type theory, including but not limited to: * Homotopical and higher-categorical semantics of type theory * Synthetic homotopy theory * Applications of univalence and higher inductive types * Cubical type theories and cubical models * Formalization of mathematics and computer science in homotopy type theory / univalent foundations Please submit 1-paragraph abstracts through the EasyChair conference system here: https://easychair.org/conferences/?conf=hott2019 The submission deadline has been EXTENDED to 15 MAY 2019; we expect to notify accepted submissions by 1 June. If you need an earlier decision for some reason (e.g. to apply for funding), please submit your abstract by 15 APRIL and send an email to hott2019conference(a)gmail.com notifying us that you need an early decision. This conference is run on the "mathematics model" rather than the "computer science model": full papers will not be submitted, submissions will not be refereed, and submission is not a publication (although a proceedings volume might be organized afterwards). More information, including registration, accomodation options, and travel, will be available as the conference approaches at the web site https://hott.github.io/HoTT-2019/ . Please email hott2019conference(a)gmail.com with any questions. INVITED SPEAKERS Ulrik Buchholtz (TU Darmstadt, Germany) Dan Licata (Wesleyan University, USA) Andrew Pitts (University of Cambridge, UK) Emily Riehl (Johns Hopkins University, USA) Christian Sattler (University of Gothenburg, Sweden) Karol Szumilo (University of Leeds, UK) IMPORTANT DATES Submission deadline: 15 May (or 15 April for early notification) Registration Opens: 1 April Regular Notification Date: 1 June Final abstracts due: 15 June Early Registration deadline: 1 July (reduced fee) Late Registration deadline: 1 August (increased fee) Conference: 12-17 August 2019 SUMMER SCHOOL There will also be an associated Homotopy Type Theory Summer School in the preceding week, August 7th to 10th. The instructors and topics will be: Cubical methods: Anders Mortberg (Carnegie Mellon University, USA) Formalization in Agda: Guillaume Brunerie (Stockholm University, Sweden) Formalization in Coq: Kristina Sojakova (Cornell University, USA) Higher topos theory: Mathieu Anel (Carnegie Mellon University, USA) Semantics of type theory: Jonas Frey (Carnegie Mellon University, USA) Synthetic homotopy theory: Egbert Rijke (University of Illinois, USA) REGISTRATION Registration for the conference and the summer school will open on April 1, 2019. A limited amount of financial support will be available for students and postdoctoral researchers. SCIENTIFIC COMMITTEE Steve Awodey (Carnegie Mellon University, USA) Andrej Bauer (University of Ljubljana, Slovenia) Thierry Coquand (University of Gothenburg, Sweden) Nicola Gambino (University of Leeds, UK) Peter LeFanu Lumsdaine (Stockholm University, Sweden) Michael Shulman (University of San Diego, USA), chair We look forward to seeing you in Pittsburgh! [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

CALCO 2019: Second Call for Papers
by Henning Basold 20 Mar '19

20 Mar '19

========================================================= CALL FOR PAPERS: CALCO 2019 8th International Conference on Algebra and Coalgebra in Computer Science June 3-6, 2019 University College London, UK Co-located with MFPS XXXV https://www.coalg.org/calco-mfps-2019/ ========================================================== Abstract submission: April 3, 2019 Paper submission: April 8, 2019 Author notification: May 13, 2019 Final version due: May 27, 2019 ========================================================== SCOPE --------- CALCO aims to bring together researchers and practitioners with interests in foundational aspects, and both traditional and emerging uses of algebra and coalgebra in computer science. It 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 Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009), Winchester (UK, 2011), Warsaw (Poland, 2013), Nijmegen (the Netherlands, 2015), and Ljubljana (Slovenia,2017). The eighth edition will be held in London, UK, colocated with MFPS XXXV. INVITED SPEAKERS -- SPECIAL SESSION ----------------------------------------- CALCO will have four invited speakers, and a joint special session with MFPS. We are pleased to announce the following invited speakers: * Stefan Milius, University of Erlangen-Nuremberg, Germany * Damien Pous, CNRS, ENS Lyon, France (with MFPS) * Grigore Rosu, University of Illinois at Urbana-Champaign, US * Mehrnoosh Sadrzadeh, Queen Mary University of London, UK (with MFPS) Damien Pous will organise the joint CALCO and MFPS special session on Coinduction for Verification and Certification. SUBMISSIONS -------------- CALCO invites three categories of submissions: * Full technical papers that report - results of theoretical work on the mathematics of algebras and coalgebras, - the way these results can support methods and techniques for software development, as well as - experience with the transfer of the resulting technologies into industrial practice. * Early ideas abstracts that lead to presentation of work in progress and original research proposals. PhD students and young researchers are particularly encouraged to contribute. * Tool papers that report on the development and use of tools for algebraic and coalgebraic methods in computer science. TOPICS OF INTEREST -------------------- Typical, but not exclusive topics of interest are: * Abstract models and logics - Automata and languages - Categorical semantics - Graph transformation - Modal logics - Proof systems - Relational systems - Term rewriting * Algebraic and coalgebraic semantics - Abstract data types - Inductive and coinductive methods - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * Corecursion in programming languages - Corecursion in logic/constraint/functional/answer set programming - Corecursive type inference - Coinductive methods for proving program properties - Implementing corecursion - Applications * Role of algebraic and coalgebraic methods in software and systems engineering - Development processes with algebraic and coalgebraic methods - Method integration - Usage guidelines * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Models and calculi of concurrent, distributed, mobile, cyber-physical, and context-aware computing - Systems theory and computational models (chemical,biological,etc.) * String diagrams and network theory - Combinatorial approaches - Theory of PROPs and operads - Rewriting problems and higher-dimensional approaches - Automated reasoning with string diagrams - Applications of string diagrams - Connections with control theory, engineering, and concurrency * System specification and verification - Algebraic and coalgebraic specification - Formal testing and quality assurance - Generative programming and model-driven development - Integration of formal specification techniques - Model-driven development - Process algebra - Specification languages, methods, and environments - Validation and verification * Tools supporting algebraic and coalgebraic methods for - Advances in automated verification - Model checking - Theorem proving - Testing * Quantum computing with algebra and coalgebra - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra SUBMISSION GUIDELINES ------------------------ All submissions will be handled via EasyChair. ### Full technical papers ### Prospective authors are invited to submit full technical papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. Proceedings will be published in the Dagstuhl LIPIcs Leibniz International Proceedings in Informatics series. Final papers should be 12-15 pages long (excluding the bibliography and a brief appendix of up to 5 pages from this page limit) in the format specified by LIPIcs http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ (Note that there is a new version of the style: lipics-v2019). It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Both an abstract and the full paper must be submitted by their respective submission deadlines. At least one of the authors must attend the conference to present the paper. 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 also being planned. ### Early ideas abstracts ### Submissions should not exceed 2 pages in the format specified by LIPIcs http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ (Note that there is a new version of the style: lipics-v2019). 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. At least one of the authors must attend the conference to present the work. ### Tool papers ### Submissions should not exceed 5 pages in the format specified by LIPIcs http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ (Note that there is a new version of the style: lipics-v2019). 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. At least one of the authors of each tool paper must attend the conference to demonstrate 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. IMPORTANT DATES ------------------- Abstract submission: April 3, 2019 Paper submission: April 8, 2019 Author notification: May 13, 2019 Final version due: May 27, 2019 PROGRAMME COMMITTEE ----------------------- * Filippo Bonchi (University of Pisa, Italy) * Corina Cirstea (University of Southampton, UK) * Bob Coecke (University of Oxford, UK) * Jos?? Luiz Fiadeiro (Royal Holloway University of London, UK) * Daniel Gaina (Kyushu University, Japan) * Sergey Goncharov (University of Erlangen-Nuremberg, Germany) * Ichiro Hasuo (National Institute of Informatics, Japan) * Chris Heunen (University of Edinburgh, UK) * Helle Hvid Hansen (Delft University of Technology, The Netherlands) * Magne Haveraaen (University of Bergen, Norway) * Bart Jacobs (Radboud University Nijmegen, The Netherlands) * Bartek Klin (University of Warsaw, Poland) * Alexander Knapp (University of Augsburg, Germany) * Ekaterina Komendantskaya (Heriot-Watt University, UK) * Barbara K??nig (University of Duisburg-Essen, Germany) * Clemens Kupke (University of Strathclyde, UK) * Alexander Kurz (Chapman University, US) * Narciso Mart??-Oliet (Complutense University Madrid, Spain) * Larry Moss (Indiana University, US) * Till Mossakowski (University of Magdeburg, Germany) * Peter ??lveczky (University of Oslo, Norway) * Dirk Pattinson (Australian National University, Australia) * Daniela Petrisan (University Paris Diderot, France) * Carlos Gustavo Lopez Pombo (Universidad de Buenos Aires, Argentina) * Damien Pous (CNRS, ENS Lyon, France) * Markus Roggenbach (PC co-chair, Swansea University, UK) * Juriaan Rot (Radboud University Nijmegen, The Netherlands) * Pierre-Yves Schobbens (University of Namur, Belgium) * Lutz Schr??der (University of Erlangen-Nuremberg, Germany) * Ana Sokolova (PC co-chair, University of Salzburg, Austria) * Ionut Tutu (Romanian Academy, Romania) * Fabio Zanasi (University College London, UK) LOCAL ORGANISERS ------------------------ * Philippa Gardner (Imperial College London, UK) * Emanuele D???Osualdo (Imperial College London, UK) * Alexandra Silva (University College London, UK) * Fabio Zanasi (University College London, UK) PUBLICITY CHAIR ------------------ * Henning Basold (CNRS, ENS Lyon, France) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Question on simplicial homotopies
by Michael Barr, Prof. 19 Mar '19

19 Mar '19

Most of you know the combinatorial definition of simplicial homotopy in terms of families h^i: X_n --> Y_{n+1} satisfying a number of identities, including d^0h^0 = f_n and d^{n+1}h^n = g_n, to define a homotopy from f to g. We (John Kennison, Bob Raphael, and I) have been using a notion we call reduced homotopy which consists in a series of maps r^i: X_n --> Y_n satisfying certain identities. It turns out that the r^i = d^{i+1}h^i = d^ih^i (for all except the extreme values of i, 0 and n+1 when only the one or the other is defined) carry all the information and can have technical advantages in certain cases. What I would like to know is whether they appear anywhere in the literature that can be referred to. Michael [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

SYCO 3 - Final Call For Participation
by JS Pacaud Lemay 19 Mar '19

19 Mar '19

[Apologies to those of you who have received multiple copies of this email] THIRD SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 3) Second Call For Participation University of Oxford 27-28 March, 2019 http://events.cs.bham.ac.uk/syco/3/ The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. The first SYCO was in September 2018 at the University of Birmingham. The second SYCO was in December 2019, at the University of Strathclyde, each attracting about 70 people. The third SYCO will be in Oxford and we have 15 accepted papers ranging over theory and practice of category theory, from homotopy type theory to computational monads, to quantum resources, machine learning and linguistics. Indeed the SYCO series aims to bring together the communities behind many previous successful events which have taken place over the last decade, including "Categories, Logic and Physics", "Categories, Logic and Physics (Scotland)", "Higher-Dimensional Rewriting and Applications", "String Diagrams in Computation, Logic and Physics", "Applied Category Theory", "Simons Workshop on Compositionality", and the "Peripatetic Seminar in Sheaves and Logic". # INVITED SPEAKERS Marie Kerjean, INRIA Bretagne Atlantique Alessandra Palmigiano, Delft University of Technology and University of Johannesburg # ACCEPTED PAPERS • Chase Bednarz, Occlusion Operads for Image Segmentation • Lukas Heidemann, Nick Hu and Jamie Vicary, Introducing homotopy.io • Tai-Danae Bradley, Martha Lewis, Jade Master and Bradley Theilman, Translating and Evolving: Towards a Model of Language Change in DisCoCat • Martha Lewis, Compositionality for Recursive Neural Networks • Fosco Loregian and Ivan Di Liberti, On the unicity of formal category theories • Samson Abramsky, Rui Soares Barbosa, Martti Karvonen and Shane Mansfield, A comonadic view of simulation and quantum resources • Stefano Gogioso, Categorical Quantum Dynamics • Chad Nester, Constructing Cryptocurrency Ledgers with Monoidal Categories • Antonin Delpeuch , Autonomization of monoidal categories • Thorsten Altenkirch, Naturality for free – the category interpretation of directed type theory • Sharwin Rezagholi, Tobias Fritz and Paolo Perrone, The support is a morphism of monads • Neil Ghani, Clemens Kupke, Alasdair Lambert and Fredrik Nordvall Forsberg, Compositional Game Theory with Mixed Strategies: Probabilistic Open Games • Mario Alvarez-Picallo and C.-H. Luke Ong, Change Actions: Models of Generalised Differentiation • Maaike Zwart and Dan Marsden, Don't Try This at Home: No-Go Theorems for Distributive Laws # SCHEDULE OUTLINE: March 27, 1030-1730 March 28, 930-1530 # PROGRAMME COMMITTEE Fatimah Ahmadi, University of Oxford Miriam Backens, University of Oxford Corina Cirstea, University of Southampton Bob Coecke, University of Oxford Carmen Maria Constantin, University of Oxford Antonin Delpeuch, University of Oxford Brendan Fong, Massachusetts Institute of Technology Dan Ghica, University of Birmingham Giuseppe Greco, Utrecht University Helle Hvid Hansen, Delft University Jules Hedges, University of Oxford Chris Heunen, University of Edinburgh Dominic Horsman, University of Grenoble Dimitri Kartsaklis, Apple Kohei, Kishida, Dalhousie University Aleks Kissinger, Radboud University Nijmegen Alexander Kurz, Chapman University Jean-Simon Lemay, University of Oxford Martha Lewis, University of Amsterdam Dan Marsden, University of Oxford Samuel Mimram, École Polytechnique Michael Moortgat, Utrecht University Nina Otter, UCLA Simona Paoli, University of Leicester Robin Piedeleu, University of Oxford David Reutter, University of Oxford Mehrnoosh Sadrzadeh, Queen Mary University of London (chair) Christine Tasson, Paris Diderot University Jamie Vicary, University of Birmingham Tamara von Glehn, University of Cambridge Quanlong Wang, University of Oxford Gijs Wijnholds, Queen Mary University of London Philipp Zahn, University of St.Gallen [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Category Theory Octoberfest 2019 -- save the date
by Tslil Clingman 17 Mar '19

17 Mar '19

Dear all, This is a `save-the-date' announcement for the Category Theory OctoberFest of 2019. This year Octoberfest will be hosted at Johns Hopkins University, Baltimore, Maryland, over the last weekend of October, the 26th/27th. The meeting will start on the morning of Saturday the 26th and end the following afternoon. As is tradition, we are planning an introductory talk on Friday the 25th, joint with the Johns Hopkins Category Theory seminar. Details about accommodation, venues, transport and talk submission, and a website, will be posted soon. We look forward to seeing you in Baltimore, tslil, Daniel, and David. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Workshop on Formal Topology (6WFTop)
by Martin Escardo 15 Mar '19

15 Mar '19

This may of interest to some of you. * The workshop will be followed by a day of talks celebrating Steve Vickers and Giovanni Sambin's retirements last October and you are invited to attend. * The workshop forms the middle week of a series of Birmingham Spring meetings this April, including also the School and Workshop on Univalent Mathematics, and the Midlands Graduate School in the Foundations of Computer Science. Participants in 6WFTop may also be interested in the other two. Links can be found on the website. https://unimath.github.io/bham2019/ https://www.cs.bham.ac.uk/~sjv/6WFTop/ https://events.cs.bham.ac.uk/mgs2019/ * Submissions for contributed talks to 6WFTop are open. --- 6th Workshop in Formal Topology (6WFTop) School of Computer Science, University of Birmingham Mon-Fri 8-12 April 2019. These workshops date back to 1997, and cover point-free topology, broadly interpreted, and its logical foundations. There is always a lively and fruitful interaction between different communities from mathematics, logic and computer science, and the meetings have proved fertile ground for developing commonalities between different foundational approaches such as predicative type theory, toposes and constructive set theory. The main parts of the programme are - * A tutorial day on the Monday around the theme "What is a space?". Matthieu Anel and Benedikt Ahrens will introduce the ideas of toposes and univalent type theory. * Talks from invited speakers: Ingo Blechschmidt, Olivia Caramello, Maria Manuel Clementino, Tatsuji Kawai, Peter Johnstone and Giovanni Sambin. * Contributed talks from other participants - if you wish to offer one, please email a title and abstract to the organizers, at s.j.vickers(a)cs.bham.ac.uk. Further details are on the workshop web site at http://www.cs.bham.ac.uk/~sjv/6WFTop/ The workshop is benefiting greatly from generous funding by the London Mathematical Society and the British Logic Colloquium. Local organizers: Steve Vickers, Martin Escardo [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

2 1