[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]
RAPIDO -- Reasoning And Programming with Infinite Data-Objects.
(http://www.irif.fr/~saurin/RAPIDO)
* postdoc positions in RAPIDO project:
We are opening a post-doc position in RAPIDO project, which is aimed
at studying logical methods and tools for enhancing reasoning and
programming on infinite data.
The post-doc would start sometimes during the fall 2018 (start date
between october 2018 and january 2019).
RAPIDO is an ANR-funded project hosted at Paris Diderot University
involving researchers from three french labs: IRIF (Univ Paris Diderot),
LIP (ENS Lyon) and LSV (ENS Paris Saclay). It is coordinated by Alexis
Saurin (IRIF lab, sau...@irif.fr) and the post-doc position will
administratively be hosted by Paris Diderot University.
RAPIDO aims at gathering young researchers to investigate the
applicability of proof-theoretical methods to reason and program on
infinite data objects. The goal of the project is to develop logical
systems capturing infinite proofs (proof systems with least and greatest
fixed points as well as infinitary proof systems), to design and to study
programming languages for manipulating infinite data such as streams both
from a syntactical and semantical point of view. Moreover, the ambition of
the project is to apply the fundamental results obtained from the proof-
theoretical investigations (i) to the development of software tools
dedicated to the reasoning about programs computing on infinite data,
e.g. stream programs (more generally coinductive programs), and (ii) to
the study of properties of automata on infinite words and trees from a
proof-theoretical perspective with an eye towards model-checking problems.
* Topics and requirements for applicants
We are looking for young researchers who can contribute to the research
topics of RAPIDO. Candidates should hold a PhD in computer science or a
closely related field (or be close to complete their PhD) with skills in
formal methods and logic and a strong expertise in at least one of the
following topics:
*********
automata theory, coinduction, cyclic and infinitary
proofs, denotational semantics, functional programming,
games and game semantics, infinitary rewriting, lazy
evaluation, linear logic, MSO logic, proof assistants,
proof theory, realizability, streams, temporal logics.
*********
We will be particularly interested in applications of candidates having
an experience using the Coq proof assistant, but this is not a
requirement for applying!
* Important dates:
Informal enquiries: as soon as possible
Application deadlines: july 18th 2018
Starting date: between october 2018 and january 2019.
* Application submission guidelines
Applications should be sent to Alexis Saurin before July 18th 2018
in an email entitled "RAPIDO postdoc application", providing:
- a detailed CV with a publication list,
- a research statement of at most two pages plus bibliography,
- and one or two recommendation letters.
Potential candidates are strongly encouraged to contact the project
coordinator (together with other project members) for informal
enquiries as soon as the announcement is released, and at least when
*starting* preparing their application (for info on topics such as starting
dates, connections with project sites, salary...).
More informations on the post-doc position available at:
https://www.irif.fr/~saurin/RAPIDO/files/post-doc-announcement-2018.txt
Best,
Alexis
--
Alexis Saurin
CNRS researcher, IRIF
