----------------------------------------------------------------------
**
** **** CALL FOR PARTICIPATION ****
**
** HOR 2023 - 11th International Workshop on Higher-Order Rewriting
** 4 July 2023
** Rome, Italy
**
** https://hor2023.github.io/
----------------------------------------------------------------------
**
** HOR 2023 is affiliated with FSCD 2023
** https://easyconferences.eu/fscd2023/
**
----------------------------------------------------------------------
* OVERVIEW
HOR is a forum to present work concerning all aspects of higher-order
rewriting.
HOR aims to provide an informal and friendly setting to discuss recent
work and work in progress concerning higher-order rewriting, broadly
construed. This includes rewriting systems that have functional
variables or bound variables, the lambda-calculus and combinatory
logic being paradigmatic examples.
----------------------------------------------------------------------
** REGISTRATION
----------------------------------------------------------------------
The registration page for FSCD 2023 and affiliated events, such as
HOR 2023, is available here:
https://easyconferences.eu/fscd2023/registration1/
The early registration deadline is *** 31 May 2023 ***.
Attending HOR 2023 is possible both in-person and remotely.
----------------------------------------------------------------------
** INVITED SPEAKER
----------------------------------------------------------------------
Pablo Barenbaum – Universidad de Buenos Aires, Argentina
----------------------------------------------------------------------
** ACCEPTED PAPERS
----------------------------------------------------------------------
The list of accepted papers is available here:
https://hor2023.github.io/#accepted
----------------------------------------------------------------------
** COMMITTEES
----------------------------------------------------------------------
** PROGRAM COMMITTEE
* Takahito Aoto - Niigata University, Japan
* Maribel Fernández - King's College London, United Kingdom
* Carsten Fuhs (Chair) - Birkbeck, University of London, United Kingdom
* Delia Kesner - Université Paris 7, France
* Cynthia Kop - Radboud Universiteit Nijmegen, The Netherlands
* Damiano Mazza - Université Paris 13, France
----------------------------------------------------------------------
** STEERING COMMITTEE
* Delia Kesner, Université Paris 7, France
* Femke van Raamsdonk, Vrije Universiteit, The Netherlands
Dear all,
the paper deadline for WST is extended by one week. Please still submit
the title and abstract by June 1! I apologize for the late decision.
Best regards,
Akihisa
======================================================================
WST 2023 - Call for Papers
19th International Workshop on Termination
https://termination-portal.org/wiki/WST2023
August 24-25, 2023, Obergurgl, Austria
Co-located with 12th International Workshop on Confluence (IWC 2023)
======================================================================
The Workshop on Termination (WST) traditionally brings together, in an
informal setting, researchers interested in all aspects of
termination, whether this interest be practical or theoretical,
primary or derived. The workshop also provides a ground for
cross-fertilization of ideas from the different communities interested
in termination (e.g., working on computational mechanisms, programming
languages, software engineering, constraint solving, etc.). The
friendly atmosphere enables fruitful exchanges leading to joint
research and subsequent publications.
IMPORTANT DATES:
* title and abstract: June 1, 2023
* paper submission: June 8, 2023
* notification: June 15, 2023
* final version due: July 27, 2023
* workshop: August 24-25, 2023
INVITED SPEAKER:
Benjamin Kaminski, Saarland University
https://quave.cs.uni-saarland.de/benjamin-kaminski/
TOPICS:
The 19th International Workshop on Termination welcomes contributions
on all aspects of termination. In particular, papers investigating
applications of termination (for example in complexity analysis,
program analysis and transformation, theorem proving, program
correctness, modeling computational systems, etc.) are very welcome.
Topics of interest include (but are not limited to):
* termination and complexity analysis in any domain (declarative
programming, lambda calculus, procedural programming, rewriting,
transition systems, etc.)
* probabilistic termination, termination probability and expected
complexity analysis
* abstraction methods in termination analysis
* certification of termination and complexity proofs
* challenging termination problems
* comparison and classification of termination methods
* implementation of termination analysis methods
* non-termination analysis and loop detection
* normalization and infinitary normalization
* operational termination of logic-based systems
* ordinal notation and subrecursive hierarchies
* SAT, SMT, and constraint solving for (non-)termination analysis
* scalability and modularity of termination methods
* well-founded relations and well-quasi-orders
SUBMISSION GUIDELINES:
Submissions are short papers/extended abstracts which should not
exceed 5 pages. There will be no formal reviewing. In particular, we
welcome short versions of recently published articles and papers
submitted elsewhere. The program committee checks relevance and
provides additional feedback for each submission. The accepted papers
will be made available electronically before the workshop.
Papers should be submitted electronically via the submission page:
https://easychair.org/conferences/?conf=wst2023
Please, use LaTeX and the LIPIcs style file
https://www.dagstuhl.de/en/publishing/series/details/LIPIcs
to prepare your submission.
PROGRAM COMMITTEE:
* Martin Avanzini, INRIA Sophia Antipolis
* Florian Frohn, RWTH Aachen
* Carsten Fuhs, Birkbeck, U. London
* Raúl Gutiérrez, U. Politécnica de Madrid
* Étienne Payet, U. La Réunion
* Albert Rubio, Complutense U. Madrid
* René Thiemann, U. Innsbruck
* Deivid Vale, Radboud U. Nijmegen
* Johannes Waldmann, HTWK Leipzig
* Akihisa Yamada, AIST Tokyo Waterfront (chair)
--
山田晃久
国立研究開発法人 産業技術総合研究所
サイバーフィジカルセキュリティ研究センター
インフラ防護セキュリティ研究チーム 主任研究員
携帯 070-4836-5835
電話 029-861-4112 / 050-3659-4906 内線 222-54112
*Termination and Complexity Competition 2023*
http://www.termination-portal.org/wiki/Termination_Competition_2023
*Call for Participation*
Since the beginning of the millennium, many research groups developed tools
for fully automated termination and complexity analysis.
After a tool demonstration at the 2003 Termination Workshop in Valencia,
the community decided to start an annual termination competition to spur
the development of tools and termination techniques.
The termination and complexity competition focuses on automated termination
and complexity analysis for all kinds of programming paradigms, including
categories for term rewriting, imperative programming, logic programming,
and functional programming. In all categories, we also welcome the
participation of tools providing certifiable proofs. The goal of the
termination and complexity competition is to demonstrate the power of the
leading tools in each of these areas.
The competition will be affiliated with the 19th International Workshop on
Termination (WST 2023, https://termination-portal.org/wiki/WST2023). It
will be run on the StarExec platform (https://www.starexec.org/). The final
run and a presentation of the final results will be live at WST.
All (co-)authors of tools or benchmarks are invited (but not required) to
give a 5-20min presentation of their contributions at the Workshop on
Termination on August 24-25, 2022. We ask for a title and abstract by June
15, and anyone who sends this in may additionally submit a 1-4 page paper
by July 1, to be included in the WST proceedings (but this is not
mandatory). Please use the following URL for your WST submission:
https://easychair.org/conferences/?conf=wst23
We strongly encourage all developers of termination and complexity analysis
tools to participate in the competition. We also welcome the submission of
termination and complexity problems, especially problems that come from
applications.
A category is only run in the competition if there are at least 2
participants and at least 40 examples for this category in the underlying
termination problem data base. If there is no category that is convenient
for your tool, you can contact the organizers, since other categories can
be considered as well if enough participants are guaranteed.
For further information, we refer to the website of the termination and
complexity competition:
https://termination-portal.org/wiki/Termination_Competition_2023
*Important dates*
- Title and Abstract Submission to WST: June 15, 2023
- (Optional) Paper Submission to WST: July 1, 2023
- Tool and Benchmark Submission: August 6, 2023
- First Run: August 13, 2023
- Bugfix Deadline: August 20, 2023
- Final Run: August 24, 2023
- WST: August 24-25, 2023
==============================================================================
CALL FOR PARTICIPATION
Eighth International Conference on
Formal Structures for Computation and Deduction (FSCD 2023)
July 3-6, 2023, Rome, Italy
https://easyconferences.eu/fscd2023/
OVERVIEW
--------
FSCD (https://fscd-conference.org/) covers all aspects of formal
structures for computation and deduction from theoretical foundations to
applications. Building on two communities, RTA (Rewriting Techniques and
Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD
embraces their core topics and broadens their scope to closely related
areas in logic, models of computation, semantics and verification in new
challenging areas.
REGISTRATION
---------------
The registration page is already open and linked from:
https://easyconferences.eu/fscd2023/registration1/
This link should be used also to register for affiliated workshops.
The early registration deadline is *** May 31, 2023 ***.
Attending FSCD 2023 is possible both in-person and remotely. FSCD 2023
is co-located with CADE-29 (July 1-4, 2023), and special rates are
available for joint registration to both conferences.
INVITED SPEAKERS
----------------
Titles and abstracts:
https://easyconferences.eu/fscd2023/keynote-speakers/
- Maribel Fernández (Joint FSCD-CADE), King’s College London
- Mateja Jamnik (Joint FSCD-CADE), University of Cambridge
- Giulio Manzonetto, LIPN&CNRS, Université Sorbonne Paris Nord
- Akihisa Yamada, Cyber Physical Security Research Center, National
Institute of Advanced Industrial Science and Technology (AIST)
ACCEPTED PAPERS
---------------
The list of accepted papers is here:
https://easyconferences.eu/fscd2023/accepted-papers-2/
CO-LOCATION AND AFFILIATED WORKSHOPS
------------------------------------
FSCD 2023 is co-located with CADE-29:
https://easyconferences.eu/cade2023/
The following workshops are affiliated with FSCD and CADE in 2023:
https://easyconferences.eu/fscd2023/satellite-events/
- WIL: 7th Workshop Women in Logic (July 1, 2023)
- WPTE: 10th International Workshop on Rewriting Techniques for
Program Transformations and Evaluation (July 1, 2023)
- TLLA: 7th International Workshop on Trends in Linear Logic and
Applications (July 1-2, 2023)
- LSFA: 8th Logical and Semantic Frameworks with Applications (July
1-2, 2023)
- DCM: 13th International Workshop on Developments in Computational
Models (July 2, 2023)
- LFMTP: International Workshop on Logical Frameworks and
Meta-Languages: Theory and Practice (July 2, 2023)
- UNIF: 37th International Workshop on Unification (July 2, 2023)
- CASC: The CADE ATP System Competition (July 3, 2023)
- HOR: 11th International Workshop on Higher-Order Rewriting (July 4,
2023)
- IFIP WG 1.6: Annual Meeting of IFIP Working Group 1.6 on Rewriting
(July 5, 2023)
- ADeMaL: Automated Deduction for Machine Learning (July 5, 2023)
- ThEdu: Theorem proving components for Educational software (July 5,
2023)
- Vampire: 7th Vampire Workshop (July 5, 2023)
- SMT: 21st International Workshop on Satisfiability Modulo Theories
(July 5-6, 2023)
PROGRAM COMMITTEE CHAIRS
------------------------
Marco Gaboardi, Boston University
Femke van Raamsdonk, Vrije Universiteit Amsterdam
PROGRAM COMMITTEE
-----------------
Martin Avanzini, INRIA
Patrick Bahr, ITU Copenhagen
Pablo Barenbaum, University of Quilmes (CONICET) & ICC
Filippo Bonchi, University of Pisa
Sabine Broda, University of Porto
Valeria De Paiva, Topos Institute
Andrej Dudenhefner, TU Dortmund
Santiago Escobar, Universitat Politècnica de València
Claudia Faggian, University of Paris (IRIF)
Frank (Peng) Fu, Dalhousie University
Silvio Ghilardi, University of Milano
Clemens Grabmayer, GSSI or Gran Sasso Science Institute
Nao Hirokawa, JAIST
Mirai Ikebuchi, National Institute of Informatics
Ambrus Kaposi, Eotvos Lorand University
Ian Mackie, University of Sussex
Radu Mardare, University of Strathclyde
Aart Middeldorp, University of Innsbruck
Anders Mortberg, University of Stockholm
Daniele Nantes-Sobrinho, Imperial College London / University of Brasília
Vincent van Oostrom, Independent researcher
Grigore Rosu, University of Illinois Urbana-Champaign
Luca Roversi, University of Torino
Aleksy Schubert, University of Warsaw
Jakob G. Simonsen, University of Copenhagen
Alwen Tiu, Australian National University
Valeria Vignudelli, CNRS/ENS Lyon
Johannes Waldmann, HTWK Leipzig
Sarah Winkler, University of Bolzano
CONFERENCE CHAIR
----------------
Daniele Gorla, University of Rome - Sapienza
WORKSHOP CHAIR
--------------
Ivano Salvo, University of Rome - Sapienza
STEERING COMMITTEE WORKSHOP CHAIR
---------------------------------
Cynthia Kop, Radboud University Nijmegen
STEERING COMMITTEE PUBLICITY CHAIR
----------------------------------
Carsten Fuhs, Birkbeck, University of London
FSCD STEERING COMMITTEE
-----------------------
Zena Ariola, University of Oregon
Alejandro Díaz-Caro, Quilmes University & ICC/CONICET
Amy Felty, University of Ottawa
Carsten Fuhs, Birkbeck, University of London
Herman Geuvers (Chair), Radboud University Nijmegen
Silvia Ghilezan, University of Novi Sad
Jürgen Giesl, RWTH Aachen University
Stefano Guerrini, Université de Paris 13
Delia Kesner, Université de Paris Diderot
Naoki Kobayashi, University of Tokyo
Cynthia Kop, Radboud University Nijmegen
Luigi Liquori, Inria
Daniele Nantes, Imperial College London / University of Brasília
Looking forward to seeing you in Rome!
==============================================================================
======================================================================
WST 2023 - Call for Papers
19th International Workshop on Termination
https://termination-portal.org/wiki/WST2023
August 24-25, 2023, Obergurgl, Austria
Co-located with 12th International Workshop on Confluence (IWC 2023)
======================================================================
The Workshop on Termination (WST) traditionally brings together, in an
informal setting, researchers interested in all aspects of
termination, whether this interest be practical or theoretical,
primary or derived. The workshop also provides a ground for
cross-fertilization of ideas from the different communities interested
in termination (e.g., working on computational mechanisms, programming
languages, software engineering, constraint solving, etc.). The
friendly atmosphere enables fruitful exchanges leading to joint
research and subsequent publications.
IMPORTANT DATES:
* submission deadline: June 1, 2023
* notification: June 15, 2023
* final version due: July 27, 2023
* workshop: August 24-25, 2023
INVITED SPEAKER:
Benjamin Kaminski, Saarland University
https://quave.cs.uni-saarland.de/benjamin-kaminski/
TOPICS:
The 19th International Workshop on Termination welcomes contributions
on all aspects of termination. In particular, papers investigating
applications of termination (for example in complexity analysis,
program analysis and transformation, theorem proving, program
correctness, modeling computational systems, etc.) are very welcome.
Topics of interest include (but are not limited to):
* termination and complexity analysis in any domain (declarative
programming, lambda calculus, procedural programming, rewriting,
transition systems, etc.)
* probabilistic termination, termination probability and expected
complexity analysis
* abstraction methods in termination analysis
* certification of termination and complexity proofs
* challenging termination problems
* comparison and classification of termination methods
* implementation of termination analysis methods
* non-termination analysis and loop detection
* normalization and infinitary normalization
* operational termination of logic-based systems
* ordinal notation and subrecursive hierarchies
* SAT, SMT, and constraint solving for (non-)termination analysis
* scalability and modularity of termination methods
* well-founded relations and well-quasi-orders
SUBMISSION GUIDELINES:
Submissions are short papers/extended abstracts which should not
exceed 5 pages. There will be no formal reviewing. In particular, we
welcome short versions of recently published articles and papers
submitted elsewhere. The program committee checks relevance and
provides additional feedback for each submission. The accepted papers
will be made available electronically before the workshop.
Papers should be submitted electronically via the submission page:
https://easychair.org/conferences/?conf=wst2023
Please, use LaTeX and the LIPIcs style file
https://www.dagstuhl.de/en/publishing/series/details/LIPIcs
to prepare your submission.
PROGRAM COMMITTEE:
* Martin Avanzini, INRIA Sophia Antipolis
* Florian Frohn, RWTH Aachen
* Carsten Fuhs, Birkbeck, U. London
* Raúl Gutiérrez, U. Politécnica de Madrid
* Étienne Payet, U. La Réunion
* Albert Rubio, Complutense U. Madrid
* René Thiemann, U. Innsbruck
* Deivid Vale, Radboud U. Nijmegen
* Johannes Waldmann, HTWK Leipzig
* Akihisa Yamada, AIST Tokyo Waterfront (chair)
----------------------------------------------------------------------
Updated information: EXTENDED DEADLINE for submission (9 May 2023 AoE)
----------------------------------------------------------------------
**
** **** FINAL CALL FOR SUBMISSIONS ****
**
** HOR 2023 - 11th International Workshop on Higher-Order Rewriting
** 4 July 2023
** Rome, Italy
**
** https://hor2023.github.io/
----------------------------------------------------------------------
**
** HOR 2023 is affiliated with FSCD 2023
** https://easyconferences.eu/fscd2023/
**
----------------------------------------------------------------------
* OVERVIEW
HOR is a forum to present work concerning all aspects of higher-order
rewriting.
HOR aims to provide an informal and friendly setting to discuss recent
work and work in progress concerning higher-order rewriting, broadly
construed. This includes rewriting systems that have functional
variables or bound variables, the lambda-calculus and combinatory
logic being paradigmatic examples.
* TOPICS
The following is a non-exhaustive list of topics for the workshop:
- Applications: proof checking, theorem proving, generic
programming, declarative programming, program transformation,
automated termination/confluence/equivalence analysis tools.
- Foundations: pattern matching, unification, strategies, narrowing,
termination, syntactic properties, type theory, complexity of
derivations.
- Frameworks: term rewriting, conditional rewriting, graph
rewriting, net rewriting, comparisons of different frameworks.
- Implementation: explicit substitution, rewriting tools,
compilation techniques.
- Semantics: semantics of higher-order rewriting, categorical
rewriting, higher-order abstract syntax, games and rewriting.
----------------------------------------------------------------------
** SUBMISSION GUIDELINES
----------------------------------------------------------------------
To give a presentation at the workshop, please submit an extended
abstract (between 2 to 5 pages) via Easychair:
https://easychair.org/conferences/?conf=hor2023
Please use LaTeX and the Easychair style to prepare your submission:
https://easychair.org/publications/easychair.zip
HOR is a platform for discussing open questions, ongoing research,
and new perspectives, as well as new results. Extended abstracts
describing work in progress, preliminary results, research projects,
or problems in higher-order rewriting are very welcome. Specifically,
short versions of recently published papers are welcome, and
submission to HOR does not preclude formal publication at other
venues.
The workshop has informal electronic proceedings that will be made
available on the workshop website.
----------------------------------------------------------------------
** IMPORTANT DATES
----------------------------------------------------------------------
* Submission deadline: 9 May 2023 (extended)
* Notification: 29 May 2023 (not changed)
* Final version: 12 June 2023 (not changed)
----------------------------------------------------------------------
** COMMITTEES
----------------------------------------------------------------------
** PROGRAM COMMITTEE
* Takahito Aoto - Niigata University, Japan
* Maribel Fernández - King's College London, United Kingdom
* Carsten Fuhs (Chair) - Birkbeck, University of London, United Kingdom
* Delia Kesner - Université Paris 7, France
* Cynthia Kop - Radboud Universiteit Nijmegen, The Netherlands
* Damiano Mazza - Université Paris 13, France
----------------------------------------------------------------------
** STEERING COMMITTEE
* Delia Kesner, Université Paris 7, France
* Femke van Raamsdonk, Vrije Universiteit, The Netherlands
----------------------------------------------------------------------
** CONTACT
----------------------------------------------------------------------
All questions about submissions should be emailed to the PC chair
Carsten Fuhs (hor2023 at easychair.org)
----------------------------------------------------------------------
Updated information: EXTENDED DEADLINE for submission (9 May 2023 AoE)
----------------------------------------------------------------------
**
** **** FINAL CALL FOR SUBMISSIONS ****
**
** HOR 2023 - 11th International Workshop on Higher-Order Rewriting
** 4 July 2023
** Rome, Italy
**
** https://hor2023.github.io/
----------------------------------------------------------------------
**
** HOR 2023 is affiliated with FSCD 2023
** https://easyconferences.eu/fscd2023/
**
----------------------------------------------------------------------
* OVERVIEW
HOR is a forum to present work concerning all aspects of higher-order
rewriting.
HOR aims to provide an informal and friendly setting to discuss recent
work and work in progress concerning higher-order rewriting, broadly
construed. This includes rewriting systems that have functional
variables or bound variables, the lambda-calculus and combinatory
logic being paradigmatic examples.
* TOPICS
The following is a non-exhaustive list of topics for the workshop:
- Applications: proof checking, theorem proving, generic
programming, declarative programming, program transformation,
automated termination/confluence/equivalence analysis tools.
- Foundations: pattern matching, unification, strategies, narrowing,
termination, syntactic properties, type theory, complexity of
derivations.
- Frameworks: term rewriting, conditional rewriting, graph
rewriting, net rewriting, comparisons of different frameworks.
- Implementation: explicit substitution, rewriting tools,
compilation techniques.
- Semantics: semantics of higher-order rewriting, categorical
rewriting, higher-order abstract syntax, games and rewriting.
----------------------------------------------------------------------
** SUBMISSION GUIDELINES
----------------------------------------------------------------------
To give a presentation at the workshop, please submit an extended
abstract (between 2 to 5 pages) via Easychair:
https://easychair.org/conferences/?conf=hor2023
Please use LaTeX and the Easychair style to prepare your submission:
https://easychair.org/publications/easychair.zip
HOR is a platform for discussing open questions, ongoing research,
and new perspectives, as well as new results. Extended abstracts
describing work in progress, preliminary results, research projects,
or problems in higher-order rewriting are very welcome. Specifically,
short versions of recently published papers are welcome, and
submission to HOR does not preclude formal publication at other
venues.
The workshop has informal electronic proceedings that will be made
available on the workshop website.
----------------------------------------------------------------------
** IMPORTANT DATES
----------------------------------------------------------------------
* Submission deadline: 9 May 2023 (extended)
* Notification: 29 May 2023 (not changed)
* Final version: 12 June 2023 (not changed)
----------------------------------------------------------------------
** COMMITTEES
----------------------------------------------------------------------
** PROGRAM COMMITTEE
* Takahito Aoto - Niigata University, Japan
* Maribel Fernández - King's College London, United Kingdom
* Carsten Fuhs (Chair) - Birkbeck, University of London, United Kingdom
* Delia Kesner - Université Paris 7, France
* Cynthia Kop - Radboud Universiteit Nijmegen, The Netherlands
* Damiano Mazza - Université Paris 13, France
----------------------------------------------------------------------
** STEERING COMMITTEE
* Delia Kesner, Université Paris 7, France
* Femke van Raamsdonk, Vrije Universiteit, The Netherlands
----------------------------------------------------------------------
** CONTACT
----------------------------------------------------------------------
All questions about submissions should be emailed to the PC chair
Carsten Fuhs (hor2023 at easychair.org)