Handbook for Automatic Computation: Volume I · Part a: Grundlehren der mathematischen Wissenschaften, cartea 135
Autor Heinz Rutishauser Editat de Friedrich L. Bauer, Alston S. Householderen Limba Engleză Paperback – 2 iun 2012
Din seria Grundlehren der mathematischen Wissenschaften
- 24%
Preț: 654.97 lei - 17%
Preț: 539.72 lei - 18%
Preț: 867.65 lei -
Preț: 641.48 lei -
Preț: 371.84 lei - 18%
Preț: 747.16 lei -
Preț: 417.52 lei - 24%
Preț: 685.05 lei - 15%
Preț: 573.68 lei - 24%
Preț: 828.39 lei - 18%
Preț: 874.17 lei - 18%
Preț: 875.70 lei - 15%
Preț: 455.01 lei - 15%
Preț: 688.12 lei - 24%
Preț: 1208.66 lei - 20%
Preț: 615.40 lei - 15%
Preț: 435.43 lei -
Preț: 343.01 lei -
Preț: 403.27 lei -
Preț: 465.91 lei -
Preț: 406.97 lei - 15%
Preț: 427.26 lei - 15%
Preț: 507.50 lei - 15%
Preț: 566.94 lei -
Preț: 340.03 lei - 18%
Preț: 699.51 lei -
Preț: 373.24 lei - 15%
Preț: 437.32 lei - 15%
Preț: 462.55 lei -
Preț: 446.83 lei -
Preț: 348.34 lei -
Preț: 469.46 lei - 15%
Preț: 430.41 lei -
Preț: 403.83 lei - 18%
Preț: 709.63 lei -
Preț: 373.76 lei -
Preț: 403.27 lei - 15%
Preț: 558.62 lei -
Preț: 478.73 lei -
Preț: 346.88 lei -
Preț: 373.03 lei -
Preț: 403.83 lei -
Preț: 436.47 lei
Preț: 376.01 lei
Nou
Puncte Express: 564
Preț estimativ în valută:
66.53€ • 78.21$ • 58.27£
66.53€ • 78.21$ • 58.27£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642869365
ISBN-10: 364286936X
Pagini: 344
Ilustrații: XII, 326 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:Softcover reprint of the original 1st ed. 1967
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Grundlehren der mathematischen Wissenschaften
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 364286936X
Pagini: 344
Ilustrații: XII, 326 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:Softcover reprint of the original 1st ed. 1967
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Grundlehren der mathematischen Wissenschaften
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
I Introduction.- § 1. The Concept of Automatic Programming.- § 2. Historical Remarks on Algorithmic Languages.- § 3. The Algol Conferences of 1958, 1960, 1962.- § 4. Algol Dialects and the IFIP Subset of Algol 60.- § 5. Preliminary Definition of Algol.- II Basic Concepts.- § 6. Auxiliary Conventions.- § 7. The Basic Symbols of Algol.- § 8. Values.- § 9. Quantities and their Names.- § 10. Numerical Constants.- § 11. Labels.- § 12. Strings.- § 13. Comments.- III Expressions.- § 14. Variables.- § 15. Function Designators.- § 16. Simple Arithmetic Expressions.- § 17. Relations.- § 18. Simple Boolean Expressions.- § 19. Conditional Expressions.- § 20. Subscript Expressions.- IV Statements.- § 21. Assignment Statements.- § 22. Sequences of Statements.- § 23. Labelled Statements.- § 24. The Dummy Statement.- § 25. Goto-Statements.- § 26. Procedure Statements I.- § 27. Compound Statements and Blocks.- § 28. The If-Statement.- § 29. The If-Else-Statement.- § 30. The For-Statement.- V Miscellaneous Applications.- § 31. Algebraic Problems.- § 32. Interpolation and Numerical Quadrature.- § 33. Numerical Integration of Differential Equations.- § 34. Least Square Problems.- §35. Computations Related to Continued Fractions.- § 36. Considerations Concerning Computer Limitations.- §37. Data Processing Applications.- VI Declarations.- § 38. Type Declarations.- § 39. Array Declarations.- § 40. Switch Declarations.- § 41. Procedure Declarations I.- §42. Semantics of Blocks.- §43. Entire Programs.- VII Procedures.- § 44. Procedure Declarations II.- §45. Procedure Statements II.- § 46. Function Procedures and their Use.- § 47. Code Procedures.- § 48. Parameter Procedures.- VIII Input and Output.- § 49. The Standard I/O-Procedures of Algol.- §50. Applications of Procedures insymbol, outsymbol.- §51. Use of inarray, outarray for Auxiliary Storage.- Appendix A.- § 52. The Jensen Device.- 52.1. The full name-concept.- 52.2. The Jensen device.- 52.3. Bound variables.- § 53. Conclusion.- 53.1. Church’s lambda notation.- 53.2. The lambda notation for arrays.- 53.3. Syntax of the proposed extension.- 53.4. Semantics of the proposed extension.- 53.5. Applications of the proposed extension.- Appendix B. The IFIP-Reports on Algol.- References.