- 10
- 6
- 5
- 2
- 2
- 1
- 1
- 1
- 1
- 1
Antoine Meyer
30
Documents
Current affiliations
- 1001627
- 1005023
Researcher identifiers
- antoine-meyer
- Arxiv : meyer_a_1
- IdRef : 094974802
- 0000-0003-4513-4347
- Google Scholar : https://scholar.google.com/citations?user=98lpsdUAAAAJ
Publications
|
Booléens en programmation : une analyse à destination des enseignantsRecherches et recherches-actions en didactique de l'informatique, 2024, 1, pp.1-33
Journal articles
hal-03812698v2
|
|
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
Journal articles
halshs-04130761v2
|
|
Une analyse des exercices d’algorithmique et de programmation du brevet 2017Repères IREM, 2019, 116, pp.47-81
Journal articles
hal-02077738v2
|
Counting CTLLogical Methods in Computer Science, 2013, 9 (1), pp.3.1-3.34. ⟨10.2168/LMCS-9(1:3)2013⟩
Journal articles
hal-00790010v1
|
|
|
On the Complexity of Membership and Counting in Height-Deterministic Pushdown AutomataJournal of Automata Languages and Combinatorics, 2009, 14 (3/4), p. 211-235
Journal articles
hal-00681253v1
|
|
Traces of Term-Automatic GraphsRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42, p. 615-630. ⟨10.1051/ita:2008018⟩
Journal articles
hal-00325729v1
|
|
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⟩
Journal articles
hal-00681203v1
|
Context-Sensitive Languages, Rational Graphs and DeterminismLogical Methods in Computer Science, 2006, 2 (2), pp.6. ⟨10.2168/LMCS-2(2:6)2006⟩
Journal articles
hal-00149086v1
|
|
|
Linearly bounded infinite graphsActa Informatica, 2006, 43 (4), p. 265-292. ⟨10.1007/s00236-006-0022-z⟩
Journal articles
hal-00149109v1
|
|
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
Conference papers
hal-04482121v2
|
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
Conference papers
hal-04227823v1
|
|
|
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
Conference papers
hal-03648357v2
|
|
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 ?, May 2022, Le Mans, France. pp.100-112
Conference papers
hal-03697943v2
|
|
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
Conference papers
hal-03014372v1
|
|
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
Conference papers
hal-02398483v1
|
|
Discrete mathematics at university level. Interfacing mathematics, computer science and arithmeticINDRUM 2018, INDRUM Network, University of Agder, Apr 2018, Kristiansand, Norway. pp.255-264
Conference papers
hal-01849537v1
|
|
Counting CTLFoSSaCS 2010, Mar 2010, Paphos, Cyprus. pp.206-220, ⟨10.1007/978-3-642-12032-9_15⟩
Conference papers
hal-00681263v1
|
|
Counting LTLTIME 2010, Sep 2010, Paris, France. p. 51-58, ⟨10.1109/TIME.2010.20⟩
Conference papers
hal-00681267v1
|
|
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⟩
Conference papers
hal-00681215v1
|
|
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
Conference papers
hal-00345939v1
|
|
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⟩
Conference papers
hal-00681214v1
|
|
A Logic of Reachable Patterns in Linked Data-StructuresFOSSACS 2006, Mar 2006, Vienne, Austria. p. 94-110, ⟨10.1007/11690634_7⟩
Conference papers
hal-00149120v1
|
|
Linearly Bounded Infinite GraphsMFCS 2005, Sep 2005, Gdansk, Poland. pp.180-191, ⟨10.1007/11549345_17⟩
Conference papers
hal-00149334v1
|
|
On Term Rewriting Systems Having a Rational DerivationFoSSaCS 2004, Mar 2004, Barcelona, Spain. pp.378-392, ⟨10.1007/b95995⟩
Conference papers
hal-00149816v1
|
|
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⟩
Conference papers
hal-00149812v1
|
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⟩
Book sections
hal-03680295v1
|
|
|
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⟩
Book sections
hal-01912885v1
|
|
Proof assistants for undergraduate mathematics education: elements of an a priori analysis2023
Preprints, Working Papers, ...
hal-04087080v1
|
|
Une analyse des exercices d'algorithmique et de programmation des DNBCommission inter-IREM informatique. 2023
Reports
hal-03996891v2
|
|
Graphes infinis de présentation finieInformatique [cs]. Université Rennes 1, 2005. Français. ⟨NNT : ⟩
Theses
tel-00325707v1
|