Programming of Future Generation Computers II: Proceedings of the Second Franco-Japanese Symposium on Programming of Future Generation Computers, Cannes, France, 9-11, November, 1987, Volume 2Kazuhiro Fuchi, Laurent Kott The ten-year Japanese Fifth Generation Computer R&D project, managed by ICOT (the Institute for New Generation Computer Technology) began in 1982 with the aim of developing a new type of computer suitable for an information-oriented society. With the belief that it is essential to co-operate with researchers all over the world, ICOT has been promoting international research exchanges, including these top-level France-Japan symposia. This volume contains the papers presented by twelve French and twelve Japanese researchers at the second symposium. The following sessions were held: - fifth generation programming languages, methodologies and environments - models and programming languages for parallelism - automated deduction and symbolic computation - machine architectures dedicated to fifth generation languages - expert systems and natural language understanding systems. |
Contents
Experiments on a SIMDSPMD Architecture and its Programming | 18 |
Concurrency and Atomicity | 35 |
On Using ContextFree Graph Grammars for Analyzing Recursive Definitions | 83 |
Copyright | |
16 other sections not shown
Common terms and phrases
abstract abstract interpretation algebra algorithm analysis application argument roles atom axioms bisimulation called CDGs cells clause communication overhead communication rate concurrent consider constraints construction context-free corresponding critical pair database deductive databases defined definition denoted domain efficiency eval(n evaluation event structures example execution exp1 exp2 expk expression Figure finite formula from-space function Functional Programming goal grammar ICOT implementation inter-PE interpretation labelled logic programming machine memory method mode Multi-PSI/V1 natural language object operation operational semantics OPSILA optimization parameters parsing partial predicate primitive problem program transformation programming language Prolog proof query R₁ recursive redex reduction relative communication represented result rules Saint-Dizier second-order logic semantics sequence sequential SIMD situation SLD-AL SPMD symbols synchronization syntactic system performance term rewriting systems Theorem transition transition relation tree true tuple unifiable unification variable vector