[Caml-list] TYPES 2022 First Post-proceeding CfP

[Caml-list] TYPES 2022 First Post-proceeding CfP

[Pierre-Marie Pédrot]

[-- Attachment #1.1: Type: text/plain, Size: 2396 bytes --]

TYPES is a major forum for the presentation of research on all aspects
of type theory and its applications. TYPES 2022 was held from 20 to 25
June at LS2N, University of Nantes, France. The post-proceedings
volume will be published in LIPIcs, Leibniz International Proceedings
in Informatics, an open-access series of conference.

Submission Guidelines

Submission is open to everyone, also to those who did not participate
in the TYPES 2022 conference. We welcome high-quality descriptions of
original work, as well as position papers, overview papers, and system
descriptions. Submissions should be written in English, and being 
original, i.e. neither previously published, nor simultaneously 
submitted to a journal or a conference.

- Papers have to be formatted with the current LIPIcs style and adhere 
to the style requirements of LIPIcs.
- The upper limit for the length of submissions is 20 pages, excluding 
bibliography (but including title and appendices).
- Papers have to be submitted as PDF. A link to the submission system 
will be made available on https://types22.inria.fr/.
- Authors have the option to attach to their submission a zip or tgz 
file containing code (formalised proofs or programs), but reviewers are 
not obliged to take the attachments into account and they will not be 
published.

Deadlines

- Abstract Submission : 31 October 2022 (AoE)
- Paper submission: 30 November 2022 (AoE)
- Author notification: 31 March 2022

List of Topics

The scope of the post-proceedings is the same as the scope of the 
conference: the theory and practice of type theory. In particular, we 
welcome submissions on the following topics:

- Foundations of type theory;
- Applications of type theory (e.g. linguistics or concurrency);
- Constructive mathematics;
- Dependently typed programming;
- Industrial uses of type theory technology;
- Meta-theoretic studies of type systems;
- Proof assistants and proof technology;
- Automation in computer-assisted reasoning;
- Links between type theory and functional programming;
- Formalising mathematics using type theory;
- Homotopy type theory and univalent mathematics.

Editors

Delia Kesner, Université Paris Cité, FR (delia.kesner@irif.fr)
Pierre-Marie Pédrot, INRIA, FR (pierre-marie.pedrot@inria.fr)

Contact

In case of questions, contact the editors directly.

[-- Attachment #2: OpenPGP digital signature --]
[-- Type: application/pgp-signature, Size: 840 bytes --]