Mathematical Foundations Software Development (17 results)

Paperback. Condition: Very Good. Standard-sized.

Paperback. Condition: Good. We are unable to ship to Canada at this time.Ex-library paperback in good condition with the usual markings and attachments. Pages tanned from age. Text block clean and unmarked. Tight binding.

Paperback. Condition: Good. No Jacket. 1st. Wear/soil. W/full markings and pocket. 455 numbered pages, 459 for Amz. Size: 8vo Size: 8vo - over 7¾ - 9¾" tall. Ex-Library.

1985. 436 p. Good condition. Reading pages are slightly yellowed, but they are very clean and without marks. Minimal traces of storage or use. Otherwise very good exemplar. 9783540151982 Sprache: Englisch Gewicht in Gramm: 658 Softcover: 15.5 x 2.5 x 23.5 cm.

Condition: Gut. 1985. 436 Seiten Gedunkelt. Innerhalb Deutschlands Versand je nach Größe/Gewicht als Großbrief bzw. Bücher- und Warensendung mit der Post oder per DHL. Rechnung mit MwSt.-Ausweis liegt jeder Lieferung bei. Sprache: Englisch Gewicht in Gramm: 658 Taschenbuch, Größe: 15.5 x 2.5 x 23.5 cm.

Condition: New.

Condition: New. In.

PF. Condition: New.

Condition: New. pp. 436.

Taschenbuch. Condition: 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. Condition: Neu. 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) | Hartmut Ehrig (u. a.) | Taschenbuch | xviii | Englisch | 1985 | Springer-Verlag GmbH | EAN 9783540151982 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Condition: Very Good. Very Good. Ships from Multiple Locations. book.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 436 pp. Englisch.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 func.

Condition: New. Print on Demand pp. 436 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 436 pp. Englisch.

Condition: New. PRINT ON DEMAND pp. 436.