Julien Narboux
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Julien Narboux has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Predrag Janičić
Department of Computer Science, Faculty of Mathematics, University of Belgrade, Belgrade, Serbia
6 shared publications - Pierre Boutry
ICube, UMR 7357 CNRS, University of Strasbourg, Illkirch, France
4 shared publications - Gabriel Braun
ICube, UMR 7357, University of Strasbourg - CNRS, Strasbourg, France
2 shared publications - Laure Gonnord
Grenoble INP - LCIS, UGA
2 shared publications - Michael Beeson
San Jose State University
2 shared publications - Sana Stojanović
University of Belgrade
2 shared publications
Latest Publications
- 10 July 2026
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- p. 1-26
Geometry machine revisited
- 10 July 2026
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- p. 1-26
Geometry machine revisited
- 1 January 2026
- Published by Springer Nature
- p. 447-467
A Lean-based Language for Teaching Proof in High School
- 1 January 2026
- Published by Springer Nature
- p. 447-467
A Lean-based Language for Teaching Proof in High School
- Open Access
- 25 May 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 419, 1-27
Proof Assistants for Teaching: a Survey
In parallel to the ever-growing usage of mechanized proofs in diverse areas of mathematics and computer science, proof assistants are used more and more for education. This paper surveys previous work related to the use of proof assistants for (mostly undergraduate) teaching. This includes works where the authors report on their experiments using proof assistants to teach logic, mathematics or computer science, as well as designs or adaptations of proof assistants for teaching. We provide an overview of both tutoring systems that have been designed for teaching proof and proving, or general-purpose proof assistants that have been adapted for education, adding user interfaces and/or dedicated input or output languages.
- 25 May 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 419, 1-27
Open AccessProof Assistants for Teaching: a Survey
In parallel to the ever-growing usage of mechanized proofs in diverse areas of mathematics and computer science, proof assistants are used more and more for education. This paper surveys previous work related to the use of proof assistants for (mostly undergraduate) teaching. This includes works where the authors report on their experiments using proof assistants to teach logic, mathematics or computer science, as well as designs or adaptations of proof assistants for teaching. We provide an overview of both tutoring systems that have been designed for teaching proof and proving, or general-purpose proof assistants that have been adapted for education, adding user interfaces and/or dedicated input or output languages.
- Open Access
- 22 January 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 398, 21-37
Automated Completion of Statements and Proofs in Synthetic Geometry: an Approach based on Constraint Solving
Conjecturing and theorem proving are activities at the center of mathematical practice and are difficult to separate. In this paper, we propose a framework for completing incomplete conjectures and incomplete proofs. The framework can turn a conjecture with missing assumptions and with an under-specified goal into a proper theorem. Also, the proposed framework can help in completing a proof sketch into a human-readable and machine-checkable proof. Our approach is focused on synthetic geometry, and uses coherent logic and constraint solving. The proposed approach is uniform for all three kinds of tasks, flexible and, to our knowledge, unique such approach.
- 22 January 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 398, 21-37
Open AccessAutomated Completion of Statements and Proofs in Synthetic Geometry: an Approach based on Constraint Solving
Conjecturing and theorem proving are activities at the center of mathematical practice and are difficult to separate. In this paper, we propose a framework for completing incomplete conjectures and incomplete proofs. The framework can turn a conjecture with missing assumptions and with an under-specified goal into a proper theorem. Also, the proposed framework can help in completing a proof sketch into a human-readable and machine-checkable proof. Our approach is focused on synthetic geometry, and uses coherent logic and constraint solving. The proposed approach is uniform for all three kinds of tasks, flexible and, to our knowledge, unique such approach.
- 3 July 2023
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 91 (6) , 797-820
Automated generation of illustrated proofs in geometry and beyond
- 3 July 2023
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 91 (6) , 797-820
Automated generation of illustrated proofs in geometry and beyond
- Open Access
Proof assistants for undergraduate mathematics education: elements of an a priori analysis
This paper presents an a priori analysis of the use of six different interactive proof assistants for education, based on the resolution of a typical undergraduate exercise on abstract functions. It proposes to analyze these tools according to three main categories of aspects: language and interaction mode, automation and user assistance, and proof structure and visualization. We argue that this analysis may help formulate and clarify further research questions on the possible impact of such tools on the development of reasoning and proving skills.
Open AccessProof assistants for undergraduate mathematics education: elements of an a priori analysis
This paper presents an a priori analysis of the use of six different interactive proof assistants for education, based on the resolution of a typical undergraduate exercise on abstract functions. It proposes to analyze these tools according to three main categories of aspects: language and interaction mode, automation and user assistance, and proof structure and visualization. We argue that this analysis may help formulate and clarify further research questions on the possible impact of such tools on the development of reasoning and proving skills.
- 20 May 2022
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 66 (4) , 689-746
Theorem Proving as Constraint Solving with Coherent Logic
- 20 May 2022
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 66 (4) , 689-746
Theorem Proving as Constraint Solving with Coherent Logic
- Open Access
- 10 January 2019
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 85 (2-4) , 213-257
Proof-checking Euclid
- 10 January 2019
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 85 (2-4) , 213-257
Open AccessProof-checking Euclid
- Open Access
Axiomes de continuité en géométrie neutre : une étude mécanisée en Coq
Dans cet article, nous présentons les résultats sur la continuité que nous avons obtenus dans le cadre du projet GeoCoq, qui constitue une formalisation en Coq de la géométrie : nous avons défini 11 axiomes de continuité et établi leur hiérarchie. Nos démonstrations ont été formalisées dans le cadre de la géométrie neutre de Tarski en dimension quelconque et de la logique intuitionniste.
Open AccessAxiomes de continuité en géométrie neutre : une étude mécanisée en Coq
Dans cet article, nous présentons les résultats sur la continuité que nous avons obtenus dans le cadre du projet GeoCoq, qui constitue une formalisation en Coq de la géométrie : nous avons défini 11 axiomes de continuité et établi leur hiérarchie. Nos démonstrations ont été formalisées dans le cadre de la géométrie neutre de Tarski en dimension quelconque et de la logique intuitionniste.