See this document in CiteSeerX!

Iterative Procedures for Computing Ackerman's Function (1993)  (Make Corrections)  (1 citation)
M. P. Ward



  Home/Search   Context   Related

 
View or download:
cse.dmu.ac.uk/~mward/mart...ackt.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cse.dmu.ac.uk/~mward/mart...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper uses Ackerman's function as a testbed to illustrate the operation of various program transformations which take recursive procedures to equivalent iterative forms. The transformations are taken from the author's DPhil thesis [19]. In this paper we illustrate that Department of Computer Science University of Durham, Durham, UK 1 they can be successfully applied to even the most convoluted recursion. For many programs a recursive function is the most natural and clear speci cation... (Update)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

M. P. Ward. Iterative procedures for computing Ackerman's function. Technical Report 9, Department of Computer Science, University of Durham, Durham, U.K., July 1993. http://citeseer.ist.psu.edu/ward93iterative.html   More

@misc{ ward93iterative,
  author = "M. Ward",
  title = "Iterative procedures for computing Ackerman's function",
  text = "M. P. Ward. Iterative procedures for computing Ackerman's function. Technical
    Report 9, Department of Computer Science, University of Durham, Durham,
    U.K., July 1993.",
  year = "1993",
  url = "citeseer.ist.psu.edu/ward93iterative.html" }
Citations (may not include all citations):
650   An Axiomatic Basis for Computer Programming (context) - Hoare - 1969
64   Tabulation Techniques for Recursive Programs (context) - Bird - 1980
44   Algorithmic Language and Program Development (context) - Bauer, Wossner - 1982
38   Structured Programming with the GOTO Statement (context) - Knuth - 1974
23   Zum Hilbertschen Aufbau der reellen Zahlen (context) - Ackermann - 1928
11   An Alternative to Current Looping Syntax (context) - Taylor - 1984
10   New York{Heidelberg{Berlin (context) - Gries, of et al. - 1981
10   Proving Program Re nements and Transformations (context) - Ward - 1989
8   Syntactic Source to Source Program Transformations and Progr.. (context) - Arsac - 1982
7   Correctness Preserving Program Re nements (context) - Back - 1980
6   in Symposium on Semantics of Algorithmic Languages (context) - Hoare, parameters et al. - 1971
6   A Case for Teaching Multi-exit Loops to Beginning Programmer.. - Buhr - 1985
6   Program Development By Stepwise Transformations|the Project .. (context) - Bauer - 1979
4   Multiple exits from a loop without the goto (context) - Bochmann - 1973
2   Programming as an Evolutionary Process (context) - Bauer - 1976

[Article contains additional citations not shown here]

Documents on the same site (http://www.cse.dmu.ac.uk/~mward/martin/papers/index.html):   More
Using Formal Transformations to Construct a Component Repository - Ward (1993)   (Correct)
Legacy Assembler Reengineering and Migration - Ward, Zedan, Hardcastle   (Correct)
Language Oriented Programming - Ward (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC