- Haskell - Haskell.org

TyDe 2026: Second call for papers
by Tom Schrijvers 28 May '26

28 May '26

========================================================================= The Eleventh International Workshop on TYPE-DRIVEN DEVELOPMENT Call for papers and extended abstracts Paris, 26-27th August 2026 https://tydeworkshop.org/2026 ========================================================================= The Workshop on Type-Driven Development (TyDe) aims to show how static type information may be used effectively in the development of computer programs. Organised as part of FPW26 (Functional Programming Workshops 2026), this workshop brings together leading researchers and practitioners who are using or exploring types as a means of program development. We welcome all contributions, both theoretical and practical, on a range of topics including: * dependently typed programming; * generic programming; * design and implementation of programming languages, exploiting types in novel ways; * exploiting typed data, data dependent data, or type providers; * static and dynamic analyses of typed programs; * tools, IDEs, or testing tools exploiting type information; * pearls, being elegant, instructive examples of types used in the derivation, calculation, or construction of programs. ### Important dates (all are AoE) ### * June 3rd 2026 - Research Papers Submission Deadline * June 24th 2026 - Extended Abstracts Submission Deadline * July 10th 2026 - Notification * July 17th 2026 - Camera-Ready Paper Submission Deadline * August 26-27th 2026 - Workshop at FPW26 ### Proceedings and Copyright ### TO BE CONFIRMED We will aim to have formal proceedings for full-length papers, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance, but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. The official publication date is the date the papers are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. ### Submission Details ### Submissions should fall into one of two categories: * regular research papers (12 pages); * extended abstracts (3 pages). The bibliography will not be counted against the page limits for either category. Regular research papers are expected to present novel and interesting research results, and will be included in the formal proceedings. Extended abstracts should report work in progress that the authors would like to present at the workshop. Extended abstracts will be distributed to workshop attendees but will not be published in the formal proceedings. We welcome submissions from PC members (with the exception of the two co-chairs), but these submissions will be held to a higher standard. Submission is handled through HotCRP: > https://tyde2026.hotcrp.com All submissions should be in portable document format (PDF) and formatted using the ACM SIGPLAN style guidelines: > https://www.sigplan.org/Resources/Author/ Note that submissions should use the new acmart format and the two-column sigplan subformat (not to be confused with the one-column acmsmall subformat). Extended abstracts must be submitted with the label Extended Abstract clearly in the title. ### Presentations ### We expect that each accepted submission is presented at the workshop. Presentations are around 20 minutes plus questions. Remote presentation is possible. ### Workshop Organization ### Organizing Committee: - Guillaume Allais (co-chair) University of Strathclyde, UK - Tom Schrijvers (co-chair) KU Leuven, BE Program Committee: TBC

1 0

[2nd CFP] HOPE'26: ACM SIGPLAN Workshop on Higher-Order Programming with Effects
by Taro Sekiyama 25 May '26

25 May '26

********************************************************************** 2nd Call for Proposals - HOPE 2026 ********************************************************************** TL;DR: Talk proposal deadline for HOPE 2026 is on May 29, 2026. This year, the workshop will be co-located with ICFP'26 (Indiana, US) and FW'26 (Paris, France) ---------------------------------------------------------------------- HOPE 2026 The 14th ACM SIGPLAN Workshop on Higher-Order Programming with Effects August 24, 2026 (the day before ICFP 2026) https://icfp26.sigplan.org/home/hope-2026 <https://icfp26.sigplan.org/home/hope-2026> HOPE 2026 aims to bring together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be*informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. ---------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. We recommend preparing proposals of at most 2 pages excluding references, in either plain text or PDF format. However, we will accept longer proposals or submissions to other conferences, under the understanding that PC members are only expected to read the first two pages of such longer submissions. When submitting talk proposals, authors should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs, Taro Sekiyama (tsekiyama(a)acm.org) and Francesco Gavazzo (francesco.gavazzo(a)unipd.it) Important Note: HOPE’26 will be co-located with ICFP’26 (https://icfp26.sigplan.org/) and FW’26 (https://www.irif.fr/~scherer/events/fpw-2026/announce.html <https://www.irif.fr/~scherer/events/fpw-2026/announce.html>). Presenters can choose either event to attend in-person. We also encourage remote participation and will support remote presentations. Deadline for talk proposals: May 29, 2026 (Friday) Notification of acceptance: June 26, 2026 (Friday) Workshop: August 24, 2026, Indiana, United States & Paris, France (tentatively) The submission website is now open: https://hope26.hotcrp.com --------------------- Workshop Organization --------------------- Program Committee: Yuyan Bao (Augusta University) Raphaëlle Crubillé (Aix-Marseille University) Francesco Dagnino (University of Genova) Elena di Lavore (University of Oxford) Francesco Gavazzo (University of Padua) Cristina Matache (University of Edinburgh) Ken Sakayori (The University of Tokyo) Taro Sekiyama (National Institute of Informatics) Dario Stein (Radboud University) Niels Voorneveld (Cybernetica) Zhixuan Yang (University of Exeter) --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make code harder to build, maintain, and reason about. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help “tame” or “encapsulate” effects (e.g. monads and handlers, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc., to be made available online. -- Taro Sekiyama

1 0

IFL 2026 First call for papers
by Mart Lubbers 20 May '26

20 May '26

======================================================================= IFL 2026 38th Symposium on Implementation and Application of Functional Languages venue: Aspenäs Herrgård, Gothenburg, Sweden October 28 - 30 2026 https://ifl26.cse.chalmers.se/ ======================================================================= ### Scope The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2026 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. ### Topics of interest Topics of interest to IFL include, but are not limited to: - language concepts - type systems, type checking, type inferencing - compilation techniques - staged compilation - run-time function specialisation - run-time code generation - partial evaluation - (abstract) interpretation - meta-programming - generic programming - automatic program generation - array processing - concurrent/parallel programming - concurrent/parallel program execution - embedded systems - web applications - (embedded) domain specific languages - security - novel memory management techniques - run-time profiling performance measurements - debugging and tracing - virtual/abstract machine architectures - validation, verification of functional programs - tools and programming techniques ### Peer-review process Following IFL tradition, IFL 2026 will use a post-symposium review process for the formal proceedings. Authors are invited to submit draft papers before the symposium. The program chairs will screen submissions for relevance to IFL, and accepted drafts will be shared with all participants. Each accepted paper must be presented at the symposium by at least one author. If submissions exceed capacity, selection will be based on quality, maturity, and relevance. Authors of accepted presentations will have the opportunity to revise their work in response to symposium feedback and submit a full paper to the post-proceedings. These submissions will be reviewed by the program committee for correctness, novelty, originality, relevance, significance, and clarity. The post-symposium review process is single-blind, with at least three reviews per paper. Camera-ready versions may include minor revisions without further review. ### Important dates Submission of draft papers September 4, 2026 Draft papers notification September 11, 2026 Deadline for early registration September 18, 2026 Deadline for late registration September 25, 2026 IFL symposium October 28-30, 2026 Submission of papers for proceedings November 25, 2026 Notification of acceptance February 12, 2027 Camera-ready version March 12, 2027 Deadlines are end of day Anywhere on Earth (UTC-12). ### Submission details All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template Submit your paper here: https://easychair.org/conferences/?conf=ifl26 Important note to authors about the new ACM open access publishing model: ACM has introduced a new open access publishing model for the International Conference Proceedings Series (ICPS). Authors based at institutions that are not yet part of the ACM Open program and do not qualify for a waiver will be required to pay an article processing charge (APC) to publish their ICPS article in the ACM Digital Library. To determine whether or not an APC will be applicable to your article, please follow the detailed guidance here: https://www.acm.org/publications/icps/author-guidance Further information: ICPS publishing model FAQ: https://www.acm.org/publications/icps/faq ACM Open program details: https://www.acm.org/publications/openaccess Questions: icps-info(a)acm.org ### Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. ### Organisation PC Chairs: - Alex Gerdes, Chalmers and University of Gothenburg, Sweden - Koen Claessen, Chalmers and University of Gothenburg, Sweden Publicity Chair: - Mart Lubbers, Radboud University, The Netherlands Local Chairs: - Alex Gerdes, Chalmers and University of Gothenburg, Sweden - Koen Claessen, Chalmers and University of Gothenburg, Sweden Please direct any questions you may have towards alexg(a)chalmers.se. ### Program committee - Abhiroop Sarkar, ETH Zurich - Andres Löh, Well-Typed LLP - Daan Leijen, Microsoft - Dominic Orchard, University of Kent - Fritz Henglein, DIKU - Graham Hutton, University of Nottingham - Guillaume Allais, University of Strathclyde - Jesper Cockx, Delft University of Technology - Mart Lubbers, Radboud University - Nachiappan Valliappan, University of Edinburgh - Nicolas Wu, Imperial College London - Niki Vazou, IMDEA Software Institute The program committee is still being finalized and may be updated. ### Venue IFL 2026 will be held at Aspenäs Herrgård, just outside Gothenburg, Sweden. Aspenäs Herrgård will host the symposium venue and provide a scenic setting for the conference. We will add more information about the venue, accommodation, and travel options soon. ### Acknowledgments This call-for-papers is an adaptation and evolution of content from previous instances of IFL. We are grateful to prior organisers for their work, which is reused here.

1 0

TyDe 2026: 1st Call for Papers
by Tom Schrijvers 13 May '26

13 May '26

========================================================================= The Eleventh International Workshop on TYPE-DRIVEN DEVELOPMENT Call for papers and extended abstracts Paris, 26-27th August 2026 https://tydeworkshop.org/2026 ========================================================================= The Workshop on Type-Driven Development (TyDe) aims to show how static type information may be used effectively in the development of computer programs. Organised as part of FPW26 (Functional Programming Workshops 2026), this workshop brings together leading researchers and practitioners who are using or exploring types as a means of program development. We welcome all contributions, both theoretical and practical, on a range of topics including: * dependently typed programming; * generic programming; * design and implementation of programming languages, exploiting types in novel ways; * exploiting typed data, data dependent data, or type providers; * static and dynamic analyses of typed programs; * tools, IDEs, or testing tools exploiting type information; * pearls, being elegant, instructive examples of types used in the derivation, calculation, or construction of programs. ### Important dates (all are AoE) ### * June 3rd 2026 - Research Papers Submission Deadline * June 24th 2026 - Extended Abstracts Submission Deadline * July 10th 2026 - Notification * July 17th 2026 - Camera-Ready Paper Submission Deadline * August 26-27th 2026 - Workshop at FPW26 ### Proceedings and Copyright ### TO BE CONFIRMED We will aim to have formal proceedings for full-length papers, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance, but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. The official publication date is the date the papers are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. ### Submission Details ### Submissions should fall into one of two categories: * regular research papers (12 pages); * extended abstracts (3 pages). The bibliography will not be counted against the page limits for either category. Regular research papers are expected to present novel and interesting research results, and will be included in the formal proceedings. Extended abstracts should report work in progress that the authors would like to present at the workshop. Extended abstracts will be distributed to workshop attendees but will not be published in the formal proceedings. We welcome submissions from PC members (with the exception of the two co-chairs), but these submissions will be held to a higher standard. Submission is handled through HotCRP: > https://tyde2026.hotcrp.com All submissions should be in portable document format (PDF) and formatted using the ACM SIGPLAN style guidelines: > https://www.sigplan.org/Resources/Author/ Note that submissions should use the new acmart format and the two-column sigplan subformat (not to be confused with the one-column acmsmall subformat). Extended abstracts must be submitted with the label Extended Abstract clearly in the title. ### Presentations ### We expect that each accepted submission is presented at the workshop. Presentations are around 20 minutes plus questions. Remote presentation is possible. ### Workshop Organization ### Organizing Committee: - Guillaume Allais (co-chair) University of Strathclyde, UK - Tom Schrijvers (co-chair) KU Leuven, BE Program Committee: TBC

1 0

[Haskell Symposium 2026] Call for Papers and Talks
by Facundo Domínguez 07 May '26

07 May '26

Dear all, The ACM SIGPLAN Haskell Symposium 2026 will be co-located with the 2026 International Conference on Functional Programming (ICFP). The Haskell Symposium presents original research on Haskell, discusses practical experience and future development of the language, and promotes other forms of declarative programming. Research papers, talk proposals, experience reports, functional pearls, tutorials, and system demonstrations are welcome. Topics of interest include: * Language design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal semantics of the present language or future extensions, type systems, effects, metatheory, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management, as well as foreign function and component interfaces; * Libraries, that demonstrate new ideas or techniques for functional programming in Haskell; * Tools, such as profilers, tracers, debuggers, preprocessors, and testing tools; * Applications, to scientific and symbolic computing, databases, multimedia, telecommunication, the web, and so forth; * Functional Pearls, being elegant and instructive programming examples; * Experience Reports, to document general practice and experience in education, industry, or other contexts; * Tutorials, to document how to use a particular language feature, programming technique, tool or library within the Haskell ecosystem; * System Demonstrations, based on running software rather than novel research results. The deadline for paper submission is May 21st 2026 (Monday). Full details at https://icfp26.sigplan.org/home/haskellsymp-2026#Call-for-Papers-and-Talks Cheers!

1 0

Journal of Functional Programming - Call for PhD Abstracts
by Graham Hutton (staff) 05 May '26

05 May '26

Dear all, If you or one of your students recently completed a PhD (or Habilitation) in the area of functional programming, please submit the dissertation abstract for publication in JFP: simple process, no refereeing, open access, 200+ published to date, deadline 30st May 2026. Please share! Best wishes, Graham Hutton ============================================================ CALL FOR PHD ABSTRACTS Journal of Functional Programming Deadline: 31st May 2026 http://tinyurl.com/jfp-phd-abstracts ============================================================ PREAMBLE: Many students complete PhDs in functional programming each year. As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year. The abstracts are made freely available on the JFP website, i.e. not behind any paywall. They do not require any transfer of copyright, merely a license from the author. A dissertation is eligible for inclusion if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. The abstracts are not reviewed. Please submit dissertation abstracts according to the instructions below. We welcome submissions from both the student and the advisor/supervisor although we encourage them to coordinate. Habilitation dissertations are also eligible for inclusion. ============================================================ SUBMISSION: Please submit the following information to Graham Hutton <graham.hutton(a)nottingham.ac.uk> by 31st May 2026 o Dissertation title: (including any subtitle) o Student: (full name) o Awarding institution: (full name and country) o Date of award: (month and year; depending on the institution, this may be the date of the viva, corrections being approved, graduation ceremony, or otherwise) o Advisor/supervisor: (full names) o Dissertation URL: (please provide a permanently accessible link to the dissertation if you have one, such as to an institutional repository or other public archive; links to personal web pages should be considered a last resort) o Dissertation abstract: (plain text, maximum 350 words; you may use \emph{...} for emphasis, but we prefer no other markup or formatting; if your original abstract exceeds the word limit, please submit an abridged version within the limit) Please do not submit a copy of the dissertation itself, as this is not required. JFP reserves the right to decline to publish abstracts that are not deemed appropriate. ============================================================ PHD ABSTRACT EDITOR: Graham Hutton School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom ============================================================ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law.

1 0

Deadline extension for MSFP'26, Lisbon, July 18th
by Marie Kerjean 01 May '26

01 May '26

Call for contributions : Eleventh Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING, Saturday 18th July 2026, Lisbon Eleventh Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING Saturday 18th July 2026, Lisbon, Portugal A satellite workshop of FSCD 2026 https://msfp-workshop.github.io/msfp2026/ ** Deadline extension: Thursday 7th April (AoE) ** The tenth workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Where would Haskell be without monads? Functional reactive programming without arrows? Call-by-push-value without adjunctions? The list goes on. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. MSFP 2026 will be held on Saturday, 18th July in Lisbon, Portugal, in affiliation with FSCD@FLoC26 (https://fscd2026.github.io/) Previous instances have been held in Tallinn (with FSCD2024), Munich (with ETAPS 2022), virtually (2020), in Oxford (with FLOC 2018), Eindhoven (with ETAPS 2016), Grenoble (ETAPS 2014), Tallinn (with ETAPS 2012), Baltimore (with ICFP 2010), Reykjavik (with ICALP 2008), and Kuressaare (with MPC and AMAST 2006). Important Dates: ================ Paper deadline: Thursday 7th April (AoE) (extended) Notification: Wednesday 27th May Final version: Wednesday 24th June (AoE) Workshop: Saturday 18th July Invited Speakers: ================= TBA Programme Committee: ==================== Robert Atkey - University of Strathclyde, UK (co-chair) Marie Kerjean - CNRS, Université Sorbonne Paris Nord, FR (co-chair) Samantha Frohlich - University of Bristol, UK Paulette Koronkevich - University of British Columbia, CA Satoshi Kura - Waseda University, JP Ambroise Lafont - École Polytechnique, FR Guillaume Munch-Maccagnoni - Inria, FR Wouter Swiestra - Utrecht University, NL Niels Voorneveld - Cybernetica, EE Zhixuan Yang - University of Exeter, UK Submission: =========== Submissions are welcomed on, but by no means restricted to, topics such as: structured effectful computation structured recursion structured corecursion structured tree and graph operations structured syntax with variable binding structured datatype-genericity structured search structured representations of functions structured quantum computation structure directed optimizations structured types structure derived from programs and data Please contact the programme chairs Marie Kerjean <marie.kerjean(a)cnrs.fr> and Robert Atkey <robert.atkey(a)strath.ac.uk> if you have any questions about the scope of the workshop. We accept two categories of submission: full papers of at most 15 pages that will appear in the proceedings (published with EPTCS) and extended abstracts of at most two pages, which we will post on the website but do not constitute formal publications and will not appear in the proceedings. A short abstract should be submitted by four days in advance of the paper deadline (for both full paper and extended abstract submissions). For full details, see the webpage. We are using the FLoC HotCRP to manage submissions: https://submissions.floc26.org/msfp

1 0

[EULP 2026 - Call for Papers] 1st Workshop on End-User Logic Programming, Lisbon, Portugal | July 26
by Manuel Alejandro Borroto Santana 30 Apr '26

30 Apr '26

*Call for Papers* 1st Workshop on End-User Logic Programming (EULP 2026) July 18, 2026 | Lisbon, Portugal https://eulp.gitlab.io/eulp2026/ Part of FLoC 2026 https://www.floc26.org/ IMPORTANT DATES (AoE): - Submission Deadline: *May 9, 2026* - Notification of Acceptance: *May 21, 2026* *GENERAL INFORMATION* Since its inception, Logic Programming (LP) has proven itself as a powerful technique for tackling concrete problems, such as configuration, scheduling, and planning. Yet, LP and related approaches have difficulties gaining wider traction within industry, and LP adoption is still largely driven by an academic push rather than an industry pull. A key reason for this discrepancy is the fact that building accurate programs is a difficult, costly, and error-prone process, especially for people without prior LP experience. More generally, this problem is known as the Knowledge Acquisition Bottleneck, which is a challenge for all approaches in the broader field of knowledge representation. To help tackle this issue, researchers have been looking at ways to improve the accessibility of LP. More recently, the research direction has seen a significant rise in interest. Still, with no dedicated event to support it, tools and methodologies can be scattered and hard to find. The "End-user Logic Programming" (EULP) workshop offers a dedicated forum for work on techniques and methodologies that lower the logic programming threshold for non-experts. Additionally, we also welcome work which allows LP-approaches to be turned into full-fledged, user-ready products. In this way, we facilitate sharing new techniques, and stimulate networking between researchers from different fields. *SCOPE* EULP welcomes all works that aim to lower the threshold related to logic programming for non-experts and to help LP approaches gain more traction in real-life situations. A non-exhaustive list of topics includes: - User-friendly formalisms, such as Controlled Natural Languages and graphical languages - Accessible interactivity with logic programs - Visualisation methods - Explainability - LLM-assisted workflows: LLMs in formalization, validation, explanation, and others - Integration of LP approaches in traditional programs - Cognitive modeling complexity of LP - Accessible UI design for LP-based tools *SUBMISSIONS* We invite three types of submissions: - Long papers (up to 14 pages) describing original, unpublished research. - Short papers (up to 8 pages) describing original, unpublished research. - Extended abstracts (2-4 pages) of work that has already been published. Proceedings shall be submitted to CEUR-WS.org for online publication. Therefore, all papers should use the CEURART style ( https://eulp.gitlab.io/eulp2026/ceur.zip) Submission Site Papers should be submitted through the dedicated EULP submission system: https://submissions.floc26.org/eulp/ *ORGANIZATION* Mario Alviano, University of Calabria Susana Hahn, University of Potsdam Luis Angel Rodriguez Reiners, University of Calabria Torsten Schaub, University of Potsdam Simon Vandevelde, KU Leuven For any questions regarding the workshop, please contact: s.vandevelde(a)kuleuven.be -- ------------------------------------------------------------------------------------------------------------------ Il banner è generato automaticamente dal servizio di posta elettronica dell'Università della Calabria <https://www.unical.it/5x1000>

1 0

[CFP] HOPE'26: ACM SIGPLAN Workshop on Higher-Order Programming with Effects
by Taro Sekiyama 29 Apr '26

29 Apr '26

TL;DR: Talk proposal deadline for HOPE 2026 is on May 29, 2026. This year, the workshop will be co-located with ICFP'26 (Indiana, US) and FW'26 (Paris, France) ---------------------------------------------------------------------- HOPE 2026 The 14th ACM SIGPLAN Workshop on Higher-Order Programming with Effects August 24, 2026 (the day before ICFP 2026) https://icfp26.sigplan.org/home/hope-2026 HOPE 2026 aims to bring together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. ---------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. We recommend preparing proposals of at most 2 pages excluding references, in either plain text or PDF format. However, we will accept longer proposals or submissions to other conferences, under the understanding that PC members are only expected to read the first two pages of such longer submissions. When submitting talk proposals, authors should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs, Taro Sekiyama (tsekiyama(a)acm.org) and Francesco Gavazzo (francesco.gavazzo(a)unipd.it) Important Note: HOPE’26 will be co-located with ICFP’26 (https://icfp26.sigplan.org/) and FW’26 (https://www.irif.fr/~scherer/events/fpw-2026/announce.html) Presenters can choose either event to attend in-person. We also encourage remote participation and will support remote presentations. Deadline for talk proposals: May 29, 2026 (Friday) Notification of acceptance: June 26, 2026 (Friday) Workshop: August 24, 2026, Indiana, United States & Paris, France (tentatively) The submission website is now open: https://hope26.hotcrp.com --------------------- Workshop Organization --------------------- Program Committee: Yuyan Bao (Augusta University) Raphaëlle Crubillé (Aix-Marseille University) Francesco Dagnino (University of Genova) Elena di Lavore (University of Oxford) Francesco Gavazzo (University of Padua) Cristina Matache (University of Edinburgh) Ken Sakayori (The University of Tokyo) Taro Sekiyama (National Institute of Informatics) Dario Stein (Radboud University) Niels Voorneveld (Cybernetica) Zhixuan Yang (University of Exeter) --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make code harder to build, maintain, and reason about. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help “tame” or “encapsulate” effects (e.g. monads and handlers, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc., to be made available online. -- Taro Sekiyama

1 0

Deadline extension: TERMGRAPH 2026 in FLoC
by Koko Akazaki Muroya 27 Apr '26

27 Apr '26

[Apologies for cross-posting.] TERMGRAPH 2026: 14th International Workshop on Computing with Terms and Graphs Lisbon, Portugal 19 July 2026 (one-day workshop) Part of FLoC 2026 (https:/ www.floc26.org/) **** Extended Deadlines **** - Submission of titles and short abstracts: Wednesday, 6 May 2026 - Submission of extended abstracts: Monday, 11 May 2026 ** Background and History ** Graphs, and graph transformation systems, are used in many areas within Computer Science: to represent data structures and algorithms, to define computation models, as a general modelling tool to study complex systems, etc. Research in term and graph rewriting ranges from theoretical questions to practical implementation issues. Different research areas include: the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the use of graphical frameworks such as interaction nets and sharing graphs (optimal reduction), rewrite calculi for the semantics and analysis of functional programs, graph reduction implementations of programming languages, graphical calculi modelling concurrent and mobile computations, object-oriented systems, graphs as a model of biological or chemical systems, quantum computing, and automated reasoning and symbolic computation systems working on shared structures. Previous editions of TERMGRAPH took place in Barcelona (2002), Rome (2004), Vienna (2006), Braga (2007), York (2009), Saarbrücken (2011), Rome (2013), Vienna (2014), Eindhoven (2016), Oxford (2018), online (2020, planned to be held in Paris), Haifa (2022), and Luxembourg (2024). The permanent TERMGRAPH website (http://www.termgraph.org.uk/) has further information. ** Aim ** The aim of this workshop is to bring together researchers working in these different domains, to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. ** Topics of Interest ** Topics of interest include all aspects of term-/graph rewriting (term-graph and graph rewriting) and applications of graph transformations in programming, automated reasoning and symbolic computation. This includes (but is not limited to): - theory of first-order and higher-order term and graph rewriting - graph rewriting in lambda calculus (sharing graphs, optimality) - term-/graph based models of computation - graph grammars - term-/graph based languages and modelling frameworks - term-/graph rewriting tools: -- system descriptions, and case studies - applications of term-/graph rewriting in, and term-/graph rewriting aspects of: -- semantics and implementation of programming languages -- compiler construction -- interaction nets and proof nets -- string diagrams -- software engineering -- automated reasoning and symbolic computation -- functional and logic programming -- pattern recognition -- Machine Learning (Graph Neural Networks) -- bioinformatics -- quantum computing ** Call for Papers ** We invite submissions of extended abstracts of at most 8 pages in EPTCS style (http://style.eptcs.org/) (see also template on Overleaf, https://www.overleaf.com/project/6269b347d5e60853563003ad) This may include, concerning any of the topics above: - original work, - tutorials, - work in progress, - system descriptions of term-/graph rewriting tools. Extended abstracts have to be submitted no later than 27 April 2026 (AoE) electronically (pdf) via the FLoC HotCRP submission site ( https://submissions.floc26.org/termgraph/) Papers will be judged on relevance, originality, correctness, and usefulness. After the workshop, authors of presented extended abstracts will be invited to submit a longer version of their work (a 15-page paper) for the publication of the Workshop Post-Proceedings in EPTCS (Electronic Proceedings in Theoretical Computer Science). These submissions will undergo a second round of refereeing with: - submission deadline in the mid of October 2026, - notification in December 2026, - publication in February 2027. ** Important Dates (AoE) ** - Submission deadlines (extended): - Titles and short abstracts: Wednesday, 6 May 2026 - Extended abstracts: Monday, 11 May 2026 - Notification (extended): Wednesday, 27 May 2026 - Program publication: Wednesday, 3 June 2026 - Final pre-proceedings version due: Thursday, 11 June 2026 - Workshop: 19 July 2026 ** Invited Speakers ** TBA ** Program Committee ** - Koko Muroya, Ochanomizu University, Japan (co-chair) - Kazunori Ueda, Waseda University, Japan (co-chair) - Sandra Alves, University of Porto, Portugal - Clemens Grabmayer, Gran Sasso Science Institute, Italy - Amar Hadzihasanovic, Tallinn University of Technology, Estonia - Makoto Hamana, Kyushu Institute of Technology, Japan - Jens Kosiol, Philipps-Universität Marburg, Germany - Robin Piedeleu, University College London, UK - Chris Poskitt, Singapore Management University, Singapore - Femke van Raamsdonk, Vrije Universiteit Amsterdam, Netherlands - Michele Sevegnani, University of Glasgow, UK ** Contact ** Kazunori Ueda and Koko Muroya (kazunori.ueda.ku(a)gmail.com, kmuroya(a)is.ocha.ac.jp)

1 0