通用代数的理论与实现博士研究员(科研助理,每月2300欧元)

PhD Position F/M Theory and Implementation of Universal Algebra

Inria · 法国 · Lyon

原帖优先:申请材料、截止时间与资格以原帖和学校官方说明为准。

AI 中文速览

研究内容
本研究在Inria Liberabci挑战框架下进行,旨在通过开发便利的接口和理论调整,使Hierarchy Builder、Trocq、重写技术及数学组件等复杂形式化数学工具易于非形式化证明专家使用。工作内容包括研究代数结构的理论方面,使用Rocq、elpi以及可能的Caml编写代码,提交研究论文,并向同行和学生展示研究成果。
申请条件
申请者需持有研究生学位或同等学历,非常熟悉至少一种证明助手(优选基于依赖类型理论的证明助手),具备证明助手的元编程能力,并具备高级英语水平。同时拥有Rocq专业知识、Rocq-ELPI与Hierarchy Builder知识以及Git、GitHub等软件开发工具经验者将受到青睐。
待遇
提供每月2300欧元的税前薪资。福利包括补贴餐食、部分报销公共交通费用、7周带薪年假外加10天RTT额外休息日、可申请远程办公(90天/年)及灵活的工作时间安排、社会文化和体育活动、职业培训机会以及社会保障覆盖。
申请方式
申请必须通过Inria网站在线提交,不保证处理通过其他渠道发送的申请。截止日期为2026年12月10日。

由 gemini-2.5-flash-lite 生成,博士岗判定置信度 100%。

岗位信息

截止
(Europe/Paris) 剩 18 天
学科
计算机科学
合同类型
雇佣合同
原文薪资
EUR 2,300 / 月(税前)
税后月薪(估)
¥13,800;房租后 ¥7,900
估算假设
单身、无子女、雇佣合同的粗略估算,以学校 offer 为准;扣除率 24%;汇率日期 2026-10-01
本站收录
内容更新
入职
2027-01-01
原帖导师候选(待核验)
Cyril Cohen
来源
法国高校与研究机构官方招聘 · 最近核对 2026-11-19
详情核验
判定依据(原文摘录)
  • 确认是博士培养机会
    PhD Position F/M Theory and Implementation of Universal Algebra
  • 英语要求
    Advanced English.
  • 学历要求
    Level of qualifications required : Graduate degree or equivalent
原文

PhD Position F/M Theory and Implementation of Universal Algebra

Download job offer in PDF format

Contract type : Fixed-term contract

Level of qualifications required : Graduate degree or equivalent

Fonction : PhD Position

Level of experience : Recently graduated

About the research centre or Inria department

The Inria research centre in Lyon is the 9th Inria research centre, formally created in January 2022. It brings together approximately 410 people in 20 research teams and research support services.

Its staff are distributed in Villeurbanne, Lyon Gerland, and Saint-Etienne.

The Lyon centre is active in the fields of software, distributed and high-performance computing, embedded systems, quantum computing and privacy in the digital world, but also in digital health and computational biology.

Context

Project

The relai-thèse will take place within the framework of the défi Inria Liberabci , which objectives are to make complex tools such as Hierarchy Builder, Trocq or rewriting, as well as libraries of formalized mathematics such as mathematical components accessible to users that are not specialized in formal proofs (e.g. undergraduate students, math/CS teachers or other peers) via the development of convenient interfaces, needing theoretical adjustments.

Location

The research will be carried out in the LIP laboratory of ENS Lyon under the local supervision of Cyril Cohen , within the CASH team.

Travel expenses are covered within the limits of the scale in force.

Assignment

Assignments

Mathematical objects are often organized in a hierarchical setting. A new theory can often be framed as a generalization or, dually, as a specialization of another one, possibly not in a unique way. A full specification of this taxonomy is, of course, left implicit in mathematical writing, since the author can rely on the reader’s expertise to reconstruct its relevant parts for the argument at hand. In the setting of formalized mathematics through the use of proof assistants and interactive theorem proving, such implicitness is not possible, and a need arises for specification and retrieval of these connections. More specifically, users must be able to introduce and relate abstract theories, extend them with new constructions, and prove relevant theorems. Furthermore, they need the capability to instantiate these theories with concrete models and specialize previously established results. In this work we tackle these challenges from various perspectives. First, in the setting of univalent foundations, we present a development specific to algebraic structures: the Universal Algebra library for UniMath. Second, we describe and present an operational semantics for Hierarchy Builder , a high-level tool for specifying mathematical hierarchies in Roc and conveniently applying results from abstract theories to their models. Lastly, we investigate the relationship between scoped and unscoped syntaxes both from the perspective of Categories with Families and from an implementation perspective.

Main activities

• Figure out theoretical aspect of algebraic structures

• Write code in Rocq, elpi and possibly Caml

• Submit research papers

• Present research activities to peers and students.

Skills

Technical skills and level required

• Know very well at least one proof assistant, preferably one based on dependent type theory.

• Know metaprogramming for proof assistants.

Languages

• Advanced English.

Relational skills

• Communicate about your ideas and results.

• Work autonomously, while talking about strategic decisions with other members of the project.

• Listen to feedback.

Other valued appreciated

• Expertise in Rocq.

• Knowledge of Rocq-ELPI and Hierarchy Builder

• Git, GitHub, and other common software development tools.

Benefits package

• Subsidized meals

• Partial reimbursement of public transport costs

• Leave: 7 weeks of annual leave + 10 extra days off due to RTT (statutory reduction in working hours) + possibility of exceptional leave (sick children, moving home, etc.)

• Possibility of teleworking (90 days / year) and flexible organization of working hours

• Social, cultural and sports events and activities

• Access to vocational training

• Social security coverage

Remuneration

2300 € gross salary / month

Apply for this position

Share

• Facebook

• Linkedin

• Twitter

• Email

General Information

• Theme/Domain : Proofs and Verification

Scientific computing (BAP E)

• Town/city : Lyon

• Inria Center :

Centre Inria de Lyon

• Starting date : 2027-01-01

• Duration of contract : 4 months

• Deadline to apply : 2026-12-10

Warning : you must enter your e-mail address in order to save your application to Inria. Applications must be submitted online on the Inria website. Processing of applications sent from other channels is not guaranteed.

Instruction to apply

Applications must be submitted online via the Inria website. Processing of applications submitted via other channels is not guaranteed.

Defence Security :

This position is likely to be situated in a restricted area (ZRR), as defined in Decree No. 2011-1425 relating to the protection of national scientific and technical potential (PPST).Authorisation to enter an area is granted by the director of the unit, following a favourable Ministerial decision, as defined in the decree of 3 July 2012 relating to the PPST. An unfavourable Ministerial decision in respect of a position situated in a ZRR would result in the cancellation of the appointment.

Recruitment Policy :

As part of its diversity policy, all Inria positions are accessible to people with disabilities.

Contacts

• Inria Team :

CASH

• PhD Supervisor :

Cohen Cyril / cyril.cohen@inria.fr

The keys to success

The candidate should demonstrate an interest in the construction of formalized mathematical libraries and human computer interaction. An extensive user experience of proof assistants is expected as well as a background in human-computer interaction.

About Inria

Inria, the French national institute for research in digital science and technology, supports the French government in national research and innovation strategies in the digital field, acting as Digital Programs Agency. Inria leads over 300 research and innovation projects with its 3,500 scientists, engineers, and support staff, in partnership with universities and the digital ecosystem (businesses, entrepreneurs, and public stakeholders). Together, we explore strategic fields such as artificial intelligence, cybersecurity, quantum computing, cloud technologies, digital transformation in healthcare, digital twins, and digital technologies for defence. We develop practical solutions such as software, tech startups, partnerships with national companies, and cutting-edge training programmes. Our goal is to drive scientific, technological, and industrial excellence to ensure France’s digital sovereignty.

信息有误?提交纠错