Abstracto 84

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Abstracto 84: The next generation

Full text

Pdf (640 KB)

Source

ACM Annual Conference/Annual Meeting archive
Proceedings of the 1979 annual conference table of contents

Pages: 33 - 39

Year of Publication: 1979

ISBN:0-89791-008-7

Author

Lambert Meertens

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 3, Citation Count: 1

Additional Information:

abstract 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/800177.810022 What is a DOI?

ABSTRACT

Programming languages are not an ideal vehicle for expressing algorithms. This paper sketches how a language Abstracto might be developed for “algorithmic expressions” that may be manipulated by the rules of “algorithmics”, quite similar to the manipulation of mathematical expressions in mathematics. Two examples are given of “abstract” algorithmic expressions that are not executable in the ordinary sense, but may be used in the derivation of programs. It appears that the notion of “refinement” may be replaced by a weaker notion for abstract algorithmic expressions, corresponding also to a weaker notion of “weakest precondition”.

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	Back, R.-J., On the Correctness of Refinement Steps in Program Development, Report A-1978-4, Department of Computer Science, University of Helsinki, 1978.
	2	R. S. Bird, Improving programs by the introduction of recursion, Communications of the ACM, v.20 n.11, p.856-863, Nov. 1977 [doi>10.1145/359863.359889]
	3	Boom, H.J., A weaker precondition for loops, Report IW 104/78, Mathematical Centre, Amsterdam, 1978.
	4	Edsger Wybe Dijkstra, A Discipline of Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	5	Hill, I.D., Wouldn't it be nice if we could write computer programs in ordinary English - or would it?, Computer Bull. 12 (1972) 306-312.

CITED BY 2

	Carroll Morgan, The specification statement, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.3, p.403-419, July 1988
	Carroll Morgan , Ken Robinson, Specification statements and refinements, IBM Journal of Research and Development, v.31 n.5, p.546-555, Sept. 1987