Andrea Mößle, Heiko Vogler  @ NUS Home/Search
Context
Related
| orchid.inf.tudresden....tud9519.ps.gz orchid.inf.tudresden....tud9519.ps.gz inf.tudresden.de/pub/...tud9519.ps.gz Cached: PS.gz PS PDF Image Update Help From: orchid.inf.tudresd...publikation (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider primitive recursive program schemes with parameters together with the callby -value computation rule. The schemes are finite systems of functions which are defined by primitive (or: structural) recursion; simultaneous recursion and nesting of function calls is allowed. We present a transformation strategy which replaces primitive recursion by iteration. The transformation strategy which is fully automatic, takes as input a primitive recursive program scheme M with parameters and it... (Update)
Active bibliography (related documents): More All
1.1: Efficient Call-by-value Evaluation of Primitive Recursive.. - Mößle, Vogler (Correct)
0.5: Recursion Versus Iteration at Higher-Orders - Kfoury (1997) (Correct)
0.5: Optimization of Functional Programs by Grammar Thinning - Webber (1995) (Correct)
Similar documents based on text: More All
0.3: Annual Report 1999: Foundations of Programming - Vogler (1999) (Correct)
0.3: Annual Report 1997 of the Professorship "Foundations of.. - Vogler (1997) (Correct)
0.3: Annual Report 1998: Foundations of Programming - Vogler (1998) (Correct)
BibTeX entry: (Update)
@inproceedings{ le-efficient,
author = {Andrea Mößle and Heiko Vogler},
title = {Efficient call-by-value evaluation strategy of primitive recursive program schemes},
year = 1995,
booktitle = {Proceedings of the Fuji International Workshop in Functional and Logic Programming},
publisher = {World Scientific Publishing Co. Pte Ltd.},
url = {citeseer.comp.nus.edu.sg/121374.html} }
Citations (may not include all citations):474 Term rewriting systems - Klop - 1992
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
247 Confluent reductions: abstract properties and applications t.. (context) - Huet - 1980
245 Semantics of context-free languages (context) - Knuth - 1968
139 Recursive functions of symbolic expressions and their comput.. - McCarthy - 1960
81 Specification and Transformation of Programs: a formal appro.. (context) - Partsch - 1990
64 Tabulation techniques for recursive programs (context) - Bird - 1980
50 Macro tree transducers (context) - Engelfriet, Vogler - 1985
48 Towards an automated tupling strategy (context) - Chin - 1993
44 Total correctness by local improvement in the transformation.. - Sands - 1995
44 Algorithmic language and program development (context) - Bauer, Wossner - 1982
38 Attribute grammars and recursive program schemes (context) - Courcelle, Franchi-Zannettacci - 1982
38 Structured programming with go to statements (context) - Knuth - 1974
35 ACM Transactions on Programming Languages and Systems (context) - Paige, Koenig et al. - 1982
33 Semantic evaluation from left to right (context) - Bochmann - 1976
31 Some open questions and recent results on tree transducers a.. (context) - Engelfriet - 1980
24 Implementing term rewriting by jungle evaluation - Hoffmann, Plump - 1991
24 Proving the correctness of recursion-based automatic program.. - Sands - 1995
21 ACM Transactions on Programming Languages and Systems (context) - Feather, for et al. - 1982
13 Recursive programming (context) - Dijkstra - 1960
12 Tupling functions with multiple recursion parameters (context) - Chin, Khoo - 1993
11 Rules and strategies for program transformation (context) - Pettorossi, Proietti - 1993
10 Improving recursive functions by inverting the order of eval.. (context) - Boiten - 1992
9 Improving programs by the introduction of recursion (context) - Bird - 1977
7 A transformation method for dynamic-sized tabulation - Chin, Hagiya - 1995
5 Program transformations expressed by algebraic type manipula.. (context) - Partsch, Pepper - 1986
3 Recursion and iteration (context) - Rice - 1965
2 Information and Control (context) - Duske, Parchmann et al. - 1977
2 Systematic recursion removal (context) - Auslander, Strong - 1978
2 Efficient implementation of structural recursive programs (context) - Thiemann - 1991
2 Compiling fibonacci-like recursion (context) - Indermark, Klaeren - 1987
1 Computational aspects of structural recursion (context) - Indermark, Klaeren et al. - 1990
1 Grammars like macro-like productions (context) - Fischer - 1968
1 Wiley Professional Computing (context) - Sleep, Plasmeijer et al. - 1993
1 Extended linear macro grammars (context) - Asveld, Engelfriet - 1979
1 Tabulating recursive functions without descent laws (context) - Thiemann - 1991
1 Efficient implementation of structural recursion (context) - Indermark, Klaeren - 1987
1 Notes on recursion elimination (context) - Bird - 1977
Documents on the same site (http://orchid.inf.tu-dresden.de/gdp/publikation.html): More
A Pumping Lemma for Output Languages of Macro Tree Transducers - Kühnemann (Correct)
Some Undecidability Results related to the Star Problem in Trace.. - Kirsten (1998) (Correct)
Incremental Evaluators for Ordered Macro Attribute.. - Adamski, Jokubeit.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.