Antoine Meyer
- Laboratoire d'Informatique Gaspard-Monge (LIGM)
- Institut de recherche pour l'enseignement des mathématiques et des sciences de Paris (IREMS de Paris)
Publications
Publications
|
|
Proof assistants for undergraduate mathematics education: elements of an a priori analysisInternational Journal of Mathematical Education in Science and Technology, In press, ⟨10.1080/0020739X.2026.2632264⟩ |
|
|
Booléens en programmation : une analyse à destination des enseignantsRecherches et recherches-actions en didactique de l'informatique, 2024, 1, pp.1-33 |
|
|
Rôle d’un logiciel dans la transposition didactique du concept d’algorithme : le cas du logiciel AlgoBox en France et des programmes du lycée entre 2009 et 2019Cahiers d'histoire du Cnam, 2022, L’informatique entre à l’école : vers une histoire de l’enseignement des sciences et techniques informatiques , vol.15 (1), pp. 101-135 |
|
|
Une analyse des exercices d’algorithmique et de programmation du brevet 2017Repères IREM, 2019, 116, pp.47-81 |
|
|
Counting CTLLogical Methods in Computer Science, 2013, 9 (1), pp.3.1-3.34. ⟨10.2168/LMCS-9(1:3)2013⟩ |
|
|
On the Complexity of Membership and Counting in Height-Deterministic Pushdown AutomataJournal of Automata Languages and Combinatorics, 2009, 14 (3/4), p. 211-235 |
|
|
Traces of Term-Automatic GraphsRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42, p. 615-630. ⟨10.1051/ita:2008018⟩ |
|
|
A Logic of Reachable Patterns in Linked Data-StructuresJournal of Logic and Algebraic Programming, 2007, 73 (1-2), p. 111-142. ⟨10.1016/j.jlap.2006.12.001⟩ |
|
|
Linearly bounded infinite graphsActa Informatica, 2006, 43 (4), p. 265-292. ⟨10.1007/s00236-006-0022-z⟩ |
|
|
Context-Sensitive Languages, Rational Graphs and DeterminismLogical Methods in Computer Science, 2006, 2 (2), pp.6. ⟨10.2168/LMCS-2(2:6)2006⟩ |
|
|
La TSD pour des situations d’apprentissage en informatique et à l’interface mathématiques-informatiqueColloque international en hommage à l’œuvre de Guy Brousseau, Jul 2025, Bordeaux, France. pp.144-150 |
|
|
Modèles de mémoire pour l'enseignement de la programmationColloque Didapro 10 sur la Didactique de l’informatique et des STIC, 2024, Louvain-La-Neuve, Belgique. pp.33-43 |
Underlying theories of proof assistants and potential impact on the teaching and learning of proof12th International Workshop on Theorem proving components for Educational software, Julien Narboux; Walther Neuper; Pedro Quaresma, Jul 2023, Rome, Italy |
|
|
|
Situation didactique autour d'un jeu de recherche : expérimentation en classes de NSIL'informatique, objets d'enseignement et d'apprentissage. Quelles nouvelles perspectives pour la recherche ? Actes du colloque DIDAPRO 9, May 2022, Le Mans, France. pp.100-112 |
|
|
Proof assistants for undergraduate mathematics and computer science education: elements of a priori analysisINDRUM 2022: Fourth conference of the International Network for Didactic Research in University Mathematics, Reinhard Hochmuth, Oct 2022, Hanovre, Germany. pp.253-262 |
Collaborative action research: introducing IT in primary schools21e école d'été de didactique des mathématiques, Irem de Paris, Oct 2021, La Rochelle - Ile d'Oléron, France. pp.235-241 |
|
|
|
Analyse didactique d’un jeu de recherche : vers une situation fondamentale pour la complexité d’algorithmes et de problèmesDidapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation, Feb 2020, Lille, France |
|
|
Proof, reasoning and logic at the interface between Mathematics and Computer Science : toward a framework for analyzing problem solvingEleventh Congress of the European Society for Research in Mathematics Education (CERME11), Utrecht University, Feb 2019, Utrecht, Netherlands. pp.284-291 |
|
|
Discrete mathematics at university level. Interfacing mathematics, computer science and arithmeticINDRUM 2018, INDRUM Network, University of Agder, Apr 2018, Kristiansand, Norway. pp.255-264 |
|
|
Counting LTLTIME 2010, Sep 2010, Paris, France. p. 51-58, ⟨10.1109/TIME.2010.20⟩ |
|
|
Counting CTLFoSSaCS 2010, Mar 2010, Paphos, Cyprus. pp.206-220, ⟨10.1007/978-3-642-12032-9_15⟩ |
|
|
On the Complexity of Membership and Counting in Height-Deterministic Pushdown AutomataCSR 2008, Jun 2008, Moscow, Russia. p. 240-251, ⟨10.1007/978-3-540-79709-8_25⟩ |
|
|
Winning regions of higher-order pushdown gamesTwenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), Jun 2008, Pittsburgh, United States. pp.193-204 |
|
|
Traces of Term-Automatic GraphsMathematical Foundations of Computer Science (MFCS), Aug 2007, Cesky Krumlov, Poland. p. 489-500, ⟨10.1007/978-3-540-74456-6_44⟩ |
|
|
A Logic of Reachable Patterns in Linked Data-StructuresFOSSACS 2006, Mar 2006, Vienne, Austria. p. 94-110, ⟨10.1007/11690634_7⟩ |
|
|
Linearly Bounded Infinite GraphsMFCS 2005, Sep 2005, Gdansk, Poland. pp.180-191, ⟨10.1007/11549345_17⟩ |
|
|
On Term Rewriting Systems Having a Rational DerivationFoSSaCS 2004, Mar 2004, Barcelona, Spain. pp.378-392, ⟨10.1007/b95995⟩ |
|
|
Symbolic Reachability Analysis of Higher-Order Context-Free ProcessesFoundations of Software Technology and Theoretical Computer Science (FSTTCS), Nov 2004, Chennai, India. pp.135-147, ⟨10.1007/b104325⟩ |
Discrete mathematics, computer science, logic, proof, and their relationshipsViviane Durand-Guerrier, Reinhard Hochmuth, Elena Nardi, Carl Winslow. Research and Development in University Mathematics Education, 1, Routledge, pp.125-146, 2021, 9780367365387. ⟨10.4324/9780429346859-10⟩ |
|
|
|
Didactical issues at the interface of mathematics and computer scienceProof Technology in Mathematics Research and Teaching, 14, Springer International Publishing, pp.115-138, 2019, Mathematics Education in the Digital Era, ⟨10.1007/978-3-030-28483-1_6⟩ |
|
|
Designing and Comparing RPQ Semantics2026 |
|
|
Une analyse des exercices d'algorithmique et de programmation des DNBCommission inter-IREM informatique. 2023 |
|
|
Graphes infinis de présentation finieInformatique [cs]. Université Rennes 1, 2005. Français. ⟨NNT : ⟩ |