FR
Antoine MEYER
Champs-sur-Marne
Bâtiment: Building: Copernic
Bureau: Office: 4B142
Antoine MEYER
Mes dernières références
My latest references
Publications (HAL)
Publications (HAL)
Léo Exibard, Nadime Francis, Antoine Meyer, Marie van den Bogaard
Modèles de mémoire pour l'enseignement de la programmation. Colloque Didapro 10 sur la Didactique de l’informatique et des STIC, 2024, Louvain-La-Neuve, Belgique. pp.33-43
Modèles de mémoire pour l'enseignement de la programmation. Colloque Didapro 10 sur la Didactique de l’informatique et des STIC, 2024, Louvain-La-Neuve, Belgique. pp.33-43
Sylvie Alayrangues, Olivier Baudon, Sylvain Beauvoir, Emmanuel Beffara, Sébastien Daniel, et al.
Une analyse des exercices d'algorithmique et de programmation des DNB. Commission inter-IREM informatique. 2023
Une analyse des exercices d'algorithmique et de programmation des DNB. Commission inter-IREM informatique. 2023
Evmorfia-Iro Bartzia, Emmanuel Beffara, Antoine Meyer, Julien Narboux
Underlying theories of proof assistants and potential impact on the teaching and learning of proof. 12th International Workshop on Theorem proving components for Educational software, Julien Narboux; Walther Neuper; Pedro Quaresma, Jul 2023, Rome, Italy
Underlying theories of proof assistants and potential impact on the teaching and learning of proof. 12th International Workshop on Theorem proving components for Educational software, Julien Narboux; Walther Neuper; Pedro Quaresma, Jul 2023, Rome, Italy
Evmorfia-Iro Bartzia, Emmanuel Beffara, Antoine Meyer, Julien Narboux
Proof assistants for undergraduate mathematics education: elements of an a priori analysis. 2023
Proof assistants for undergraduate mathematics education: elements of an a priori analysis. 2023
Antoine Meyer, Simon Modeste
Situation didactique autour d'un jeu de recherche : expérimentation en classes de NSI. L'informatique, objets d'enseignement et d'apprentissage. Quelles nouvelles perspectives pour la recherche ?, May 2022, Le Mans, France. pp.100-112
Situation didactique autour d'un jeu de recherche : expérimentation en classes de NSI. L'informatique, objets d'enseignement et d'apprentissage. Quelles nouvelles perspectives pour la recherche ?, May 2022, Le Mans, France. pp.100-112
Antoine Meyer, Simon Modeste
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 2019. Cahiers 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
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 2019. Cahiers 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
Evmorfia Bartzia, Antoine Meyer, Julien Narboux
Proof assistants for undergraduate mathematics and computer science education: elements of a priori analysis. INDRUM 2022: Fourth conference of the International Network for Didactic Research in University Mathematics, Reinhard Hochmuth, Oct 2022, Hanovre, Germany
Proof assistants for undergraduate mathematics and computer science education: elements of a priori analysis. INDRUM 2022: Fourth conference of the International Network for Didactic Research in University Mathematics, Reinhard Hochmuth, Oct 2022, Hanovre, Germany
Sylvie Alayrangues, Olivier Baudon, Emmanuel Beffara, Ronan Charpentier, Sébastien Daniel, et al.
Une analyse de la notion de booléen et de son usage dans l'enseignement de la programmation. 2022
Une analyse de la notion de booléen et de son usage dans l'enseignement de la programmation. 2022
Faïza Chellougui, Viviane Durand-Guerrier, Antoine Meyer
Discrete mathematics, computer science, logic, proof, and their relationships. Research and Development in University Mathematics Education, Routledge, pp.125-146, 2021, 9780367365387
Discrete mathematics, computer science, logic, proof, and their relationships. Research and Development in University Mathematics Education, Routledge, pp.125-146, 2021, 9780367365387
Antoine Meyer, Simon Modeste
Analyse didactique d’un jeu de recherche : vers une situation fondamentale pour la complexité d’algorithmes et de problèmes. Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation, Feb 2020, Lille, France
Analyse didactique d’un jeu de recherche : vers une situation fondamentale pour la complexité d’algorithmes et de problèmes. Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation, Feb 2020, Lille, France
Simon Modeste, Sylvain Beauvoir, Jonathan Chappelon, Viviane Durand-Guerrier, Nicolás León, et al.
Proof, reasoning and logic at the interface between Mathematics and Computer Science : toward a framework for analyzing problem solving. Eleventh Congress of the European Society for Research in Mathematics Education (CERME11), Utrecht University, Feb 2019, Utrecht, Netherlands. pp.284-291
Proof, reasoning and logic at the interface between Mathematics and Computer Science : toward a framework for analyzing problem solving. Eleventh Congress of the European Society for Research in Mathematics Education (CERME11), Utrecht University, Feb 2019, Utrecht, Netherlands. pp.284-291
Viviane Durand-Guerrier, Antoine Meyer, Simon Modeste
Didactical issues at the interface of mathematics and computer science. Proof 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⟩
Didactical issues at the interface of mathematics and computer science. Proof 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⟩
Sylvie Alayrangues, Emmanuel Beffara, Sébastien Daniel, Christophe Declercq, Anne Héam, et al.
Une analyse des exercices d’algorithmique et de programmation du brevet 2017. Repères IREM, 2019, 116, pp.47-81
Une analyse des exercices d’algorithmique et de programmation du brevet 2017. Repères IREM, 2019, 116, pp.47-81
Cécile Ouvrier-Buffet, Antoine Meyer, Simon Modeste
Discrete mathematics at university level. Interfacing mathematics, computer science and arithmetic. INDRUM 2018, INDRUM Network, University of Agder, Apr 2018, Kristiansand, Norway. pp.255-264
Discrete mathematics at university level. Interfacing mathematics, computer science and arithmetic. INDRUM 2018, INDRUM Network, University of Agder, Apr 2018, Kristiansand, Norway. pp.255-264
François Laroussinie, Antoine Meyer, Eudes Petonnet
Counting CTL. Logical Methods in Computer Science, 2013, 9 (1), pp.3.1-3.34
⟨10.2168/LMCS-9(1:3)2013⟩
Counting CTL. Logical Methods in Computer Science, 2013, 9 (1), pp.3.1-3.34
⟨10.2168/LMCS-9(1:3)2013⟩
François Laroussinie, Antoine Meyer, Eudes Pétonnet
Counting CTL. FoSSaCS 2010, Mar 2010, Paphos, Cyprus. pp.206-220
⟨10.1007/978-3-642-12032-9_15⟩
Counting CTL. FoSSaCS 2010, Mar 2010, Paphos, Cyprus. pp.206-220
⟨10.1007/978-3-642-12032-9_15⟩
François Laroussinie, Antoine Meyer, Eudes Petonnet
Counting LTL. TIME 2010, Sep 2010, Paris, France. p. 51-58
⟨10.1109/TIME.2010.20⟩
Counting LTL. TIME 2010, Sep 2010, Paris, France. p. 51-58
⟨10.1109/TIME.2010.20⟩
Nutan Limaye, Meena Mahajan, Antoine Meyer
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. Journal of Automata Languages and Combinatorics, 2009, 14 (3/4), p. 211-235
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. Journal of Automata Languages and Combinatorics, 2009, 14 (3/4), p. 211-235
Nutan Limaye, Meena Mahajan, Antoine Meyer
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. CSR 2008, Jun 2008, Moscow, Russia. p. 240-251
⟨10.1007/978-3-540-79709-8_25⟩
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. CSR 2008, Jun 2008, Moscow, Russia. p. 240-251
⟨10.1007/978-3-540-79709-8_25⟩
Antoine Meyer
Traces of Term-Automatic Graphs. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42, p. 615-630
⟨10.1051/ita:2008018⟩
Traces of Term-Automatic Graphs. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42, p. 615-630
⟨10.1051/ita:2008018⟩
Arnaud Carayol, Matthew Hague, Antoine Meyer, Luke Ong, Olivier Serre
Winning regions of higher-order pushdown games. Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), Jun 2008, Pittsburgh, United States. pp.193-204
Winning regions of higher-order pushdown games. Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), Jun 2008, Pittsburgh, United States. pp.193-204
Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A Logic of Reachable Patterns in Linked Data-Structures. Journal of Logic and Algebraic Programming, 2007, 73 (1-2), p. 111-142
⟨10.1016/j.jlap.2006.12.001⟩
A Logic of Reachable Patterns in Linked Data-Structures. Journal of Logic and Algebraic Programming, 2007, 73 (1-2), p. 111-142
⟨10.1016/j.jlap.2006.12.001⟩
Antoine Meyer
Traces of Term-Automatic Graphs. Mathematical Foundations of Computer Science (MFCS), Aug 2007, Cesky Krumlov, Poland. p. 489-500
⟨10.1007/978-3-540-74456-6_44⟩
Traces of Term-Automatic Graphs. Mathematical Foundations of Computer Science (MFCS), Aug 2007, Cesky Krumlov, Poland. p. 489-500
⟨10.1007/978-3-540-74456-6_44⟩
Arnaud Carayol, Antoine Meyer
Linearly bounded infinite graphs. Acta Informatica, 2006, 43 (4), p. 265-292
⟨10.1007/s00236-006-0022-z⟩
Linearly bounded infinite graphs. Acta Informatica, 2006, 43 (4), p. 265-292
⟨10.1007/s00236-006-0022-z⟩
Arnaud Carayol, Antoine Meyer
Context-Sensitive Languages, Rational Graphs and Determinism. Logical Methods in Computer Science, 2006, 2 (2), pp.6
⟨10.2168/LMCS-2(2:6)2006⟩
Context-Sensitive Languages, Rational Graphs and Determinism. Logical Methods in Computer Science, 2006, 2 (2), pp.6
⟨10.2168/LMCS-2(2:6)2006⟩
Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A Logic of Reachable Patterns in Linked Data-Structures. FOSSACS 2006, Mar 2006, Vienne, Austria. p. 94-110
⟨10.1007/11690634_7⟩
A Logic of Reachable Patterns in Linked Data-Structures. FOSSACS 2006, Mar 2006, Vienne, Austria. p. 94-110
⟨10.1007/11690634_7⟩
Antoine Meyer
Graphes infinis de présentation finie. Informatique [cs]. Université Rennes 1, 2005. Français
Graphes infinis de présentation finie. Informatique [cs]. Université Rennes 1, 2005. Français
Arnaud Carayol, Antoine Meyer
Linearly Bounded Infinite Graphs. MFCS 2005, Sep 2005, Gdansk, Poland. pp.180-191
⟨10.1007/11549345_17⟩
Linearly Bounded Infinite Graphs. MFCS 2005, Sep 2005, Gdansk, Poland. pp.180-191
⟨10.1007/11549345_17⟩
Antoine Meyer
On Term Rewriting Systems Having a Rational Derivation. FoSSaCS 2004, Mar 2004, Barcelona, Spain. pp.378-392
⟨10.1007/b95995⟩
On Term Rewriting Systems Having a Rational Derivation. FoSSaCS 2004, Mar 2004, Barcelona, Spain. pp.378-392
⟨10.1007/b95995⟩
Ahmed Bouajjani, Antoine Meyer
Symbolic Reachability Analysis of Higher-Order Context-Free Processes. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Nov 2004, Chennai, India. pp.135-147
⟨10.1007/b104325⟩
Symbolic Reachability Analysis of Higher-Order Context-Free Processes. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Nov 2004, Chennai, India. pp.135-147
⟨10.1007/b104325⟩