Skip to main content
SpringerLink
Log in

TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991

Volume 1: Colloquium on Trees in Algebra and Programming (CAAP '91)

  • Conference proceedings
  • © 1991

Overview

Editors:
  1. S. Abramsky
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. T. S. E. Maibaum
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 493)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (24 papers)

  1. Front Matter

    Download chapter PDF

  2. Full abstraction for series-parallel pomsets

    • Luca Aceto
    Pages 1-25

  3. On causality observed incrementally, finally

    • Gian-Luigi Ferrari, Ugo Montanari, Miranda Mowbray
    Pages 26-41

  4. On the domain of traces and sequential composition

    • Martz Z. Kwiatkowska
    Pages 42-56

  5. Compilation of pattern matching with associative-commutative functions

    • E. Kounalis, D. Lugiez
    Pages 57-73

  6. Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties

    • A-C Caron
    Pages 74-89

  7. Algebraic graph rewriting using a single pushout

    • P. M. van den Broek
    Pages 90-102

  8. Unifying initial and loose semantics of parameterized specifications in an arbitrary institution

    • Hubert Baumeister
    Pages 103-120

  9. Non-strict don't care algebras and specifications

    • Egidio Astesiano, Maura Cerioli
    Pages 121-142

  10. Program specification and data refinement in type theory

    • Zhaohui Luo
    Pages 143-168

  11. Static analysis of linear congruence equalities among variables of a program

    • Philippe Granger
    Pages 169-192

  12. Simple solutions for approximate tree matching problems

    • Fabrizio Luccio, Linda Pagli
    Pages 193-201

  13. The tree inclusion problem

    • Pekka Kilpeläinen, Heikki Mannila
    Pages 202-214

  14. Introducing a calculus of trees

    • S. Kasangian, S. Vigna
    Pages 215-240

  15. Domains in a realizability framework

    • Roberto M. Amadio
    Pages 241-263

  16. Iteration algebras extended abstract

    • Stephen L. Bloom, Zoltán Ésik
    Pages 264-274

  17. Logic programming as hypergraph Rewriting

    • Andrea Corradini, Francesca Rossi, Francesco Parisi-Presicce
    Pages 275-295

  18. A fully abstract model for concurrent constraint programming

    • Frank S. de Boer, Catuscia Palamidessi
    Pages 296-319

  19. A solved form algorithm for ask and tell Herbrand constraints

    • Maurizio Gabbrielli, Giorgio Levi
    Pages 320-337

  20. A calculus of broadcasting systems

    • K. V. S. Prasad
    Pages 338-358
Back to top

Keywords

About this book

TAPSOFT '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: - Colloquium on Trees in Algebra and Programming (CAAP); - Advances in Distributed Computing (ADC); - Colloquium on Combining Paradigms for Software Development (CCPSD). The first part (CAAP) is contained in Vol. 1, the other two parts constitute Vol. 2. CAAP '91 focuses on the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered in the broad sense as that of sets of discrete structures and the theory of rewriting systems over them. - Application of discrete structures in computer science: syntax and semantics of programming languages, operational semantics, logic programming, algorithms and data structures, complexity of algorithms and implementation aspects, proof techniques for nonnumerical algorithms, formal specifications, and visualization of structured objects. The ADC talks by distinguished invited speakers survey 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 engineering towards unification and synthesis combining theory and practice, and merging hitherto diverse approaches.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation