Dear all,
at the last WST, there were some discussions about the input format for
TRSs. My takeaway was that not everyone is happy with the current XML
format. So we (the TermComp SC) recently started to discuss whether the
format should be changed. As far as I can see, there are three obvious
options:
(a) keep the current format
Pro: no work
Contra: not human readable
(b) go back to the old format [1] (here's [2] an example)
Pro:
- human readable
- the same format is used for other categories (e.g., Complexity of
ITSs and Termination of Integer TRSs)
- some tools can still parse it
Contra: There were some issues with the semantics, in particular if
there were several VAR sections. However, from my understanding, these
issues can be resolved by forbidding more than one VAR section.
(c) a new S-expression based format has been proposed for the confluence
competition [3]
Pro: human readable(?)
Contra: no tool can parse it yet
So if you compete, or are interested in, the TRS categories at TermComp,
please let us know what you think. I'm also particularly interested in
the following questions:
- If you participate, can your tool still parse the old format?
- Do you recall more details about the reasons for the switch from the
old format to the current one?
A related (but mostly independent) question is whether we should
separate the properties to be analyzed (full vs innermost rewriting,
termination vs complexity etc.) from the actual TRS. That could avoid a
lot of redundancy in the TPDB. If you have an opinion on that, please
share it.
Thanks,
Florian
[1] https://www.lri.fr/~marche/tpdb/format.html
[2] https://aprove.informatik.rwth-aachen.de/interface/v-AProVE2023/trs_wst
[3] http://cl-informatik.uibk.ac.at/iwc/2023/proceedings.pdf, page 32
Formal Structures for Computation and Deduction (FSCD)
Steering Committee Membership Election 2024
CALL FOR NOMINATION
The FSCD SC consists of the SC Chair, 6 elected members, PC Chairs of
the last 3 years, the Publicity Chair, Workshop Chair and former SC
Chair. Every year the outgoing elected SC members are replaced by new
members elected by a secret ballot. Each SC member normally serves for
3 years, unless exceptions apply (see the FSCD Rules of Business
http://fscd-conference.org/organization/rules-of-business/
for details). Note that past SC members are allowed to run for SC
membership again. The current steering committee composition, together
with the serving time for each member, is available here:
https://fscd-conference.org/organization/steering-committee/
Candidates for SC membership are requested to email the FSCD SC Chair
an election statement (including a brief bio) on one a4 page,
preferably in PDF, no later than
* Friday 21 June 2024 (AoE) *
The election statements will be posted on the FSCD webpage before the
start of FSCD 2024. The election will take place at the General
Meeting of FSCD 2024, 10-13 July 2024.
Herman Geuvers
herman at cs.ru.nl
FSCD SC Chair
==============================================================================
CALL FOR PARTICIPATION
Ninth International Conference on
Formal Structures for Computation and Deduction (FSCD 2024)
July 10-13, 2024, Tallinn, Estonia
https://fscd-conference.org/2024
FSCD 2024 will be co-located with ICALP 2024 and LICS 2024.
https://compose.ioc.ee/icalp2024/https://lics.siglog.org/lics24/
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 for the conferences is already open and linked from:
https://compose.ioc.ee/icalp2024/#registration
This link should be used also to register for affiliated workshops.
The early registration deadline is *** May 17, 2024 ***.
FSCD 2024 is co-located with ICALP 2024 (July 8-12, 2024) and LICS 2024
(July 8-11, 2024), and special rates are available for joint
registration to the conferences.
INVITED SPEAKERS
----------------
Information about the invited speakers is here:
https://compose.ioc.ee/icalp2024/#invited
- Delia Kesner, Université Paris Cité
- Bettina Könighofer, TU Graz
- Sebastian Ullrich, Lean FRO
- Stephanie Weirich, University of Pennsylvania (joint ICALP/LICS/FSCD
speaker)
ACCEPTED PAPERS
---------------
The list of accepted papers is here:
https://cs.ioc.ee/fscd24/accepted.html
AFFILIATED WORKSHOPS
--------------------
The following workshops are affiliated with FSCD, ICALP, and LICS in 2024:
https://compose.ioc.ee/icalp2024/#workshops
- Parameterized Approximation Algorithms Workshop (PAAW 2024) - July
6, 2024
- Trends in Arithmetic Theories (TAT 2024) - July 6, 2024
- Geometric and Topological Methods in Computer Science (GETCO 2024) -
July 6-7, 2024
- Algorithmic Aspects of Temporal Graphs VII (AATG 2024) - July 7, 2024
- Learning and Automata (LearnAut 2024) - July 7, 2024
- Logic Mentoring Workshop (LMW 2024) - July 7, 2024
- Parameterized Algorithms and Constraint Satisfaction (PACS 2024) -
July 7, 2024
- Structure meets Power (SmP 2024) - July 7, 2024
- Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP
2024) - July 8, 2024
- Mathematically Structured Functional Programming (MSFP 2024) - July
8, 2024
- Eighth International Workshop on Trends in Linear Logic and
Applications (TLLA 2024) - July 8-9, 2024
- Intersection Types and Related Systems (ITRS 2024) - July 9, 2024
- International Workshop on Confluence (IWC 2024) - July 9, 2024
- Women in Logic 2024 - July 9, 2024
PROGRAM COMMITTEE CHAIR
-----------------------
Jakob Rehof, TU Dortmund University
PROGRAM COMMITTEE
-----------------
Thorsten Altenkirch, University of Nottingham
Sandra Alves, University of Porto
Takahito Aoto, Niigata University
Mauricio Ayala-Rincón, Brasilia University
Stephanie Balzer, CMU
Thierry Coquand, University of Gothenburg
Alejandro Díaz-Caro, Quilmes National University & CONICET-Buenos Aires
University
Claudia Faggian, CNRS, Université de Paris
Silvia Ghilezan, University of Novi Sad
Simon Gay, University of Glasgow
Cezary Kaliszyk, University of Innsbruck
Ambrus Kaposi, Eötvös Loránd University, Budapest
Dexter Kozen, Cornell University
Dominique Larchey-Wendling, CNRS, Loria
Marina Lenisa, University of Udine
Sonia Marin, University of Birmingham
Naoki Nishida, Nagoya University
Christine Paulin-Mohring, Paris-Saclay University
Pierre-Marie Pédrot, Inria Rennes-Bretagne-Atlantique
Elaine Pimentel, University College London
Jakob Rehof (Chair), TU Dortmund University
Simona Ronchi della Rocca, University of Torino
Sylvain Schmitz, Université Paris Cité
Aleksy Schubert, University of Warsaw
Jakob Grue Simonsen, University of Copenhagen
Kathrin Stark, Heriot-Watt University, Edinburgh
Lutz Straßburger, Inria Saclay
Tachio Terauchi, Waseda University
Sarah Winkler, Free University of Bolzano
CONFERENCE CHAIR
----------------
Niccolò Veltri, Tallinn University of Technology
WORKSHOP CHAIR
--------------
Luigi Liquori, Inria
STEERING COMMITTEE WORKSHOP CHAIR
---------------------------------
Cynthia Kop, Radboud University Nijmegen
PUBLICITY CHAIR
---------------
Carsten Fuhs, Birkbeck, University of London
FSCD STEERING COMMITTEE
-----------------------
Herman Geuvers (Chair), Radboud University Nijmegen
Patrick Baillot, CNRS, Université de Lille
Alejandro Díaz-Caro, Quilmes National University & CONICET-Buenos Aires
University
Amy Felty, University of Ottawa
Carsten Fuhs, Birkbeck, University of London
Marco Gaboardi, Boston University
Jürgen Giesl, RWTH Aachen University
Delia Kesner, Université Paris Cité
Naoki Kobayashi, University of Tokyo
Cynthia Kop, Radboud University Nijmegen
Luigi Liquori, Inria
Giulio Manzonetto, Université Paris-Nord
Daniele Nantes, Imperial College London / University of Brasilia
Femke van Raamsdonk, Vrije Universiteit Amsterdam
We are looking forward to seeing you in Tallinn!
==============================================================================
