Skip to main content
SpringerLink
Log in

Mathematical Foundations of Software Development. Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, March 25-29, 1985

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

  • Conference proceedings
  • © 1985

Overview

Editors:
  1. Hartmut Ehrig
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Christiane Floyd
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Maurice Nivat
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. James Thatcher
    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 185)

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 59.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

Keywords

Table of contents (26 papers)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    • Hartmut Ehrig
    Pages 1-3

  3. Specification and top down design of distributed systems

    • Manfred Broy
    Pages 4-28

  4. Specification languages for distributed systems

    • Pierpaolo Degano, Ugo Montanari
    Pages 29-51

  5. Semantically based programming tools (Summary)

    • William L. Scherlis, Dana S. Scott
    Pages 52-59

  6. From function level semantics to program transformation and optimization

    • John Backus
    Pages 60-91

  7. Inductively defined functions

    • R. M. Burstall
    Pages 92-96

  8. Three approaches to type structure

    • John C. Reynolds
    Pages 97-138

  9. On the maximum size of random trees

    • M. Protasi, M. Talamo
    Pages 139-144

  10. Fast searching in a real algebraic manifold with applications to geometric complexity

    • Bernard Chazelle
    Pages 145-156

  11. Typed categorical combinatory logic

    • P-L. Curien
    Pages 157-172

  12. A path ordering for proving termination of term rewriting systems

    • D. Kapur, P. Narendran, G. Sivakumar
    Pages 173-187

  13. A rewrite rule based approach for synthesizing abstract data types

    • Deepak Kapur, Mandayam Srivas
    Pages 188-207

  14. “Delayability” in proofs of strong normalizability in the typed lambda Calculus

    • Michael Karr
    Pages 208-222

  15. Bisimulations and abstraction homomorphisms

    • Ilaria Castellani
    Pages 223-238

  16. A metric characterization of fair computations in CCS

    • Gerardo Costa
    Pages 239-252

  17. A complete modal proof system for a subset of SCCS

    • Colin Stirling
    Pages 253-266

  18. Amalgamation of graph transformations with applications to synchronization

    • Paul Boehm, Harald-Reto Fonio, Annegret Habel
    Pages 267-283

  19. Decompilation of control structures by means of graph transformations

    • Ulrike Lichtblau
    Pages 284-297

  20. Synchronized bottom-up tree automata and L-systems

    • E. Fachini, M. Napoli
    Pages 298-307
Back to top

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation