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
- Preț: 353.84 lei
- 18% Preț: 710.26 lei
- Preț: 410.21 lei
- 24% Preț: 587.87 lei
- 17% Preț: 498.73 lei
- 20% Preț: 753.24 lei
- 20% Preț: 824.73 lei
- 24% Preț: 632.96 lei
- Preț: 338.54 lei
- 15% Preț: 574.15 lei
- 14% Preț: 695.55 lei
- Preț: 333.01 lei
- 15% Preț: 455.32 lei
- Preț: 343.12 lei
- Preț: 466.19 lei
- 15% Preț: 435.73 lei
- Preț: 439.49 lei
- 15% Preț: 681.96 lei
- Preț: 407.17 lei
- 15% Preț: 427.54 lei
- 15% Preț: 507.89 lei
- 15% Preț: 567.39 lei
- Preț: 340.15 lei
- 18% Preț: 700.13 lei
- Preț: 373.39 lei
- 15% Preț: 437.60 lei
- 15% Preț: 462.88 lei
- Preț: 447.07 lei
- Preț: 335.70 lei
- Preț: 348.46 lei
- Preț: 469.75 lei
- 15% Preț: 430.69 lei
- Preț: 404.02 lei
- Preț: 373.93 lei
- Preț: 403.45 lei
- 15% Preț: 559.06 lei
- Preț: 479.01 lei
- Preț: 346.99 lei
- Preț: 373.19 lei
- Preț: 404.02 lei
- 18% Preț: 698.28 lei
- Preț: 436.71 lei
- Preț: 371.88 lei
- Preț: 346.06 lei
Preț: 376.16 lei
Nou
Puncte Express: 564
Preț estimativ în valută:
71.99€ • 75.94$ • 60.17£
71.99€ • 75.94$ • 60.17£
Carte tipărită la comandă
Livrare economică 31 decembrie 24 - 14 ianuarie 25
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.