Logic List Mailing Archive

CfP: HIrCOcervus 2026 – Workshop on Higher-Order Computation in Implicit and Descriptive Complexity, May 26–27, Paris (France)

(Apologies for multiple postings)


=== Call for Participation ===

Workshop on Higher-Order Computation in Implicit and Descriptive Complexity (HIrCOcervus)

26-27 May 2026, IRIF, Université Paris Cité, Paris, France

https://www.irif.fr/hircocervus/index

== About the Workshop =

We would like to create an environment where researchers that have worked in different ways on higher-order computation and descriptive complexity could share not only their results, but also their vision on the topic. It is not always easy to get a landscape of the diverse aspects of the research going on in this field and we hope to contribute to the dissemination of ideas coming from different communities.

== Topics ==

A non exclusive list of aspects of the lambda-calculus that we would like to touch:

- Implicit approaches to higher-order complexity/computability
- Descriptive approaches to (higher-order) complexity/computability
- Higher-order characterizations of automata/transducers
- Open problems
- Applications (e.g. to security, cryptography, real analysis …)

== Important dates ==

- Workshop: 26-27 May 2026

== Registration ==

The participation to the workshop is free, but if you would like to participate we kindly ask you to fill the following form before April 24th:

https://framaforms.org/higher-order-computation-in-implicit-and-descriptive-complexity-1774624196

== Travel grants ==

Thanks to our sponsors we have the possibility of offering some travel grants to people that do not have other sources of funding. Please use the registration form to apply for funding. We will follow up with you after the deadline.


== Talks ==

- Manon Blanc (ITU of Copenhagen). Robust Dynamical Systems: the reachability relation is PSPACE^2-complete.
- Thomas Colcombet (IRIF, Université Paris Cité, CNRS). Finite state computations and simply-typed lambda-calculus.
- Ugo Dal Lago (Università di Bologna and Inria). (Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography.
- Lê Thành Dũng (Tito) Nguyễn (LIS, Aix Marseille Université, CNRS).
Introduction to implicit automata and higher-order transducers.
- Arnaud Durand (IMJ-PRG, Université Paris Cité. Capturing complexity classes through the lens of discrete ordinary differential equations:
a survey.
- Antti Kuusisto (Tampere University). Logical characterizations of neural architectures via floats and reals.
- Florent Madelaine (LACL, Université Paris-Est Créteil). Revisiting the tetrachotomy of Model checking positive First-order logic without equality.
- Damiano Mazza (LIPN, Université Sorbonne Paris Nord, CNRS). A categorical approach to descriptive complexity.
- Isabel Oitavem (Universidade NOVA de Lisboa). Recursion Schemes in the Monotone Setting.
- Charles Paperman (CRIStAL, Université de Lille). Descriptive complexity of the lower level of circuit complexity classes.
- Romain Péchoux (LORIA, Université de Lorraine). Implicit characterizations of second-order polynomial time.
- Sylvain Salvati (CRIStAL, Université de Lille, Inria). TBA
- David Baelde (IRISA, ENS Rennes). TBA


== Chairs ==

- Melissa Antonelli (CFvW, Universität Tübingen)
- Gabriele Vanoni (IRIF, Université Paris Cité)

== Local organizer ==

- Hugo Férée (IRIF, Université Paris Cité)
- Lorenzo Tortora de Falco (Università di Roma Tre)
- Gabriele Vanoni (IRIF, Université Paris Cité)

== Sponsors ==

- Faculté des Sciences de l'Université Paris Cité
- French Institute in Finland, the French Ministry of Research and the Finnish Society of Sciences and Letters
- Label scientifique de l’Université Franco Italienne
--
[LOGIC] mailing list, provided by DLMPST
More information (including information about subscription management) can
be found here: http://dlmpst.org/pages/logic-list.php