
The FUNARG Problem Explained
Joseph Weizenbaum
The FUNARG Problem Explained
Joseph Weizenbaum
Book Details:
Year: | 1968 |
Publisher: | MIT |
Pages: | 58 pages |
Language: | english |
Since: | 04/06/2014 |
Size: | 4.93 MB |
License: | Pending review |
Content:
In computer science, the funarg problem refers to the difficulty in implementing first-class functions (functions as first-class objects) in programming language implementations so as to use stack-based memory allocation of the functions.
The difficulty only arises if the body of a nested function refers directly (i.e., not via argument passing) to identifiers defined in the environment in which the function is defined, but not in the environment of the function call. To summarize the discussion below, two standard resolutions are to either forbid such references or to create closures.
There are two subtly different versions of the funarg problem. The upwards funarg problem arises from returning (or otherwise transmitting "upwards") a function from a function call. The downwards funarg problem arises from passing a function as a parameter to another function call.
This paper shows that a symbol table tree (in place of a stack) serves to avoid identifier collisions appropriately. The paper develops a lambda calculus argument as, a tutorial for the problem and its solution.
Categories:
Tags:
Loading comments...
Scanning lists...
The book in numbers
rank in category
online since
04/06/2014rate score
Nothing yet...votes
Nothing yet...Social likes
Nothing yet...Views
Downloads
Interest
Countries segmentation
Source Referers
Websites segmentation
evolution
Loading...