Intuitionistic refinement calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4583 LNCS, Issue , 2007, Pages 54-69

  Boulmé, Sylvain ^a  

^a UNIV GRENOBLE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FEATURE EXTRACTION; LOGIC PROGRAMMING;

COMPUTATIONAL REFLEXION; INTUITIONISTIC REFINEMENT CALCULUS; STRUCTURED PROGRAMMING.;

SOFTWARE ENGINEERING;

EID: 38149055040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73228-0_6     Document Type: Conference Paper

References (25)

1. Abrial, J.-R.: The B-Book. Cambridge University Press, Cambridge (1996)
2. Audebaud, P., Zucca, E.: Deriving Proof Rules from Continuation Semantics. Formal Aspects of Computing 11(4), 426-447 (1999)
3. Back, R.-J.: On the correctness of refinement steps in program development. Ph.D. thesis, University of Helsinki (1978)
4. Back, R.-J., von Wright, J.: Refinement Calculus: A Systematic Introduction. Springer, Heidelberg (1998)
5. Behm, P., Benoit, P., et al.: Météor: A Successful Application of B in a Large Project. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol. 1708, pp. 369-387. Springer, Heidelberg (1999)
6. Benton, N., Hughes, J., et al.: Monads and Effects. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 42-122. Springer, Heidelberg (2002)
7. Bodeveix, J.-P., Filali, M., et al.: A Formalization of the B-Method in Coq and PVS. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol. 1708, Springer, Heidelberg (1999)
8. Boulmé, S.: Higher-Order Refinement In Coq (reports and Coq files). (2006) Web page: http://www-lsr.imag.fr/users/Sylvain.Boulme/ horefinement/
9. Boulmé, S.: Higher-Order imperative enumeration of binary trees in Coq. (2007) Online paper: http://.../Sylvain.Boulme/horefinement/enumBTdesc.pdf
10. Bunkenburg, A.: Expression Refinement. Ph.D. thesis, Computing Science Department, University of Glasgow (1997)
11. Coquand, T., Huet, G.: The Calculus of Constructions. Information and Computation 76, 95-120 (1988)
12. Coq Development Team. The Coq Proof Assistant Reference Manual, version 8.0. Logical Project, INRIA-Rocquencourt (2004)
13. Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18(8), 453-457 (1975)
14. Filliâtre, J.-C.: Verification of Non-Functional Programs using Interpretations in Type Theory. Journal of Functional Programming 13(4), 709-745 (2003)
15. Gordon, M.J.C.: Mechanizing Programming Logics in Higher-Order Logic. In: Current Trends in Hardware Verification and Automatic Theorem Proving, Springer, Heidelberg (1988)
16. Honda, K., Berger, M., et al.: An Observationally Complete Program Logic for Imperative Higher-Order Functions. In: IEEE Symp. on LICS'05 (2005)
17. Liang, S., Hudak, P.: Modular Denotational Semantics for Compiler Construction. In: Nielson, H.R. (ed.) ESOP 1996. LNCS, vol. 1058, pp. 219-234. Springer, Heidelberg (1996)
18. Moggi, E.: Notions of computation and monads. Information and Computation 93(1), 55-92 (1991)
19. Morris, J.M.: A theoretical basis for stepwise refinement and the programming calculus. Science of Computer Programming 9(3), 287-306 (1987)
20. Morgan, C.: Programming from Specifications. Prentice-Hall, Englewood Cliffs (1990)
21. Nanevski, A., Morrisett, G., et al.: Polymorphism and separation in Hoare Type Theory. In: Nanevski, A., Morrisett, G. (eds.) Proc. of ICFP'06, ACM Press, New York (2006)
22. Jones, S.L.P., Wadler, P.: Imperative functional programming. In: Proc. of the 20th symposium on POPL, ACM Press, New York (1993)
23. Paulin-Mohring, C.: Inductive Definitions in the System Coq - Rules and Properties. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, Springer, Heidelberg (1993)
24. Schröder, L., Mossakowski, T.: Monad-independent Hoare logic in HasCasl. In: Pezzé, M. (ed.) ETAPS 2003 and FASE 2003. LNCS, vol. 2621, Springer, Heidelberg (2003)
25. von Wright, J.: Program refinement by theorem prover. In: 6th Refinement Workshop, Springer, Heidelberg (1994)