Cantitate/Preț
Produs

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): Lecture Notes in Computer Science, cartea 493

Editat de S. Abramsky, T. S. E. Maibaum
en Limba Engleză Paperback – 28 mar 1991
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32294 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 28 mar 1991 32294 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 28 mar 1991 32448 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32294 lei

Preț vechi: 40367 lei
-20% Nou

Puncte Express: 484

Preț estimativ în valută:
6182 6646$ 5153£

Carte tipărită la comandă

Livrare economică 19 decembrie 24 - 02 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540539827
ISBN-10: 3540539824
Pagini: 468
Ilustrații: VIII, 455 p.
Dimensiuni: 155 x 233 x 25 mm
Greutate: 0.65 kg
Ediția:1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.