Hitachi, Ltd.

Koichi Yamano

Ryoichi Sasaki

Hiroshi Koike

Hiroyuki Maezawa

Hironobu Kuruma

Akihiko Takano

Shinobu Koizumi

Singi Domen

Yoshinori Kishimoto

Hidehiro Oomae

Masashi Amano

Koichi Taguchi

Kaori Kondoh

Hiroshi Isobe

A slip processing method for simplifying a processing of a job which uses a form of a predetermined format at a frequency of once a long term such as month, quarter or year and in which an input form is changed at a frequency of once per several times of use. The method comprises storing format information of an input form and data information in one file, providing a format of the input form including a plurality of tables each comprising a plurality of items (cells), storing data in corresponding ones of the items, executing a retrieval of the items and a totalization of data in the items with referencing a file which stores the format information and the data of the input form and storing the format information and the data of the input form and the processed information in a form which is transmittable through a network.

Slip processing method processing data from slips with varying formats

In transformation from a symbol string to a term, transformation rules received describe structures of input symbol strings in the form of a context-free grammar, and include structures of output terms as arguments of terminal symbols and non-terminal symbols. An inputted symbol string is analyzed by reduction processing based on the structures of input symbol strings described in the transformation rules, and an intermediate tree is formed. A term for output is produced in accordance with the structures of output terms shown in the arguments of the terminal symbols and the non-terminal symbols corresponding to the structure of the inputted symbol string. Transformation of structured data is performed in like manner using transformation rules which describe structures of input data in terms of relations between classes of partial structures, and includes structures of output data as arguments of class identifiers.

Data transforming method using externally provided transformation rules

A plurality of program components, which do not have matching interfaces, are combined together automatically to generate a larger new program. An interface specifications' database registers the interface specifications corresponding to each of the program components. A program transformation rule memory stores transformation rules for controlling the reconciliation of the non-matching interface specifications of the program components. A data type memory stores data type transformation rules for reconciling non matching data specifications. A mediating program generator detects a mismatch of the interface specifications between at least two program components which are being combined and generates a mediating program in accordance with the program transformation rule and the data type transformation rule which mediating program enables the two programs and their data to communicate. A components composer generates the larger new program from the program components in the program components' database and the generated mediating program.

Program synthesizing method and apparatus

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.

Combination reduction processing method and apparatus

Growing community of inventors

Tama, Japan

Koichi Yamano