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)
Series: Lecture Notes in Computer Science; 493;
- Publisher's listprice EUR 53.49
-
22 690 Ft (21 609 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 4 538 Ft off)
- Discounted price 18 152 Ft (17 287 Ft + 5% VAT)
22 690 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 1991
- Publisher Springer
- Date of Publication 28 March 1991
- Number of Volumes 1 pieces, Book
- ISBN 9783540539827
- Binding Paperback
- No. of pages455 pages
- Size 233x155 mm
- Weight 1440 g
- Language English
- Illustrations VIII, 455 p. 0
Categories
Short description:
The proceedings of TAPSOFT '91 are organized into three parts: Colloquium on Trees in Algebra and Programming (CAAP), contained in Vol. 1, and Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Development (CCPSD), both contained in Vol. 2. The proceedings are published in two volumes.
MoreLong description:
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.
Springer Book Archives
Table of Contents:
Full abstraction for series-parallel pomsets.- On causality observed incrementally, finally.- On the domain of traces and sequential composition.- Compilation of pattern matching with associative-commutative functions.- Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties.- Algebraic graph rewriting using a single pushout.- Unifying initial and loose semantics of parameterized specifications in an arbitrary institution.- Non-strict don't care algebras and specifications.- Program specification and data refinement in type theory.- Static analysis of linear congruence equalities among variables of a program.- Simple solutions for approximate tree matching problems.- The tree inclusion problem.- Introducing a calculus of trees.- Domains in a realizability framework.- Iteration algebras extended abstract.- Logic programming as hypergraph Rewriting.- A fully abstract model for concurrent constraint programming.- A solved form algorithm for ask and tell Herbrand constraints.- A calculus of broadcasting systems.- Object-based concurrency : A process calculus analysis.- On the complexity of equation solving in process algebra.- Comparative semantics for a real-time programming language with integration.- A complete proof system for timed observations.- Type inference with inequalities.
More
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)
Subcribe now and receive a favourable price.
Subscribe
22 690 HUF
