Computer Science – Logic in Computer Science
Scientific paper
2008-06-27
Computer Science
Logic in Computer Science
14 pages, 4 figures, source code appendix
Scientific paper
This paper introduces a new machine architecture for evaluating lambda expressions using the normal-order reduction, which guarantees that every lambda expression will be evaluated if the expression has its normal form and the system has enough memory. The architecture considered here operates using heap memory only. Lambda expressions are represented as graphs, and all algorithms used in the processing unit of this machine are non-recursive.
No associations
LandOfFree
The Heap Lambda Machine does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Heap Lambda Machine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Heap Lambda Machine will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-624385