Titlebook: RIMS Symposium on Software Science and Engineering II; Proceedings of the S Eichi Goto,Keijiro Araki,Taiichi Yuasa Conference proceedings 1

Herd-Immunity

不能妥协

OR-Parallel Optimizing Prolog System: Pops its design and implementation in Concurrent Prolog,. POPS has the following features: 1) Programs are executed in OR-Parallel. 2) The same subcomputations are shared. 3) Left recursive rules can be handled without entering an infinite loop. At present, POPS is implemented in Concurrent Prolog supporting AND-Parallel execution and process synchroniza

animated

,Incorporating Naïve Negation into Prolog,negative information. We present query response forms for PPN and their semantics and propose an execution algorithm. Furthermore, we discuss semantics and an execution algorithm for PPN as viewed from the standpoint of intuitionistic logic. Then, we present a knowledge assimilation system and show

Confound

,Multiversion concurrency control scheme for a distributed database system — A trial to break concurtwo copies allocated in different sites in the system. Unlike the usual distributed database systems with redundant copies, these two copies are not concurrently updated, but only one is updated for a write request. For each data object, the copy with a newly updated value is called the new version

字谜游戏

On program transformation with tupling technique,guage and formalize a problem to find a . for transformation of a recursive program written in the language. We discuss the transformation scheme with the tuple given as the solution to the problem and show that the execution efficiency will be improved by the new scheme. Under a certain constraint,

Nerve-Block

Evaluation of working set algorithms for data-flow machines,low programs which include branches, loops, and procedure calls. The algorithms for computing the D-, E-, and L-levels are revised and the performance for static data-flow programs is reevaluated. Algorithms to manage branches, loops, and function calls are developed. The effectiveness of these algo

言行自由

Comparison of closure reduction and combinatory reduction schemes,f a λ-term into combinatory terms, i.e. bracket abstraction, can be viewed as attaching labels S, B, C, K, I to each node. Similarly, a node of a tree representing a λ-term can be labelled depending upon the presence of free variables in the subtrees. Resulting labelled trees which represent a λ-ter

缩减了

Mingle

跳脱衣舞的人

Partial computation with a dataflow machine,ass of partial computation. This paper also clarifies a dataflow graph generation method for the DCSB model by describing the main differences in code generation between the DCSB model and the CT model..The proposed dataflow models are promising for applicative programing language machine architectures.