J. Alpuim and W. Swierstra, Embedding the refinement calculus in coq, Science of Computer Programming, vol.164, pp.37-48, 2018.

A. Anand, S. Boulier, N. Tabareau, and M. Sozeau, Typed template coq-certified meta-programming in coq, CoqPL 2018-The Fourth International Workshop on Coq for Programming Languages, pp.1-2, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01671948

R. J. Back, A calculus of refinements for program derivations, Acta Informatica, vol.25, issue.6, pp.593-624, 1988.

R. Backhouse and J. Van-der-woude, Demonic operators and monotype factors, Mathematical Structures in Computer Science, vol.3, issue.4, pp.417-433, 1993.

R. Berghammer and H. Zierer, Relational algebraic semantics of deterministic and nondeterministic programs, T.C.S, vol.43, pp.123-147, 1986.

S. Boulmé, Intuitionistic refinement calculus, International Conference on Typed Lambda Calculi and Applications, pp.54-69, 2007.

J. Desharnais, A. Jaoua, F. Mili, N. Boudriga, and A. Mili, A relational division operator: the conjugate kernel, T.C.S, vol.114, issue.2, pp.247-272, 1993.

E. Dijkstra, Notes on structured programming, Structured Programming, 1972.

M. Frappier, A. Mili, and J. Desharnais, A relational calculus for program construction by parts, Science of Computer Programming, vol.26, issue.1-3, pp.237-254, 1996.

E. C. Hehner, Predicative programming part I, Communications of the ACM, vol.27, issue.2, pp.134-143, 1984.

E. C. Hehner, Specified blocks. In: Verified Software: Theories, Tools, Experiments, pp.384-391, 2008.

E. C. Hehner, A practical theory of programming, 2012.

C. A. Hoare, Proof of correctness of data representations, Programming Methodology, pp.269-281, 1978.

C. A. Hoare and J. He, The weakest prespecification, Information Processing Letters, vol.24, issue.2, pp.127-132, 1987.

C. A. Hoare and H. Jifeng, Unifying theories of programming, vol.14, 1998.

M. B. Josephs, An introduction to the theory of specification and refinement, IBM research Report RC 12993. IBM Thomas J. Watson Research Division, 1987.

D. E. Knuth, Literate programming, The Computer Journal, vol.27, issue.2, pp.97-111, 1984.

D. G. Kourie and B. W. Watson, The Correctness-by-Construction Approach to Programming, 2012.

A. Mili, A relational approach to the design of deterministic programs, Acta Informatica, vol.20, issue.4, pp.315-328, 1983.

C. Morgan, The refinement calculus, Program Design Calculi, pp.3-52, 1993.

C. Morgan, The refinement calculus, and literate development, pp.161-182, 1993.

E. Sekerinski, A calculus for predicative programming, International Conference on Mathematics of Program Construction, pp.302-322, 1992.

J. M. Spivey and J. Abrial, The Z notation, p.24, 1992.

N. Wirth, Program development by stepwise refinement, Communications of the ACM, vol.14, issue.4, pp.221-227, 1971.