From icfp.publicity at googlemail.com Thu Dec 1 08:31:44 2022 From: icfp.publicity at googlemail.com (ICFP Publicity) Date: Thu, 1 Dec 2022 16:31:44 +0800 Subject: [Haskell] ICFP 2023: Call for Workshop and Co-Located Event Message-ID: CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2023 28th ACM SIGPLAN International Conference on Functional Programming September 4 - 9, 2023 Seattle, WA, USA https://icfp23.sigplan.org/ The 28th ACM SIGPLAN International Conference on Functional Programming will be held in Seattle, WA, USA on September 4 - 9, 2023, with the option of virtual participation. 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 workshops (and other co-located events, such as symposiums) to be affiliated with ICFP 2023 and sponsored by SIGPLAN. These events should be less formal and more focused than ICFP itself, include sessions that enable interaction among the attendees, and foster the exchange of new ideas. The preference is for one-day events, but other schedules can also be considered. The workshops are scheduled to occur on September 4th (the day before ICFP) and September 8-9th (the two days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: December 22, 2022 Notification of acceptance: January 13, 2023 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2023 workshop co-chairs (Arthur Azevedo de Amorim and Yannick Forster) via email to icfp-workshops-2023 at googlegroups.com by December 22, 2022. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified whether their event proposal is accepted by January 13, 2023, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: http://www.icfpconference.org/icfp2023-files/icfp23-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://www.sigplan.org/Resources/Proposals/Sponsored/ ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2023 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Arthur Azevedo de Amorim (Boston University) Workshop Co-Chair: Yannick Forster (Inria Nantes) General Chair: Nikhil Swamy (Microsoft Research) Program Chair: Sam Lindley (University of Edinburgh) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Arthur Azevedo de Amorim and Yannick Forster), via email to icfp-workshops-2023 at googlegroups.com. From stevez at seas.upenn.edu Mon Dec 5 22:00:28 2022 From: stevez at seas.upenn.edu (Steve Zdancewic) Date: Mon, 5 Dec 2022 17:00:28 -0500 Subject: [Haskell] Certified Programs and Proofs (CPP) 2023: Call for Participation Message-ID: *** Call for Participation *** *** Certified Programs and Proofs (CPP) 2023 ***  - Early registration deadline: 16 December 2022  - Registration: https://popl23.sigplan.org/attending/registration  - Further reduced student participation fee: see below  - Accommodation: Boston Park Plaza    https://popl23.sigplan.org/venue/POPL-2023-venue Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm for their work. CPP spans areas of computer science, mathematics, logic, and education. CPP 2023 (https://popl23.sigplan.org/home/CPP-2023) will be held on 16-17 January 2023 and will be co-located with POPL 2023. CPP 2023 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG, and supported by a diverse set of industrial sponsors. Similarly to other events collocated with POPL 2023, CPP will take place as an in-person event at Boston Park Plaza, and will require attendees to provide proof of vaccination (details will be available soon). Virtual participation via Airmeet will also be available; look for updated information about that option on the POPL web site. For more information about this edition and the CPP series, please visit https://popl23.sigplan.org/home/CPP-2023 ### Invited Speakers * Sandrine Blazy, University of Rennes and IRISA * Cezary Kaliszyk, University of Innsbruck ### Accepted papers The list of accepted papers is available at https://popl23.sigplan.org/home/CPP-2023#event-overview ### Subsidized student registration To facilitate in-person participation, CPP 2023 offers the opportunity to waive the registration fees for those that are in need of financial support to attend the conference. This support is particularly aimed at undergraduate and graduate students, postdocs, and those from marginalized groups. If you wish to apply for support you may do so by sending an email to the CPP conference co-chairs (Dmitriy Traytel and Robbert Krebbers, see below for their email addresses), with a brief description of your situation. The deadline for applications is 11 December 2022, 23:59 AoE. Notifications will be sent out at most two days later; hence, those who cannot be supported will still have the opportunity to register with the regular early registration fee before 16 December. Applications arriving after 11 December will be considered only if additional budget is remaining. CPP's student support is made possible by our generous industrial supporters: https://popl23.sigplan.org/home/CPP-2023#About ### Contact For any questions please contact the chairs: Steve Zdancewic (PC co-chair) Brigitte Pientka (PC co-chair) Robbert Krebbers (conference co-chair) Dmitriy Traytel (conference co-chair) From lel416 at aol.com Mon Dec 5 22:51:58 2022 From: lel416 at aol.com (Lori Levy) Date: Mon, 5 Dec 2022 17:51:58 -0500 Subject: [Haskell] Email References: Message-ID: Please take me off email list Sent from my iPhone Please take me off your email list thank you From kaposi.ambrus at gmail.com Wed Dec 7 09:11:08 2022 From: kaposi.ambrus at gmail.com (Ambrus Kaposi) Date: Wed, 7 Dec 2022 10:11:08 +0100 Subject: [Haskell] Call for STSMs, deadline 1 January 2023 In-Reply-To: References: Message-ID: COST Action CA20111 EuroProofNet Open call for Short-Term Scientific Missions (STSMs) Dear Action members, The next STSM deadline is: 1st January 2023 *What is an STSM?* A Short-Term Scientific Mission (STSM) is a research visit of an individual researcher from a country participating in the Action in a different country also participating in the Action. We encourage STSMs, as they are an effective way of starting and maintaining research collaborations. Find all the details concerning application on https:// europroofnet.github.io/grants/ Do not hesitate to contact us if you have any questions. Best wishes, Danijela Simic and Ambrus Kaposi EuroProofNet STSM Coordinators > -------------- next part -------------- An HTML attachment was scrubbed... URL: From W.S.Swierstra at uu.nl Wed Dec 7 09:28:41 2022 From: W.S.Swierstra at uu.nl (Swierstra, W.S. (Wouter)) Date: Wed, 7 Dec 2022 09:28:41 +0000 Subject: [Haskell] Dutch FP Day - Call for participation Message-ID: =================================================================== FP Dag 2023 30th Netherlands Functional Programming Day Friday, 06 January, 2023 CALL FOR PARTICIPATION https://set.win.tue.nl/nl-fp-day-2023/ =================================================================== The Netherlands Functional Programming Day (or FP Dag) is an annual gathering of researchers, students, and practitioners sharing a common interest in functional programming. The day features talks that cover the latest advances in research, teaching and applications in the area of functional programming and (implementation of) functional languages. Coffee and lunch breaks provide ample opportunity for networking with your colleagues and meeting new people. Experts and newcomers to the field are equally welcome. Colleagues from neighboring countries are more than welcome to attend; the language of the FP Day is English. Registration: ------------- Participation is free of charge, but registration is required: https://docs.google.com/forms/d/1MgoY-tsSykzGtDdHq4GY4sTqO0Vm7oGIB2AXnDGbCL0 There is a soft registration deadline of Fri 23 Dec 2022. We are thankful for the sponsoring by Sioux Technologies and the Software Engineering & Technology group of TU Eindhoven. Schedule: --------- You will find a preliminary schedule on the website: https://set.win.tue.nl/nl-fp-day-2023/ Details will be added as speakers become known. Location: --------- The morning session of this FP Dag will be held in the Auditorium, Lecture Hall 04 of Eindhoven University of Technology. You can find detailed instructions for traveling to TU Eindhoven here: tue.nl/en/our-university/tue-campus/ The lunch and afternoon session will be held at Sioux Labs: https://www.sioux.eu/media/pt0bkkhm/sioux-campus-map_extern.pdf Organisers: ---------- Tom Verhoeff (Overall & Content) Anges van den Reek (Logistics, TU Eindhoven) Duncan Stiphout (Sioux) From josef.morales at imdea.org Mon Dec 19 11:04:09 2022 From: josef.morales at imdea.org (Jose F. Morales) Date: Mon, 19 Dec 2022 12:04:09 +0100 Subject: [Haskell] HCVS 2023 - First Call for Papers Message-ID: 10th Workshop on Horn Clauses for Verification and Synthesis (HCVS) Co-located with ETAPS 2023 23rd April 2023 - Paris, France https://www.sci.unich.it/hcvs23/ Important dates: - Paper submission deadline: Feb 22, 2023 - Paper notification: Mar 22, 2023 - Workshop: Apr 23, 2023 Many Program Verification and Synthesis problems of interest can be modeled directly using Horn clauses and many recent advances in the CLP and CAV communities have centered around efficiently solving problems presented as Horn clauses. This series of workshops aims to bring together researchers working in the two communities of Constraint/Logic Programming (e.g., ICLP and CP), Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated Deduction (e.g., CADE, IJCAR), on the topic of Horn clause based analysis, verification, and synthesis. Horn clauses for verification and synthesis have been advocated by these communities in different times and from different perspectives and HCVS is organized to stimulate interaction and a fruitful exchange and integration of experiences. The workshop follows previous meetings: HCVS 2022 in Munich, Germany (ETAPS 2022), HCVS 2021, online (ETAPS 2021), HCVS 2020, online (ETAPS 2020), HCVS 2019 in Prague, Czech Republic (ETAPS 2019), HCVS 2018 in Oxford, UK (CAV, ICLP and IJCAR at FLoC 2018), HCVS 2017 in Gothenburg, Sweden (CADE 2017), HCVS 2016 in Eindhoven, The Netherlands (ETAPS 2016), HCVS 2015 in San Francisco, CA, USA (CAV 2015), and HCVS 2014 in Vienna, Austria (VSL). Topics of interest include, but are not limited to the use of Horn clauses, constraints, and related formalisms in the following areas: - Analysis and verification of programs and systems of various kinds (e.g., imperative, object-oriented, functional, logic, higher-order, concurrent, transition systems, petri-nets, smart contracts) - Program synthesis - Program testing - Program transformation - Constraint solving - Type systems - Machine learning and automated reasoning - CHC encoding of analysis and verification problems - Resource analysis - Case studies and tools - Challenging problems We solicit regular papers describing theory and implementation of Horn-clause based analysis and tool descriptions. We also solicit extended abstracts describing work-in-progress, as well as presentations covering previously published results, extended abstracts of doctoral theses, and overviews of research projects that are of interest to the workshop. At least one author of each accepted paper will be required to attend the workshop to present the contribution. CHC Competition: HCVS 2023 will host the 6th competition on constraint Horn clauses (CHC-COMP https://chc-comp.github.io/ ), which will compare state-of-the-art tools for CHC solving for performance and effectiveness on a set of publicly available benchmarks. A report on CHC-COMP will be part of the workshop's proceedings. The report also contains tool descriptions of the participating solvers. Program Chairs: David Monniaux, VERIMAG, CNRS, Grenoble, France José F. Morales, IMDEA Software, Madrid, Spain Program Committee: TBA Submission has to be done in one of the following formats: - Regular papers (up to 12 pages plus bibliography in EPTCS (http://www.eptcs.org/) format), which should present previously unpublished work (completed or in progress), including descriptions of research, tools, and applications. - Tool papers (up to 4 pages in EPTCS format), including the papers written by the CHC-COMP participants, which can outline the theoretical framework, the architecture, the usage, and experiments of the tool. - Extended abstracts (up to 3 pages in EPTCS format), which describe work in progress or aim to initiate discussions. - **Presentation-only papers**, i.e., papers already submitted or presented at a conference or another workshop. Such papers can be submitted in any format, and will not be included in the workshop post-proceedings. - Posters that are of interest to the workshop All submitted papers will be refereed by the program committee and will be selected for inclusion in accordance with the referee reports. Accepted regular papers and extended abstracts will be published electronically as a volume in the Electronic Proceedings in Theoretical Computer Science (EPTCS) series, see http://www.eptcs.org/ (provided that enough regular papers are accepted). The publication of a paper is not intended to preclude later publication. Full versions of extended abstracts published in EPTCS, or substantial revisions, may later be published elsewhere. Papers must be submitted through the EasyChair system using the web page: https://easychair.org/conferences/?conf=hcvs2023 -------------- next part -------------- An HTML attachment was scrubbed... URL: From s-dgq at thorsten-wissmann.de Mon Dec 19 17:54:01 2022 From: s-dgq at thorsten-wissmann.de (Thorsten Wissmann) Date: Mon, 19 Dec 2022 18:54:01 +0100 Subject: [Haskell] CALCO 2023: First Call for Papers Message-ID: ========================================================= 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)