First Steps Towards Inferential Programming

作者: William L. Scherlis , Dana S. Scott

DOI: 10.1007/978-94-011-1793-7_6

关键词:

摘要: Our basic premise is that the ability to construct and modify programs will not improve without a new comprehensive look at entire programming process. Past theoretical research, say, in logics of programs, has tended focus on methods for reasoning about individual programs; little been done, it seems us, develop sound understanding process — by which evolve concept practice. At present, we lack means describe techniques program construction improvement ways properly link verification, documentation adaptability.

参考文章(45)
Thomas Tymoczko, The Four-color Problem and Its Philosophical Significance The Journal of Philosophy. ,vol. 76, pp. 57- 83 ,(1979) , 10.2307/2025976
David Gries, On Structured Programming Springer, New York, NY. pp. 70- 74 ,(1978) , 10.1007/978-1-4612-6315-9_7
Michael Detlefsen, Mark Luker, The Four-color Theorem and Mathematical Proof The Journal of Philosophy. ,vol. 77, pp. 803- 820 ,(1980) , 10.2307/2025806
Joseph Louis Bates, A Logic for Correct Program Development A Logic for Correct Program Development. ,(1979)
John H. Reif, William L. Scherlis, Deriving Efficient Graph Algorithms Lecture Notes in Computer Science. pp. 645- 681 ,(2003) , 10.1007/978-3-540-39910-0_28
K. Appel, W. Haken, J. Koch, Every planar map is four colorable. Part II: Reducibility Illinois Journal of Mathematics. ,vol. 21, pp. 491- 567 ,(1977) , 10.1215/IJM/1256049012
Edsger Wybe Dijkstra, Notes on structured programming In Structured programming (1972), pp. 1-82. ,vol. 8, pp. 1- 82 ,(1970)
Chris Goad, Automatic Construction of Special Purpose Programs conference on automated deduction. pp. 194- 208 ,(1982) , 10.1007/BFB0000060