trees algebra programming caap (53 risultati)

383 pages Ex-Library book in very good condition. 9783540509394 Sprache: Englisch Gewicht in Gramm: 880.

Paperback. Condizione: Very Good. Cover rubbed - book ow solid & bright 413 pages.

Broschur. Condizione: Wie neu. 416 S. Computerwissenschaften Mathematik Mathematics Guter Zustand/ Good. Ex-Library. Brownish paper. ha1082113 Sprache: Englisch Gewicht in Gramm: 700.

Paperback. Condizione: Very Good. Clean bright tight book 360 pages.

Broschur. Condizione: Wie neu. 284 S. Computerwissenschaften Mathematik Mathematics Guter Zustand/ Good. Ex-Library. ha1082114 Sprache: Englisch Gewicht in Gramm: 600.

Broschur. Condizione: Wie neu. 364 S. Computerwissenschaften Mathematik Mathematics Guter Zustand/ Good. Ex-Library. Brownish paper. ha1082115 Sprache: Englisch Gewicht in Gramm: 650.

Paperback. Condizione: Very Good. Condizione sovraccoperta: No Dust Jacket. Lecture Notes in Computer Science 581; Ex-Library. Previous owner's sticker on the front cover. Ink stamp and small pen inscription on half-title page. Library catalogue sticker inside front cover. Faintly bumped spine head and rubbed corners. Foot of page block slightly grubby and marked due to age. Sound, clean book with tight binding. ADG. Ex-Library.

Paperback. Condizione: Very Good. Condizione sovraccoperta: No Dust Jacket. Lecture Notes in Computer Science 431; Ex-Library. Previous owner's sticker on the front cover. Ink stamp and small pen inscription on title page; library catalogue sticker on colophon. Minute traces of sticker residue and faintly bumped spine head and leading corners. Sound, clean book with tight binding. ADG. Ex-Library.

Paperback. Condizione: Wie neu. 306 Ehemaliges Bibliotheksexemplar, Gebrauchsspuren, div. Stempel, gebräunt Mathematic Mathematik With figures. Ex-Library. Brownish paper. Guter Zustand/ Good With figures. Ex-Library. ha1090477 Sprache: Deutsch Gewicht in Gramm: 750.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - On the complexity of branching programs and decision trees for clique functions.- Average complexity of additive properties for multiway tries: A unified approach.- Longest common factor of two words.- An unification semi-algorithm for intersection type schemes.- Optimal run time optimization proved by a new look at abstract interpretations.- Transformation ordering.- On parametric algebraic specifications with clean error handling.- Toward formal development of programs from algebraic specifications: Implementations revisited.- Finite algebraic specifications of semicomputable data types.- On the semantics of concurrency: Partial orders and transition systems.- CCS without 's.- A fully observational model for infinite behaviours of communicating systems.- SMoLCS-driven concurrent calculi.- Parameterized horn clause specifications: Proof theory and correctness.- Partial composition and recursion of module specifications.- Efficient representation of taxonomies.- Applications of compactness in the Smyth powerdomain of streams.- Characterizing Kripke structures in temporal logic.- Dialogue with a proof system.- Induction principles formalized in the calculus of constructions.- Algebraic semantics.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Specification and top down design of distributed systems.- Specification languages for distributed systems.- Semantically based programming tools (Summary).- From function level semantics to program transformation and optimization.- Inductively defined functions.- Three approaches to type structure.- On the maximum size of random trees.- Fast searching in a real algebraic manifold with applications to geometric complexity.- Typed categorical combinatory logic.- A path ordering for proving termination of term rewriting systems.- A rewrite rule based approach for synthesizing abstract data types.- ¿Delayability¿ in proofs of strong normalizability in the typed lambda Calculus.- Bisimulations and abstraction homomorphisms.- A metric characterization of fair computations in CCS.- A complete modal proof system for a subset of SCCS.- Amalgamation of graph transformations with applications to synchronization.- Decompilation of control structures by means of graph transformations.- Synchronized bottom-up tree automata and L-systems.- On observational equivalence and algebraic specification.- Parameter preserving data type specifications.- On the parameterized algebraic specification of concurrent systems.- The semantics of shared submodules specifications.- Why Horn formulas matter in computer science: Initial structures and generic examples.- On the implementation of abstract data types by programming language constructs.- A LISP compiler for FP language and its proof via algebraic semantics.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains selected papers presented at theseventeenth Colloquiumon Trees in Algebra and Programming(CAAP) held jointly with the European Symposium onProgramming (ESOP) in Rennes, France, February 26-28, 1992(the proceedings of ESOP appear in LNCS 582). The previouscolloquia were held in France, Italy, Germany, Spain,Denmark and England. Every even year, as in 1992, CAAP isheld jointly with ESOP; every other year, it is part ofTAPSOFT (Theory And Practice of SOFTware development). Inthe beginning, CAAP was devoted to algebraic andcombinatorial properties of trees and their role in variousfields of computer science. The scope of CAAP has now beenextended to other discrete structures, like graphs,equations and transformations of graphs, and their linkswith logical theories. The programme committee received 40submissions, from which 19 papers have been selected forinclusion inthis volume.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereedproceedings of the 21st International Colloquium on Trees in Algebra and Programming, CAAP '96, held in Linköping, Sweden, in April 1996.The 21 full revised papers presented were selected from 44 submissions; also included are invited papers by Samson Abramsky and Frank Pfenning. In keeping with the tradition of the CAAP conferences, this volume covers algebraic, logical, and combinatorial properties of discrete structures and their application to computer science, in particular to the theory of computation and to programming theory.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the proceedings of the 13th Colloquium on Trees in Algebra and Programming (CAAP '88), held in Nancy, March 21-24, 1988. The preceding 12 colloquia were held in France, Italy and Germany. CAAP '85 and CAAP '87 were integrated into the International Joint Conference on Theory and Practice of Software Development, TAPSOFT (see Lecture Notes in Computer Science volumes 185 and 249). As another effort to link theory and practice in computer science, CAAP '88 was held in conjunction with the European Symposium on Programming, ESOP '88 (see volume 300 of this Lecture Notes series). CAAP '88 is a conference in the area of program development and programming concepts but, following the tradition, is devoted to theoretical aspects, and especially to Trees, a basic structure of computer science. A wider range of topics in theoretical computer science is also covered. The papers are on word, tree or graph languages, with algorithmic or complexity studies, on abstract data types (another classical topic of CAAP) and/or term rewriting systems and on non-standard logics, and parallelism and concurrency.