Derivation of programs for freshmen

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Derivation of programs for freshmen

Full text

Pdf (360 KB)

Source

Technical Symposium on Computer Science Education archive
Proceedings of the twenty-fifth SIGCSE symposium on Computer science education table of contents

Phoenix, Arizona, United States

Pages: 116 - 120

Year of Publication: 1994

ISBN:0-89791-646-8

Also published in ...

Authors

Richard Denman	Southwestern University, Georgetown, Texas
David A. Naumann	Southwestern University, Georgetown, Texas
Walter Potter	Southwestern University, Georgetown, Texas
Gary Richter	Southwestern University, Georgetown, Texas

Sponsor

SIGCSE: ACM Special Interest Group on Computer Science Education

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 16, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/191029.191077 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Edsger W. Dijkstra , W. H. Feijen, A Method of Programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1988
	2	David Gries, The Science of Programming, Springer-Verlag New York, Inc., Secaucus, NJ, 1987
	3	Edward Cohen, Programming in the 1990s: an introduction to the calculation of programs, Springer-Verlag New York, Inc., New York, NY, 1990
	4	Anne Kaldewaij, Programming: the derivation of algorithms, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
	5	Edsger Wybe Dijkstra, A Discipline of Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	6	R. S. Bird , J. Gibbons , G. Jones, Formal derivation of a pattern matching algorithm, Science of Computer Programming, v.12 n.2, p.93-104, July 1989 [doi>10.1016/0167-6423(89)90036-1]
	7	David A. Turner, Research topics in functional programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	8	David Gries , Fred B. Schneider, A logical approach to discrete math, Springer-Verlag New York, Inc., New York, NY, 1993

CITED BY 5

	Guy Tremblay, An undergraduate course in formal methods: “description is our business”, ACM SIGCSE Bulletin, v.30 n.1, p.166-170, Mar. 1998
	Richard T. Denman, Derivation of recursive algorithms for CS2, ACM SIGCSE Bulletin, v.28 n.1, p.9-13, March 1996
	J. R. Jefferson Wadkins, Rigorous proofs of program correctness without formal logic, ACM SIGCSE Bulletin, v.27 n.1, p.307-311, March 1995
	Thomas V. Palmer , James C. Pleasant, Attitudes toward the teaching of formal methods of software development in the undergraduate computer science curriculum: a survey, ACM SIGCSE Bulletin, v.27 n.3, p.53-59, Sept. 1995
	J. Stanley Warford, An experience teaching formal methods in discrete mathematics, ACM SIGCSE Bulletin, v.27 n.3, p.60-64, Sept. 1995