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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Midtown Scholar Bookstore, Harrisburg, PA, U.S.A.
Paperback. Condizione: Very Good. Standard-sized. Codice articolo mon0000016030
Quantità: 1 disponibili
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Paperback. Condizione: 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. Codice articolo UTD1423644
Quantità: 1 disponibili
Da: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germania
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. Codice articolo 236462
Quantità: 1 disponibili
Da: Gerald Wollermann, Bad Vilbel, Germania
Condizione: 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. Codice articolo 810249
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783540151982_new
Quantità: Più di 20 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Mar3113020160515
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
PF. Condizione: New. Codice articolo 6666-IUK-9783540151982
Quantità: 10 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783540151982
Quantità: 2 disponibili
Da: moluna, Greven, Germania
Condizione: 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. Codice articolo 4882517
Quantità: Più di 20 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783540151982
Quantità: 1 disponibili