US4734848A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Combination reduction processing method and apparatus
Assignee: Hitachi Ltd
•
Filing: 1985-07-15
•
Granted: 1988-03-29
•
Expires: 2005-07-15
Abstract
Abstract A calculation processing system characterized by decomposing a program into tuples, functions and variables, including abstracting the decomposed program thereby to transform it into a combinator graph, assigning the program in the combinator graph to a plurality of process units, and executing the assigned program through reductions.
Inventors
- 👤 Koichi Yamano
- 👤 Akihiko Takano
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 13:51
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/30; G06F8/31; G06F8/311; G06F9/00; G06F9/06; G06F9/44; G06F9/448; G06F9/4494
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
61 words
A data processing method in an information processing system having a processor means comprising the steps of: transforming a program into an applicative graph which includes tuples, functions and variables; abstracting said applicative graph to transform it into a combinator graph; assigning the program in the combinator graph to a plurality of process units; and executing an assigned program through reductions.
Claim 2
Dependent Claim
61 words
A data processing method in an information processing system having a processor means comprising the steps of: transforming a program into an applicative graph which includes tuples, functions and variables; abstracting said applicative graph to transform it into a combinator graph; assigning the program in the combinator graph to a plurality of process units; and executing an assigned program through reductions.
Claim 3
Dependent Claim
25 words
A data processing method according to claim 1, wherein said program is a functional program, and said combinator graph contains tuple structures and no variable.
Claim 4
Dependent Claim
66 words
A data processing apparatus comprising means to transform a program into an applicative graph which includes tuples, functions and variables and to transform said applicative graph into a combinator graph, connected to means to assign the program in the combinator graph to a plurality of processors provided beforehand, and means connected to said assign means to execute a program assigned by said assign means through reductions.
Claim 5
Dependent Claim
66 words
A data processing apparatus comprising means to transform a program into an applicative graph which includes tuples, functions and variables and to transform said applicative graph into a combinator graph, connected to means to assign the program in the combinator graph to a plurality of processors provided beforehand, and means connected to said assign means to execute a program assigned by said assign means through reductions.
Claim 6
Dependent Claim
68 words
A data processing method in an information processing system having a processor means comprising the steps of: transforming a program into an applicative graph which includes products, functions, variables, constants and appliers; subjecting said applicative graph to abstraction thereby to transform it into a combinator graph having a product structure and containing no variable; and executing the program in the combinator graph having the product structure, through reductions.
Claim 7
Dependent Claim
68 words
A data processing method in an information processing system having a processor means comprising the steps of: transforming a program into an applicative graph which includes products, functions, variables, constants and appliers; subjecting said applicative graph to abstraction thereby to transform it into a combinator graph having a product structure and containing no variable; and executing the program in the combinator graph having the product structure, through reductions.
Claim 8
Dependent Claim
24 words
A data processing method according to claim 4, wherein said step of executing the program through reductions is carried out by pointer caching registers.
Claim 9
Dependent Claim
17 words
A data processing method according to claim 5, wherein pointer caching includes the step of pipeline control.
Claim 10
Dependent Claim
39 words
A data processing method according to claim 1, including the further step of storing the program in the combinator graph in a random access memory for simultaneously reading out a plurality of sets and subjecting it to the reductions.
Claim 11
Dependent Claim
51 words
A data processing method in an information processing system having processor means and a memory means and comprising the steps of: abstracting by said processor means a program in said memory means to transform it into a combinator graph which has a product structure; and executing said combinator graph through reductions.
Claim 12
Dependent Claim
51 words
A data processing method in an information processing system having processor means and a memory means and comprising the steps of: abstracting by said processor means a program in said memory means to transform it into a combinator graph which has a product structure; and executing said combinator graph through reductions.
Claim 13
Dependent Claim
27 words
A data processing method according to claim 8, wherein said program is a functional program, and said combinator graph has a product structure and containing no variable.
Claim 14
Dependent Claim
40 words
A data processing method according to claim 8, wherein said processor means has a plurality of processing units and said step of executing further includes the step of assigning said combinator graph into said processing units prior to said executing.
Claim 15
Dependent Claim
29 words
A data processor method according to claim 8, wherein said method includes the further step of decomposing a program into at least product and functions prior to said abstracting.
Claim 16
Dependent Claim
20 words
A data processing method according to claim 8, wherein said program is described in a functional or applicative programming language.
Claim 17
Dependent Claim
39 words
A data processing method according to claim 8, wherein said method includes the step of transforming the program into an applicative graph which includes products, functions variables, constants and appliers, prior to transforming said program into a combinator graph.
Claim 18
Dependent Claim
23 words
A data processing method according to claim 8, wherein said reductions are carried out by the further step of operating pointer caching registers.
Claim 19
Dependent Claim
22 words
A data processing method according to claim 14, wherein said step of pointer caching is performed by the step of pipeline control.
Claim 20
Dependent Claim
39 words
A data processing method according to claim 8, including the further step of storing said program, having a combinator graph, in a random access memory for simultaneously reading out a plurality of sets and is subjected to said reductions.
Claim 21
Dependent Claim
31 words
A data processing apparatus comprising: transforming means to transform a program by abstracting into a combinator graph which has a product structure, and means to execute said combinator graph through reductions.
Claim 22
Dependent Claim
31 words
A data processing apparatus comprising: transforming means to transform a program by abstracting into a combinator graph which has a product structure, and means to execute said combinator graph through reductions.
Claim 23
Dependent Claim
37 words
A data processing apparatus according to claim 17, wherein said means to execute further includes means to assign the program in the combinator graph to a plurality of processor, prior to executing said combinator graph through reductions.
Claim 24
Dependent Claim
49 words
A data processing apparatus according to claim 17, wherein said program is described in a functional or applicative programming language, and further includes means to transform said program into an applicative graph which includes products, functions, variables, constants and appliers prior to transforming said program into a combinator graph.
References Cited (Backward Citations)
US4514807A
Cited
US4447875A
Cited
US4502118A
Cited
US4615003A
Cited
US4644464A
Cited
US4654780A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-03-29 | 1991-09-28 | 1992-03-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-03-29 | 1995-09-28 | 1996-03-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-03-29 | 1999-09-28 | 2000-03-29 | $7700.00 | Window Closed / Lapsed |