Open position for an assistant professor of Computer Science at LIPN-USPN (Paris) on Logic, Programming and Complexity

General profile : Computer Science
Job profile: Logic, programming, complexity
Research fields : Programming languages theory (syntax and semantics), complexity, proof
assistants and types theory.


Department: Networks and Telecommunications
Location: IUT de Villetaneuse – Villetaneuse Campus
Contact: Yamina Amzal, Head of the R&T department,

Description:The Networks and Telecommunications department (R&T) seeks to recruit an associate professor in the area of computer systems and networks. The R&T department gathers 200 students in its curricula: BUT R&T in classical and apprenticeship modalities, and Professional Bachelor in Computer Networks and Telecommunications (LP MRIT). The candidate will join a dynamic team and will be involved in the different curricula proposed by the department by lecturing, giving exercise courses and practicals. S/he will benefit from the numerous teaching documents and detailed exercises provided by the teaching staff. The person recruited will teach computer systems and networks courses, in particular:

  • System administration (Linux, Windows)
  • Computer networks: basic notions, Ethernet, static and dynamic routing, DNS, etc.

Additional skills or interest in more advanced areas of computer networks or cybersecurity will be
greatly appreciated: networks supervision; networks security infrastructure; attack techniques and
intrusion detection; cyphering.
The person recruited will also take part in the professional supervision (internships, apprenticeships),
pedagogic coordination of courses, and with time will take responsibility of a curriculum.


Laboratory: Laboratoire d’Informatique de Paris Nord (LIPN) – CNRS UMR 7030
Location : Villetaneuse campus
Contact : Frédérique Bassino, Director of LIPN –
Research team : Logic and Verification (LoVe)
Contact : Damiano Mazza, Head of the LoVe team,

Description:The LIPN seeks to hire a Maître‧sse de Conférences (Associate Professor) to strengthen the logic group in its Logic and Verification team (LoVe). The team presently consists of 25 permanent members and is structured in two research groups:

  • Logic, programming theory and complexity;
  • Specification and verification of modular and distributed systems.

This position concerns the first group, which currently comprises 3 PR (Full Professors), 6 MCF (Associate Professors), 1 DR (Senior Researcher), 3 CR (Researchers) and 1 IR (Research Engineer) shared with the second group, as well as 2 post-docs and 8 Ph.D. students, plus 2 additional Ph.D‧ students jointly advised with other labs.

At the national level, the group participate in the activities of the GDR IM (GT Scalp and GT LHC) and the GDR GPL (GT LTP) and has ties with several laboratories in computer science (IRIF, LIX, LIP, LIS,LS2N, LORIA…), mathematics (LAGA in the context of the MathSTIC Federation, I2M, LAMA) and philosophy (IHPST, IRPhiL).

At the international level, the group has stable ties (CNRS International Research Networks) or individual collaborations with several countries (Italy, Denmark, United Kingdom, Estonia, Netherlands, United States…) and has been principal organizer of recent scientific events such as conferences (FSCD 2020, ETAPS 2023) or research schools (Caleidoscope 2019, EPIT 2023…). At present, 2 ANR research grants are led by members of the group, and the group is partner of 2 additional ANR projects.
We seek a MCF (Associate Professor) capable of contributing to the following topics:

  • Programming languages theory: The applicant will develop their research in one of the group’s internationally recognized domains of expertise (linear logic, lambda-calculus, denotational semantics). Additional experience or interest in contemporary topics will be especially appreciated, such as probabilistic programming language semantics or differentiable programming, as well as category theory and its applications to computer science, with the goal of strengthening the group’s specificities on these topics.
  • Complexity: Historically the group has an internationally recognized expertise in quantitative program analysis, especially in implicit computational complexity and quantitative type systems. The group’s research has recently branched out towards the application of “semantic” techniques (realizability, dynamical systems, categorical logic) to traditional fields of computational complexity, such as algebraic complexity and descriptive complexity. We seek applicants able to contribute to any one of these topics, pointing out that they will benefit from the “Complexity” group that has recently been created at LIPN, a transversal research group that fosters interactions between members of other teams of the laboratory working on complexity-related topics (the combinatorics team and the combinatorial optimization team).
  • Proof assistants and type theory: This topic is not among the main ones of the team, but it is nevertheless potentially federative and likely to stimulate interactions between its members. We seek either applicants with experience in the formalization of proofs of various kinds (program correctness, formalization of mathematical theories…), or applicants who do not work directly with formal proofs but whose research concerns fundamental aspects of proof assistants, in particular type theory and ist semantics.