Cantitate/Preț
Produs

Formal Program Development: IFIP TC2/WG 2.1 State-of-the-Art Report: Lecture Notes in Computer Science, cartea 755

Editat de Bernhard Möller, Helmut Partsch, Steve Schuman
en Limba Engleză Paperback – 29 noi 1993
This volume contains the background texts for an IFIPState-of-the-Art Seminar on Formal Program Development, heldin early 1992 near Rio de Janeiro, Brazil.The book stems from work done by IFIP Working Group 2.1 onAlgorithmic Languages and Calculi. Since 1975, the WorkingGroup has increasingly focused on systematic approaches toprogramming and on appropriate concepts and notations tosupport such approaches. Today, the calculation of programsfrom specifications constitutes the central theme ofthegroup's work. Thus the core interests of the group are:- formal specification of solutions to problems, and- formal development/calculationof programs from suchspecifications.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31948 lei

Preț vechi: 39936 lei
-20% Nou

Puncte Express: 479

Preț estimativ în valută:
6116 6627$ 5108£

Carte tipărită la comandă

Livrare economică 12-26 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540574996
ISBN-10: 3540574999
Pagini: 388
Ilustrații: IX, 375 p.
Dimensiuni: 155 x 233 x 20 mm
Greutate: 0.55 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Elements of a relational theory of datatypes.- From dynamic programming to greedy algorithms.- Practical transformation of functional programs for efficient execution: A case study.- Behavior-oriented specification in Gist.- Derivation of graph and pointer algorithms.- The refinement calculus, and literate development.- Formal problem specification on an algebraic basis.- Program development in an algebraic setting.- Rules and strategies for program transformation.- Endomorphic typing.- Automating the design of algorithms.- Virtual data structures.