F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

R. Back and J. Von-wright, Refinement Calculus, 1998.
DOI : 10.1007/978-1-4612-1674-2

A. Balaa and Y. Bertot, Fix-Point Equations for Well-Founded Recursion in Type Theory, Theorem Proving in Higher Order Logics, pp.1-16, 2000.
DOI : 10.1007/3-540-44659-1_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.601

G. Barthe and P. Courtieu, Efficient Reasoning about Executable Specifications in Coq, Theorem Proving in Higher Order Logics, pp.31-46, 2002.
DOI : 10.1007/3-540-45685-6_4

G. Barthe, J. Forest, D. Pichardie, and V. Rusu, Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant, Functional and Logic Programming. Lecture Notes in Computer Science, vol.15, issue.1, pp.114-129, 2006.
DOI : 10.1023/A:1019916231463
URL : https://hal.archives-ouvertes.fr/inria-00564237

D. Basin, Y. Deville, P. Flener, A. Hamfelt, and J. F. Nilsson, Synthesis of Programs in Computational Logic, Program Development in Computational Logic, pp.30-65, 2004.
DOI : 10.1007/978-3-540-25951-0_2

Y. Bertot and P. Casteran, Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions, XXV of Texts in Theoretical Computer Science, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

B. Buchberger, Theory Exploration with Theorema, Analele Universitatii Din Timisoara, Ser. Matematica- Informatica, pp.9-32, 2000.

B. Buchberger, Algorithm invention and verification by lazy thinking, Matematica -Informatica, pp.41-70, 2003.

B. Buchberger, Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy, Proceedings of AISC 2004, pp.236-250, 2004.
DOI : 10.1007/978-3-540-30210-0_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.7867

B. Buchberger and A. Craciun, Algorithm Synthesis by Lazy Thinking: Examples and Implementation in Theorema, Electronic Notes in Theoretical Computer Science, vol.93, pp.24-59, 2004.
DOI : 10.1016/j.entcs.2003.12.027
URL : http://doi.org/10.1016/j.entcs.2003.12.027

A. Bundy, L. Dixon, J. Gow, and J. Fleuriot, Constructing Induction Rules for Deductive Synthesis Proofs, Electronic Notes in Theoretical Computer Science, vol.153, issue.1, pp.3-21, 2006.
DOI : 10.1016/j.entcs.2005.08.003
URL : http://doi.org/10.1016/j.entcs.2005.08.003

K. Claessen, M. Johansson, D. Rosén, and N. Smallbone, Automating Inductive Proofs Using Theory Exploration, CADE-24: Proceedings of the 24th International Conference on Automated Deduction, pp.392-406, 2013.
DOI : 10.1007/978-3-642-38574-2_27

C. Cohen, M. Dénès, and A. Mörtberg, Refinements for Free!, Certified Programs and Proofs, pp.147-162, 2013.
DOI : 10.1007/978-3-319-03545-1_10
URL : https://hal.archives-ouvertes.fr/hal-01113453

S. Colton, Automated Theory Formation in Pure Mathematics, 2012.
DOI : 10.1007/978-1-4471-0147-5

A. Craciun and M. Hodorog, Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration, Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007), pp.41-47, 2007.
DOI : 10.1109/SYNASC.2007.55

B. Delaware, C. P. Claudel, J. Gross, and A. Chlipala, Fiat: Deductive synthesis of abstract data types in a proof assistant, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL '15, pp.689-700, 2015.

Y. Deville and K. K. Lau, Logic program synthesis, The Journal of Logic Programming, vol.19, issue.20, pp.321-350, 1994.
DOI : 10.1016/0743-1066(94)90029-9
URL : http://doi.org/10.1016/0743-1066(94)90029-9

L. Dixon and J. D. Fleuriot, IsaPlanner: A Prototype Proof Planner in Isabelle, Proceedings of CADE'03, pp.279-283, 2003.
DOI : 10.1007/978-3-540-45085-6_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.9350

L. Dixon and M. Johansson, Isaplanner 2: A proof planner in Isabelle, DReaM Technical Report, 2007.
DOI : 10.1007/978-3-540-45085-6_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.9350

I. Dramnesc and T. Jebelean, Proof Techniques for Synthesis of Sorting Algorithms, 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.101-109, 2011.
DOI : 10.1109/SYNASC.2011.23
URL : https://hal.archives-ouvertes.fr/hal-01590633

I. Dramnesc and T. Jebelean, Automated Synthesis of Some Algorithms on Finite Sets, 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.143-151, 2012.
DOI : 10.1109/SYNASC.2012.43

I. Dramnesc and T. Jebelean, Discovery of inductive algorithms through automated reasoning: A case study on sorting, 2012 IEEE 10th Jubilee International Symposium on Intelligent Systems and Informatics, pp.293-298, 2012.
DOI : 10.1109/SISY.2012.6339532

I. Dramnesc and T. Jebelean, Theory Exploration in Theorema: Case Study on Lists, 2012 7th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI), pp.421-426, 2012.
DOI : 10.1109/SACI.2012.6250041

I. Dramnesc and T. Jebelean, A case study in proof based synthesis of algorithms on monotone lists, 2015 IEEE 10th Jubilee International Symposium on Applied Computational Intelligence and Informatics, pp.483-488, 2015.
DOI : 10.1109/SACI.2015.7208252

I. Dramnesc and T. Jebelean, Synthesis of list algorithms by mechanical proving, Journal of Symbolic Computation, vol.69, pp.61-92, 2015.
DOI : 10.1016/j.jsc.2014.09.030

I. Dramnesc, T. Jebelean, and S. Stratulat, Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms, 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp.137-144, 2015.
DOI : 10.1109/SYNASC.2015.30
URL : https://hal.archives-ouvertes.fr/hal-01590633

I. Dramnesc, T. Jebelean, and S. Stratulat, Synthesis of some algorithms for trees: Experiments in Theorema, RISC Report Series, 2015.

I. Dramnesc, T. Jebelean, and S. Stratulat, Theory exploration of binary trees, 2015 IEEE 13th International Symposium on Intelligent Systems and Informatics (SISY), pp.139-144, 2015.
DOI : 10.1109/SISY.2015.7325367
URL : https://hal.archives-ouvertes.fr/hal-01235173

I. Dramnesc, T. Jebelean, and S. Stratulat, A case study on algorithm discovery from proofs: The insert function on binary trees, 2016 IEEE 11th International Symposium on Applied Computational Intelligence and Informatics (SACI), pp.231-236, 2016.
DOI : 10.1109/SACI.2016.7507376
URL : https://hal.archives-ouvertes.fr/hal-01590637

I. Dramnesc, T. Jebelean, and S. Stratulat, Proof???Based Synthesis of Sorting Algorithms for Trees, LATA 2016: Proceedings of the 10th International Conference on Language and Automata Theory and Applications, pp.562-575, 2016.
DOI : 10.1007/978-3-319-30000-9_43

P. Flener, Achievements and Prospects of Program Synthesis, Computational Logic: Logic Programming and Beyond, pp.310-346, 2002.
DOI : 10.1007/3-540-45628-7_13

S. Gulwani, Dimensions in program synthesis, Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming, PPDP '10, pp.13-24, 2010.
DOI : 10.1145/1836089.1836091

M. Johansson, L. Dixon, and A. Bundy, Conjecture Synthesis for Inductive Theories, Journal of Automated Reasoning, vol.21, issue.2, pp.251-289, 2011.
DOI : 10.1023/A:1005806324129
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.2390

E. Kneuss, I. Kuraj, V. Kuncak, and P. Suter, Synthesis modulo recursive functions, Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages and Applications. OOPSLA '13, pp.407-426, 2013.
DOI : 10.1145/2544173.2509555
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.368.8116

D. E. Knuth, The Art of Computer Programming Sorting and Searching, 1998.

B. Konev and T. Jebelean, Solution lifting method for handling meta-variables in Theorema, p.41, 2001.
DOI : 10.1007/s10958-005-0090-6

R. Kowalski and D. Kuehner, Linear resolution with selection function, Artificial Intelligence, vol.2, 1971.
DOI : 10.1007/978-3-642-81955-1_32

R. L. Mccasland, A. Bundy, V. Negru, D. Petcu, D. Zaharie et al., MATHsAiD: A Mathematical Theorem Discovery Tool, 2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.26-29, 2006.
DOI : 10.1109/SYNASC.2006.51

O. Montano-rivas, R. Mccasland, L. Dixon, and A. Bundy, Scheme-based theorem discovery and concept invention, Expert Systems with Applications, vol.39, issue.2, pp.1637-1646, 2012.
DOI : 10.1016/j.eswa.2011.06.055
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.6075

B. Mordechai, Mathematical Logic for Computer Science, 2004.

T. Nipkow, L. C. Paulson, and M. Wenzel, Isabelle/HOL ? A Proof Assistant for Higher-Order Logic, of Lecture Notes in Computer Science, 2002.

F. J. Pelletier, A history of natural deduction and elementary logic textbooks. Logical consequence: Rival approaches 1, pp.105-138, 2000.

D. R. Smith, Generating Programs Plus Proofs by Refinement, Verified Software: Theories, Tools, Experiments, VSTTE 2005 of Lecture Notes in Computer Science, pp.182-188, 2005.
DOI : 10.1007/3-540-45614-7_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.3229

S. Stratulat, A unified view of induction reasoning for first-order logic Turing-100 (The Alan Turing Centenary Conference, pp.326-352, 2012.

S. Stratulat, Mechanically certifying formula-based Noetherian induction reasoning, Journal of Symbolic Computation, vol.80, pp.209-249, 2017.
DOI : 10.1016/j.jsc.2016.07.014
URL : https://hal.archives-ouvertes.fr/hal-01590649

N. Wirth, Program development by stepwise refinement, Communications of the ACM, vol.14, issue.4, pp.221-227, 1971.
DOI : 10.1145/362575.362577
URL : http://e-collection.library.ethz.ch/eserv/eth:3026/eth-3026-01.pdf