
- 1 Edsger W. Dijkstra and W. H. J. Feijen, A Method of Programming, 1988, Addison-Wesley. Google Scholar
Digital Library
- 2 David Gries, The Science of Programming, 1981, Springer-Verlag. Google Scholar
Digital Library
- 3 Edward Cohen, Programming in the 1990's: An introduction to the calculation of programs, 1990, Springer-Verlag. Google Scholar
Digital Library
- 4 Anne Kaldewaij, Programming: The Derivatzon of Algorithms, 1990, Prentice Hall. Google Scholar
Digital Library
- 5 Edsger W. Dijkstra, A Discipline of Programming, 1976, Prentice Hall. Google Scholar
Digital Library
- 6 David Gries and Fred Schneider, A Logical Approach to Discrete Mathematics, 1994, Springer Verlag. Google Scholar
Digital Library
- 7 Richard Denman, David A. Naumann, Walter Potter, and Gary Richter, Derivation of Programs for Freshmen, SIGCSE Bulletin, Volume 23, Number 1, March 1994. Google Scholar
Digital Library
- 8 Alain J. Martin, A General Proof Rule for Procedures in Predicate Transformer Semantics, Acta Informatica 20.Google Scholar
- 9 Bijlsma, Wiltink, and Matthews, Equivalence of the Gries and Martin Proof Rules for Procedure Calls, Acta informatica 26. Google Scholar
Digital Library
- 10 Bijlsma, Matthews, and Wiltink, A Sharp Proof Rule for Procedures in wp Semantics, Acta Informatica 26. Google Scholar
Digital Library
- 11 Pierre America and Frank de Boer, Proving Total Correctness of Recursive Procedures, CWI report R8904.Google Scholar
- 12 David A. Naumann, On the Essence of Oberon, in Jurg Gutknecht, editor, Proceedings, Conference on Programming Languages and System A rchztectures, March 1994, Springer LNCS 782. Google Scholar
Digital Library
- 13 David A. Naumann, Predicate Transformer Semantics of an Oberon-Like Language, in Ernst-Rudiger Olderog, editor, Programming Concepts, Methods and Calculi, Elsevier, 1994. Google Scholar
Digital Library
Index Terms
Derivation of recursive algorithms for CS2
Recommendations
Algorithms for the integration and derivation of Chebyshev series
General formulas for the mth integral and derivative of a Chebyshev polynomial of the first or second kind are presented. The result is expressed as a finite series of the same kind of Chebyshev polynomials. These formulas permit to accelerate the ...
Recursive polynomial interpolation algorithm (RPIA)
Let x0, x1, ź , xn be a set of n+1 distinct real numbers (i.e., xi ź xj for i ź j) and y0, y1, ź , yn be given real numbers; we know that there exists a unique polynomial pn(x) of degree n such that pn(xi) = yi for i = 0, 1, ź , n; pn is the ...
CS1 and CS2 (panel session): foundations of computer science and discrete mathematics
SIGCSE '00: Proceedings of the thirty-first SIGCSE technical symposium on Computer science educationOver a period of thirty years there have been many curriculum reforms in the Undergraduate Computer Science curriculum. The ACM/IEEE-CS task force is currently working on the Curriculum 2001. In this struggle to define and develop this dynamic field of ...






Comments