Abstract Algorithms and Diagram Closure

Calvin C. Elgot

A chapter in Selected Papers, 1982, pp 53-138 from Springer

Abstract: Abstract A programming language L presumably should be designed, at least in part, to express algorithms of a given class M. Given an algorithm in the class M, there should be a name in L which expresses it. In addition, L should possess names for the “tasks performable by algorithms” in M. A theory of the language L should presumably include statements about algorithms in M and their tasks.

Keywords: Result Cell; Diagram Form; Euclidean Algorithm; Declarative Sentence; Abstract Algorithm (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-8177-8_3

Ordering information: This item can be ordered from
http://www.springer.com/9781461381778

DOI: 10.1007/978-1-4613-8177-8_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().