REMREC - A program for Automatic Recursion Removal
It is well known that recursive functions are very common in LISP. Recursive code is mostly the easiest to write and to analyse. However, situations often arise when it is preferable to let the computer work with non recursive functions. Examples of this are in compiled code and on stack overflow. I...
Main Author: | |
---|---|
Format: | Others |
Language: | English |
Published: |
Uppsala universitet, Datalogi
1973
|
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-18538 http://nbn-resolving.de/urn:isbn:DLU73/24 |
id |
ndltd-UPSALLA1-oai-DiVA.org-uu-18538 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UPSALLA1-oai-DiVA.org-uu-185382013-06-21T04:09:48ZREMREC - A program for Automatic Recursion RemovalengRisch, ToreUppsala universitet, DatalogiDatalogiUppsala Univerity (Datalogilaboratoriet)1973It is well known that recursive functions are very common in LISP. Recursive code is mostly the easiest to write and to analyse. However, situations often arise when it is preferable to let the computer work with non recursive functions. Examples of this are in compiled code and on stack overflow. It is then very often possible to remove recursion (at least partly) in the functions, without therefore introducing stacks in the new code. Remrec is a program, which automatically transfers some classes of recursive LISP functions into equivalent non recursive ones, without introducing stacks. Reportinfo:eu-repo/semantics/reporttexthttp://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-18538urn:isbn:DLU73/24application/pdfinfo:eu-repo/semantics/openAccess |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
description |
It is well known that recursive functions are very common in LISP. Recursive code is mostly the easiest to write and to analyse. However, situations often arise when it is preferable to let the computer work with non recursive functions. Examples of this are in compiled code and on stack overflow. It is then very often possible to remove recursion (at least partly) in the functions, without therefore introducing stacks in the new code. Remrec is a program, which automatically transfers some classes of recursive LISP functions into equivalent non recursive ones, without introducing stacks. |
author |
Risch, Tore |
spellingShingle |
Risch, Tore REMREC - A program for Automatic Recursion Removal |
author_facet |
Risch, Tore |
author_sort |
Risch, Tore |
title |
REMREC - A program for Automatic Recursion Removal |
title_short |
REMREC - A program for Automatic Recursion Removal |
title_full |
REMREC - A program for Automatic Recursion Removal |
title_fullStr |
REMREC - A program for Automatic Recursion Removal |
title_full_unstemmed |
REMREC - A program for Automatic Recursion Removal |
title_sort |
remrec - a program for automatic recursion removal |
publisher |
Uppsala universitet, Datalogi |
publishDate |
1973 |
url |
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-18538 http://nbn-resolving.de/urn:isbn:DLU73/24 |
work_keys_str_mv |
AT rischtore remrecaprogramforautomaticrecursionremoval |
_version_ |
1716589495867932672 |