## TAPSOFT '91. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991: Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Development (CCPSD), Volume 2; Volume 1991TAPSOFT '91 is the Fourth International Joint Conference on Theory and Practice of Software Development. It was held in Brighton, April 8-12, 1991, and was organized by the Department of Computing, Imperial College, London. The proceedings of TAPSOFT '91 are organized into three parts: - Advances in Distributed Computing (ADC) - Colloquium on Trees in Algebra and Programming (CAAP) - Colloquium on Combining Paradigms for Software Development (CCPSD) The proceedings are published in two volumes. The first volume (LNCS, Vol. 493) contains the papers from CAAP. The second volume (LNCS, Vol. 494) contains the papers from the ADC and CCPSD. The ADC talks by distinguished invited speakers surveys current developments in distributed computing, including the integration of different paradigms for concurrency, algebraic, logical and operational foundations, and applications to software engineering and formal methods. The CCPSD papers address aspects of the trend in software enginering towards unification and synthesis combining theory and practice, and merging hitherto diverse approaches. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

H Ehrig Berlin | 1 |

K Furukawa ICOT Tokio | 23 |

A Piperno Univ La Sapienza Roma | 39 |

Copyright | |

19 other sections not shown

### Other editions - View all

### Common terms and phrases

abstract abstract data types algebra algorithm application arguments atom binding array clause logic compilation constant constraints construction constructor corresponding data structures data types Database declarations defined definition denoted derived Disk domain elements environment equations evaluation example execution expression functional programming functor GCode goal graph hash table Herbrand terms Herbrand universe Horn clause implementation instantiation intensional negation Intset lazy evaluation Logic Programming meta call meta clauses meta programming meta relations Module negation as failure NewGoal node occur operational semantics operations order-sorted Panelout parameter PARLOG polymorphic lambda postcondition precondition predicate Proc processor programming language Prolog proof properties query manager recursive reduction resolution result retractions rule satisfies semantics sequence signature sort specification stack Standard ML strategy strict subterm theorem theory transformation tree try-block tuple unification update variables