Reduction processor for executing programs stored as treelike gr

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 700

Patent

active

044478755

ABSTRACT:
This disclosure relates to a reduction processor for the evaluation of one or more functions which are stored in memory in the form of a series of nodes of a treelike graph where the nodes implement a variable-free applicative language. The respective function operators are reduced through a progressive series of transformations or substitutions until a result is obtained. During the reduction process, the processor transfers nodes to and from memory and performs various operations as required on those nodes. The processor can also create new nodes in memory and delete unused ones.

REFERENCES:
patent: 3343135 (1967-09-01), Freiman et al.
patent: 3646523 (1972-02-01), Berkling
patent: 4075689 (1978-02-01), Berkling
patent: 4121286 (1978-10-01), Venton et al.
patent: 4149240 (1979-04-01), Misunas et al.
1st International Conference on LISP and Functional Programming at Stanford; Skim-The S,K,I, Reduction Machine; by T. J. W. Clarke; Aug. 25-27, 1980.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Reduction processor for executing programs stored as treelike gr does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reduction processor for executing programs stored as treelike gr, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduction processor for executing programs stored as treelike gr will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1606563

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.