<html><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /></head><body style='font-size: 10pt; font-family: Verdana,Geneva,sans-serif'>
<p><br /></p>
<p><br /><span>This is an announcement for three one-year postdoctoral positions funded by the ANR ReCiProg - Reasoning on Circular proofs for Programming, to be hosted in Lyon (LIP), Nantes (LS2N, Gallinette) and Paris (IRIF, PPS).</span></p>
<p><br /><strong>We seek strong candidates holding a PhD in Computer Science or Mathematics, and with expertise in one or several of the following areas:</strong></p>
<ul>
<li class="v1level1">
<div class="v1li">Proof theory</div>
</li>
<li class="v1level1">
<div class="v1li">Curry-Howard correspondence</div>
</li>
<li class="v1level1">
<div class="v1li">Logics with fixed points</div>
</li>
<li class="v1level1">
<div class="v1li">Coinductive reasoning</div>
</li>
<li class="v1level1">
<div class="v1li">Proof assistants (formalization skills or development experience)</div>
</li>
<li class="v1level1">
<div class="v1li">Type theory</div>
</li>
<li class="v1level1">
<div class="v1li">Category theory</div>
</li>
<li class="v1level1">
<div class="v1li">Automated deduction</div>
</li>
<li class="v1level1">
<div class="v1li">Automata theory</div>
</li>
</ul>
<p><span>In relation with the above topics, an experience in one or several of the following topics will be particularly appreciated: fixed-points and circular proofs, the Coq proof assistant, inductive and coinductive types, guarded recursion, coalgebras, inductive and coinductive theorem proving, categorical logic, infinitary term rewriting and infinitary lambda-calculi.</span></p>
<p><br /><br /><strong>The successful candidate will be employed in one of the following French research lab, depending on her/his specific profile and scientific project:</strong></p>
<p><strong><br /></strong><span>- LIP (Plume Team), Lyon (local coordinator: Denis Kuperberg)</span><br /><span>- LS2N (Gallinette Team), Nantes (local coordinator: Guilhem Jaber)</span><br /><span>- IRIF (PPS & Picube Team), Paris (local coordinator: Alexis Saurin)</span></p>
<p><br /></p>
<p><strong>Application process:</strong></p>
<ul class="v1fix-media-list-overlap">
<li class="v1level1">
<div class="v1li">Each potential candidate is advised to <strong>contact the project coordinator and the local coordinators of interest as soon as possible</strong> to express her/his intent to submit an application.</div>
</li>
<li class="v1level1">
<div class="v1li">Deadline for applications is on <span style="text-decoration: underline;"><strong>May 15th</strong></span>, for a <strong>starting date between September 1st 2024 and December 31st 2024</strong>, to be negotiated.</div>
</li>
<li class="v1level1">
<div class="v1li">Candidates should send their application to Alexis Saurin (alexis dot saurin at irif dot fr) with a subject containing <strong>“[RECIPROG post-doc application]“</strong>.</div>
</li>
<li class="v1level1">
<div class="v1li">The application should contain <strong>(i) a CV, (ii) a brief research statement (1-2 pages) & (iii) at least two contacts of reference persons</strong> (or reference letters if available) and it should indicate the site(s) of interest for the application.</div>
</li>
<li class="v1level1">
<div class="v1li">The salary will depend on the successful candidate's prior research experience and of hiring site, with a guaranteed minimum of 2300 EUR/month before taxes.</div>
</li>
<li class="v1level1">
<div class="v1li">Each position is for <strong>a one-year post-doc</strong>.</div>
</li>
</ul>
<p><br /><strong>Project summary:</strong></p>
<p><span>RECIPROG is an ANR collaborative project (aka. PRC) running till the end of 2025 involving french teams in Lyon, Marseille, Nantes and Marseille, which aims at extending the proofs-as-programs correspondence (aka Curry-Howard correspondence) to recursive programs and circular proofs for logics and type systems using induction and coinduction. The project will contribute both to the necessary theoretical foundations of circular proofs and to the software development allowing to enhance the use of coinductive types and coinductive reasoning in the Coq proof assistant, as well as software verification techniques using circular tools.</span><br /><br /><strong>More informations:</strong></p>
<ul>
<li class="v1level1">
<div class="v1li">More informations can be found on the project webpage: <a class="v1urlextern" title="https://www.irif.fr/reciprog/index" href="https://www.irif.fr/reciprog/index" target="_blank" rel="noopener noreferrer">https://www.irif.fr/reciprog/index</a> <span>and <a href="https://www.irif.fr/reciprog/post-doc-offer-paril-2024" target="_blank" rel="noopener noreferrer">https://www.irif.fr/reciprog/post-doc-offer-paril-2024</a></span></div>
</li>
<li class="v1level1">
<div class="v1li">Interested candidates may contact the project coordinator (Alexis Saurin) as well as the local coordinators (Guilhem Jaber, Denis Kuperberg, Luigi Santocanale & Alexis Saurin) to enquire about more specific research directions and the adequacy of their research profile.</div>
</li>
<li class="v1level1">Cross-site projects involving members of the project from different labs are welcome.</li>
<li class="v1level1">There is a one-year funding for each of the three sites of Lyon, Nantes and Paris.</li>
</ul>
<p><br /><span>--</span><br /><span>Alexis Saurin</span><br /><span>IRIF - CNRS, Université Paris-Cité & INRIA</span></p>
<div id="v1_rc_sig"> </div>
</body></html>