June 2020 - 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

Re: locales such that the associated topos is subdiscrete?
by Thomas Streicher 22 Jul '20

22 Jul '20

CAUTION: The Sender of this email is not from within Dalhousie. As I was just told by Matias Menni an answer to my question is also provided in Prop.6.3.5 of Pieter Hofstra's Thesis. Maybe I should explain a bit why I asked this question. In arxiv:2005.06019 Jonas Frey and I have characterized triposes over a base topos SS as regular functors F from SS to a topos EE such that 1. every object of EE appears as subquotient of some FI 2. F^*Sub_EE admits a generic family. What we had to leave as an open question whether triposes over SS = Set inducing the same topos are equivalent. In Hyland, Johnstone and Pitts's paper introcing triposes this question was aked for localic toposes and remained unanswered since the last 40 years. Krivine's work on classical realizability has come up with an alternative characterization of boolean triposes over Set and he has shown that F : Set->EE is the inverse image part of a localic g.m. iff F preserves 2. But it is still open whether (boolean) triposes F : Set->EE with EE loclic are nevessarily isomorphic to Delta : Set -> EE. BTW if one drops condition 2 there is a simple answer. For natural numbers n > 0 the functors F_n : Set->Set sending X to X^n are all triposes in this weaker sense and pairwise not isomorphic. As explained in my Paper with Jonas these generalized triposes are precisely those introduced by Andy Pitts in his 1999 paper "Tripos Theory in Retrospect". In many respects this weaker notion is more natural. The only disadvantage is that less is expressible in the internal language of the base topos SS. Thomas [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

2 2

Call for Participation: HoTT/UF 2020 - July 5-7
by Chris Kapulkin 25 Jun '20

25 Jun '20

CAUTION: The Sender of this email is not from within Dalhousie. CALL FOR PARTICIPATION Workshop on Homotopy Type Theory and Univalent Foundations July 5-7, 2020, The Internet https://hott-uf.github.io/2020 Homotopy Type Theory is a young area of logic, combining ideas from several established fields: the use of dependent type theory as a foundation for mathematics, inspired by ideas and tools from abstract homotopy theory. Univalent Foundations are foundations of mathematics based on the homotopical interpretation of type theory. The goal of this workshop is to bring together researchers interested in all aspects of Homotopy Type Theory and Univalent Foundations: from the study of syntax and semantics of type theory to practical formalization in proof assistants based on univalent type theory. # Registration Registration is free of charge, but required. The details can be found on the event website. # Invited talks * Carlo Angiuli (Carnegie Mellon University) From raw terms to recollement * Liron Cohen (Ben-Gurion University) Building Effectful Realizability Models, Uniformly * Pierre-Louis Curien (Université de Paris) A syntactic approach to opetopes, opetopic sets and opetopic categories # Contributed talks 21 talks were accepted by the Program Committee. Their titles and abstracts are available on the event website. # Schedule The event will take place from July 5-7, 2020. The talks are scheduled between 2 PM and 7:30 PM CEST (UTC+2). Detailed schedule is now available on the website. # Organizers * Benedikt Ahrens (University of Birmingham) * Chris Kapulkin (University of Western Ontario) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

CfP: ICTAC 2020
by radu.muschevici＠nottingham.edu.my 25 Jun '20

25 Jun '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/ ---------------------------------------------------------------------- DEADLINE EXTENSION: * Abstracts: 10. July 2020 * Full submission: 17. July 2020 ---------------------------------------------------------------------- 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. REMOTE PARTICIPATION: as of June, we have decided that virtual participation will be possible even if the conference will (also) be held physically. ---------------------------------------------------------------------- ****** 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 (Updated) ****** Abstract submission: Friday, 10 July 2020 (AoE) Paper submission: Friday, 27 July 2020 (AoE) Notification: Friday, 18 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. Planned special issue: Selected papers will be considered for a journal special issue to be confirmed). 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) << This message and any attachment are intended solely for the addressee an= d may contain confidential information. If you have received this message i= n error, please send it back to me, and immediately delete it. Please do no= t use, copy or disclose the information contained in this message or in any= attachment. Any views or opinions expressed by the author of this email do= not necessarily reflect the views of the University of Nottingham. This me= ssage has been checked for viruses but the contents of an attachment may st= ill contain software viruses which could damage your computer system: you a= re advised to perform your own checks. Email communications with the Univer= sity of Nottingham may be monitored as permitted by UK & Malaysia legislati= on. >> [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Fully funded PhD positions at Tallinn University of Technology
by Fosco Loregian 23 Jun '20

23 Jun '20

CAUTION: The Sender of this email is not from within Dalhousie. The Compositional Systems and Methods group at the Tallinn University of Technology, Estonia (https://compose.ioc.ee) is seeking highly qualified PhD candidates. The ideal student should have a solid grounding in category theory, and in at least one of the following areas: programming languages, concurrency theory, quantum computing, database and information systems, and machine learning. The group is led by Prof Pawel Sobocinski, has two postdoctoral researchers, Dr Edward Morehouse (https://emorehouse.wescreates.wesleyan.edu) and Dr Fosco Loregian (http://tetrapharmakon.github.io) and four PhD students: Elena Di Lavore, Dr Nathan Haydon, Chad Nester and Mario Román. One additional postdoctoral researcher will be recruited in the autumn of 2020. Our research is supported by the ESF funded Estonian IT Academy research measure. The group's lingua franca is category theory and our research concerns both mathematical foundations, as well as various applications in computer science and related disciplines. We are working on relational algebra and functorial semantics, open games, process languages for smart contracts, string diagrams, compositional descriptions of models of computation and concurrency, lenses and optics in functional programming, type theory, and several other topics. The group's ethos emphasises openness, and inter-group collaboration is highly encouraged. We maintain an active member-led seminar series ( https://compose.ioc.ee/seminars/) hold regular group meetings, research retreats and saunas in the Estonian countryside, and various cross-cutting research activities. The successful students will be awarded a generous stipend, provided with computing equipment and resources for travelling to conferences, summer schools, and other events relevant to their projects. Applicants should hold a Masters degree in Computer Science, Mathematics or a closely related field. To apply, send a CV and a motivation letter, outlining your research interests, to Pawel Sobocinski < pawel.sobocinski(a)taltech.ee>. APPLICATION DEADLINE: July 31, 2020 STARTING DATE: November 2020 or as per agreement Pawel Sobocinski Fosco Loregian [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

[CfP] ICLP DC 2020 - 16th Doctoral Consortium on Logic Programming
by Laura Pandolfo 23 Jun '20

23 Jun '20

CAUTION: The Sender of this email is not from within Dalhousie. *** ICLP DC 2020 - 16th Doctoral Consortium (DC) on Logic Programming *** The 16th Doctoral Consortium (DC) on Logic Programming provides students with the opportunity to present and discuss their research directions, and to obtain feedback from both peers and experts in the field. The preliminary website of the DC can be found at: https://sites.google.com/view/iclp-dc-2020/iclp-2020-doctoral-consortium The DC will take place during the 36th International Conference on Logic Programming (ICLP) https://iclp2020.unical.it/ (September 18-24, 2020), hosted by the University of Calabria, Italy, as a fully virtual event. The best paper from the DC will be given the opportunity to make a presentation in a session of the main ICLP conference. We aim to find sponsoring to cover the registration cost of students participating in the DC, but this still has to be confirmed. Important Dates Paper submission: July 11, 2020 Notification: July 25, 2020 Camera-ready copy: August 6, 2020 DC presentations: Sunday, September 20, 2020 (fully virtual event) However, DC students are highly recommended to attend the Autumn School on Logic Programming and Constraint Programming on: Friday and Saturday, September 18-19, 2020: https://sites.google.com/view/iclp-dc-2020/autumn-school-on-logic-programmi… Audience The DC is designed for students currently enrolled in a Ph.D. program, though we are also open to exceptions (e.g., students currently in a Master's program and interested in doctoral studies). Students at any stage in their doctoral studies are encouraged to apply for participation in the DC. Applicants are expected to conduct research in areas related to logic and constraint programming; topics of interest include (but are not limited to): Theoretical Foundations of Logic and Constraint Logic Programming Sequential and Parallel Implementation Technology Static and Dynamic Analysis, Abstract Interpretation, Compilation Technology, Verification Logic-based Paradigms (e.g., Answer Set Programming, Concurrent Logic Programming, Inductive Logic Programming) Innovative Applications of Logic Programming Submissions by students who have presented their work at previous ICLP DC editions are allowed, but should occur only if there are substantial changes or improvements to the student's work. The DC offers participants a convenient, more informal way to interact with established researchers and fellow students, through presentations, question-answer sessions, panel discussions, and invited presentations. The Doctoral Consortium will also provide the possibility to reflect - through short activities, information sessions, and discussions - on the process and lessons of research and life in academia. Each participant will give a short, critiqued, research presentation. Discussants Renowned experts and researchers in the fields of logic and constraint programming will join in evaluating submissions and will participate in the DC, providing valuable feedback to DC participants. Goals To provide doctoral students working in the fields of logic and constraint programming with a friendly and open forum to present their research ideas, listen to ongoing work from peer students, and receive constructive feedback. To provide students with relevant information about important issues for doctoral candidates and future academics. To develop a supportive community of scholars and a spirit of collaborative research. To support a new generation of researchers with information and advice on academic, research, industrial, and non-traditional career paths. Submission Details The DC is designed for students currently enrolled in a Ph.D. program, however Master's students who are actively involved in research (please see the list of topics below) can also participate in the DC program. Applicants are expected to conduct research in areas related to logic and constraint programming. Topics included, but not limited to: Foundations: Semantics, Formalisms, Nonmonotonic reasoning, Knowledge representation. Languages: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Assertions, Modules, Meta-programming, Logic-based domain-specific languages, Programming Techniques. Declarative programming: Declarative program development, Analysis, Type and mode inference, Partial evaluation, Abstract interpretation, Transformation, Validation, Verification, Debugging, Profiling, Testing, Execution visualization. Implementation: Virtual machines, Compilation, Memory management, Parallel/distributed execution, Constraint handling rules, Tabling, Foreign interfaces, User interfaces. Related Paradigms and Synergies: Inductive and Co-inductive Logic Programming, Constraint Logic Programming, Answer Set Programming, Interaction with SAT, SMT and CSP solvers, Logic programming techniques for type inference and theorem proving, Argumentation, Probabilistic Logic Programming, Relations to object-oriented and Functional programming. Applications: Databases, Big Data, Data integration and federation, Software engineering, Natural language processing, Web and Semantic Web, Agents, Artificial intelligence, Computational life sciences, Education, Cybersecurity, and Robotics. Submissions of the research summary must be made in EPTCS format (http://info.eptcs.org/) and submitted via EasyChair. All papers must be written in English and should be between 5 and 10 pages. For all accepted DC papers, the student is required to attend the DC program and give a presentation during the DC. A program committee consisting of experts in various areas related to logic and constraint programming reviews the submissions. Papers are reviewed by at least two, and usually three, referees. The submission package should consist of the research summary in the format mentioned above, a short vita or cover letter of the applicant, a letter of recommendation from applicant's faculty advisor, and one paragraph statement outlining how the school will benefit the applicant. All material is to be submitted electronically, in PDF format on the Easychair system. Easychair link: https://easychair.org/conferences/?conf=iclp20200 (Doctoral Consortium track) Research summary (make sure to include your complete name, address, and affiliation): The body of your research summary (no more than 10 pages, but 5 is fine as well!) should provide a clear overview of your research, its potential impact, and its current status. You are encouraged to include the following sections: Introduction and problem description Background and overview of the existing literature Goal of the research Current status of the research Preliminary results accomplished (if any) Open issues and expected achievements Bibliographical references Review Criteria The DC program committee will select participants based on their anticipated contribution to the DC objectives. Participants typically have settled on their thesis directions and have their research proposal accepted by their thesis committee. Students will be selected based on clarity and completeness of their submission package, relevance of their research area w.r.t. the focus of ICLP, stage of research, recommendation letter, and evidence of promise towards a successful career in research and academia, such as published papers or technical reports. Registration Registration is part of the ICLP 2020 registration Registration costs for ICLP will be lower than usual since it is virtual this year. We aim to find sponsoring to cover the registration cost of students participating in the DC, but this still has to be confirmed. Program co-chairs: Bart Bogaerts, Vrije Universiteit Brussel Daniela Inclezan, Miami University Program Committee TBA -- -- *Dona il 5x1000* all'Università degli Studi di Sassaricodice fiscale: 00196350904 [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

ICGT 2020: Call for Online Participation
by Fabio Gadducci 21 Jun '20

21 Jun '20

CAUTION: The Sender of this email is not from within Dalhousie. ----------------------------------------------------------------------- CALL FOR ONLINE PARTICIPATION ICGT 2020 13th International Conference on Graph Transformation 25-26 June 2020 as Online Conference http://icgt2020.di.unipi.it <http://icgt2020.di.unipi.it/> Part of STAF 2020 ----------------------------------------------------------------------- **AIMS** The use of graph-like structures for specification and modelling is by now widespread in all areas of computer science as well as in many fields of computational research and engineering. Often, these graphs undergo dynamic change, which may be captured by rule-based manipulation. Thus, graphs and graph transformation form a universal modelling paradigm for formal reasoning and analysis, ranging from the verification of given properties to the discovery of new insights. The International Conference on Graph Transformation series aims at fostering the exchange and collaboration of researchers working with graphs and graph transformation, either contributing to theoretical foundations or applying established formalisms to classical or novel areas. The conference not only serves as an established scientific publication outlet, but also as a platform to boost inter/intra-disciplinary research and to leeway for new ideas. The conference takes place under the auspices of EATCS and IFIP WG 1.3. The proceedings are published by Springer in its LNCS series. **VENUE** Due to the restrictions related to Covid-19, ICGT 2020 will be held as an online conference on June 25-26, 2020. The event will be broadcasted on the official YouTube channel of the University of Pisa. Links will be available a few days before the conference on the online program page. **PROGRAM** The conference program is online at http://icgt2020.di.unipi.it/online-program/ <http://icgt2020.di.unipi.it/online-program/> **KEYNOTE TALK** Bob Coecke (University of Oxford) Quantum natural language processing (on actual quantum hardware) **REGISTRATION** Attending the conference is free of charge, the streaming sessions will be freely available. A textual interaction will be possible for the audience, and all the questions will be visibile to session chairs and speakers. Fabio Gadducci and Timo Keher (ICGT 2020 Co-Chairs) [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Call for Tutorial Proposals: ICFP 2020
by Sam Tobin-Hochstadt 17 Jun '20

17 Jun '20

CAUTION: The Sender of this email is not from within Dalhousie. CALL FOR TUTORIAL, PANEL, AND DISCUSSION PROPOSALS ICFP 2020 25th ACM SIGPLAN International Conference on Functional Programming August 23 - 28, 2020 Virtual https://icfp20.sigplan.org/ The 25th ACM SIGPLAN International Conference on Functional Programming will be held virtually on August 23-28, 2020. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for tutorials, lasting approximately 3 hours each, to be presented during ICFP and its co-located workshops and other events. These tutorials are the successor to the CUFP tutorials from previous years, but we also welcome tutorials whose primary audience is researchers rather than practitioners. Tutorials may focus either on a concrete technology or on a theoretical or mathematical tool. Ideally, tutorials will have a concrete result, such as "Learn to do X with Y" rather than "Learn language Y". This year, following the success of the #ShutDownPL event, we are also inviting proposals for panels and discussions on topics of broader interest to the PL community. Tutorials, panels, and discussions may occur before or after ICFP, co-located with the associated workshops, on August 23 or August 27-28. ---------------------------------------------------------------------- Submission details Deadline for submission: July 17th, 2020 Notification of acceptance: July 22nd, 2020 Prospective organizers of tutorials are invited to submit a completed tutorial proposal form in plain text format to the ICFP 2020 workshop co-chairs (Jennifer Hackett and Leonidas Lampropoulos), via email to icfp-workshops-2020(a)googlegroups.com by July 17th, 2020. Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by July 22nd, 2020. The proposal form is available at: http://www.icfpconference.org/icfp2020-files/icfp20-panel-form.txt http://www.icfpconference.org/icfp2020-files/icfp20-tutorials-form.txt ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2020 organizing committee. Tutorials Co-Chair: Jennifer Hackett (University of Nottingham) Tutorials Co-Chair: Leonidas Lampropoulos (University of Maryland) General Chair: Stephanie Weirich (University of Pennsylvania) Program Chair: Adam Chlipala (MIT) ---------------------------------------------------------------------- Further information Any queries should be addressed to the tutorial co-chairs (Jennifer Hackett and Leonidas Lampropoulos), via email to icfp-workshops-2020(a)googlegroups.com [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

ETAPS 2020 afternoon, online, 2 July 2020, call for participation
by Tarmo Uustalu 16 Jun '20

16 Jun '20

CAUTION: The Sender of this email is not from within Dalhousie. [There will be no physical ETAPS in Dublin this autumn. Instead, on 2 July 2020, we will hold an online ETAPS 2020 afternoon. The authors of papers accepted to the main conferences of ETAPS 2020 will get an opportunity to present their work at ETAPS 2021 in Luxembourg.] The ETAPS EC and ETAPS 2020 LOC regret to announce that the plan of a postponed physical ETAPS in Dublin in autumn 2020 has become unrealistic. We will follow the following substitute plan. - We will hold a 3-hour virtual online ETAPS 2020 event in the afternoon of Thu 2 July 2020, see the call below. Everyone is most welcome to attend. There will be no registration, no fee. - The authors of papers accepted to the main conferences of ETAPS 2020 will get an opportunity to present their work at ETAPS 2021 in Luxembourg, Sat-Thu 27 March-1 April 2021. The exact arrangements for this move will be announced. - The workshop organizers will individually decide and announce whether, when and in what format their workshops will take place. - The local organizers of ETAPS 2020 will reimburse the fees collected (minus some administrative charge) according to a policy and a procedure to be announced. Thank you for your understanding! CALL FOR PARTICIPATION ETAPS 2020 afternoon online, 2 July 2020 https://etaps.org/2020/afternoon ETAPS 2020 AFTERNOON To compensate for the cancelled physical ETAPS 2020 conference in Dublin, we will hold a 3-hour virtual event to hand out the awards of the conference and listen to talks by the best paper award winners. This will take place Thu 2 July 2020. The presentations will be streamed live. Questions to presenters can be asked in a chat. The event will be recorded and can be watched later. HOW TO JOIN There will be no registration, no fee. The link to join the programme online will be published on the webpage https://etaps.org/2020/afternoon on the day of the event. PROGRAMME All times below are CEST. Start: 15:00 CEST (= GMT+2, Amsterdam). ------------------------------------------------------------------------- 15:00 Welcome by Marieke Huisman Announcement on ETAPS 2021 in Luxembourg and on the plan for ETAPS 2020 papers by Peter Ryan 15:15 Talk by EASST best paper award winner Florian Frohn. A calculus for modular loop acceleration (TACAS) Award handed out by Reiko Heckel 15:45 Announcement of ETAPS test of time award winner Award handed out by Don Sannella 16:00 Break 16:30 Talk by EAPLS best paper award winner Raffi Khatchadourian, Yiming Tang, Mehdi Bagherzadeh and Baishakhi Ray. An empirical study on the use and misuse of Java 8 streams (FASE) Award handed out by Anton Wijs 17:00 Talk by ETAPS PhD award winner Oded Padon. Deductive verification of distributed protocols in first-order logic (Tel Aviv University, 2018) Award handed out by Caterina Urban 17:30 Talk by EATCS best paper award winner Thomas Neele, Antti Valmari and Tim A.C. Willemse. The inconsistent labelling problem of stutter-preserving partial-order reduction (FoSSaCS) Award handed out by Don Sannella 18:00 Closing ------------------------------------------------------------------------- [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Locally internal stacks as categories of families?
by David Roberts 15 Jun '20

15 Jun '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear all I’ve had reason to think about locally internal categories/locally small fibrations over a base topos lately, and I was asked to what extent one can view these as categories of families of objects of a “locally small category” in a structural axiomatic set theory. To me it seems like one should take the fibration to be a stack, since given compatible families of objects on some cover, then one should definitely be able to glue them. Maybe I’m looking in the wrong places, but I don’t see any statements to this effect in the various papers on locally internal categories (in all their various guises and names), by Penon, Bénabou, Paré–Schumacher the Baby Elephant, and The Elephant (to name a few). I didn’t read them thoroughly, but I also didn’t see it in Mike Shulman’s Sets for category theory or Enriched indexed categories. Does anyone else concur, or know of a result in the literature close to this? 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