By Walter S. Brainerd
A primary functional advisor to Fortran ninety via contributors of the X3J3 Committee. it is a instructional on Fortran ninety for programmers and engineers and scientists who paintings with Fortran seventy seven and want to benefit the seriously revised criteria supplied for in Fortran ninety. coated during this advisor to programming languages are easy ideas, easy programming routines, quite a few examples and difficulties. Written by means of 4 senior participants of the ANSI Fortran criteria Committee X3J3, this publication serves as a short resource of data for working towards pros.
Read or Download A Programmer's Guide to Fortran 90 PDF
Best compilers books
Joel Spolsky all started his mythical net log, www. joelonsoftware. com, in March 2000, that allows you to provide insights for making improvements to the area of programming. Spolsky dependent those observations on years of private adventure. the outcome only a handful of years later? Spolsky's technical wisdom, caustic wit, and awesome writing abilities have earned him prestige as a programming guru!
From Linear Operators to Computational Biology Essays in Memory of Jacob T. Schwartz
Foreword. - creation. - Nature as Quantum desktop. - Jack Schwartz Meets Karl Marx. - SETL and the Evolution of Programming. - determination approach for ordinary Sublanguages of Set idea XVII: generally taking place Decidable Extensions of Multi-level Syllogistic. - Jack Schwartz and Robotics: The Roaring Eighties.
Principles of Compilers: A New Approach to Compilers Including the Algebraic Method
"Principles of Compilers: a brand new method of Compilers together with the Algebraic approach" introduces the information of the compilation from the average intelligence of humans through evaluating similarities and ameliorations among the compilations of normal languages and programming languages. The notation is created to record the resource language, aim languages, and compiler language, vividly illustrating the multilevel approach of the compilation within the technique.
This e-book constitutes the refereed lawsuits of the 3rd foreign Workshop on Formal strategies for Safety-Critical structures, FTSCS 2014, held in Luxembourg, in November 2014. The 14 revised complete papers offered including invited talks have been conscientiously reviewed and chosen from forty submissions.
- Data Flow Analysis: Theory and Practice
- Using Microsoft Dynamics AX: The New Dynamics ‘AX 7‘
- System Analysis and Modeling: Models and Reusability: 8th International Conference, SAM 2014, Valencia, Spain, September 29-30, 2014. Proceedings (Lecture Notes in Computer Science)
- Abstraction, Refinement and Proof for Probabilistic Systems (Monographs in Computer Science)
- The Compiler Design Handbook: Optimizations & Machine Code Generation
Extra resources for A Programmer's Guide to Fortran 90
Example text
Is an array-valued or pointer function, or a character function which is neither a constant nor assumed length. • has a dummy argument which is an assumed size array, a pointer or a target. • is a dummy or actual argument (in this case an interface block is recommended, not mandatory). 3 Summary Using Fortran 77 it was only possible to use a main program unit calling external procedures, and the compiler had no means of checking for argument inconsistencies between the procedures. In simple terms, Fortran 90 provides internal procedures with an explicit interface allowing the compiler to check for any argument inconsistencies.
A direct recursive function must also have a RESULT variable. This is necessary as the function name is already used within the body of the function as a result variable, and hence using it as a recursive reference to itself may cause ambiguities in some cases. Thus a RESULT variable is used, with a name different to the function itself, and then within the function, any reference to the actual function name is interpreted as a recursive call to the function. The classic textbook example of a recursive function, is the factorial calculation: RECURSIVE FUNCTION fact(n) RESULT (res) IMPLICIT NONE INTEGER INTENT(IN) :: n INTEGER :: res IF (n == 1) THEN res=1 ELSE res=n*fact(n-1) ENDIF END FUNCTION fact An important application of recursive procedures is where we have a variable number of DO loops: DO DO DO .
Shape(/5,5/) and scalar ra = rb + rc*id ! Shape(/3,2/) ra(3:5,3:4) = rb(1::2,3:5:2) + rc(1:3,1:2) ! 7 Recursion It is important to be aware of how to achieve recursion in Fortran 90: For example, the code: DO i=2,n x(i) = x(i) + x(i-1) END DO is not the same as: x(2:n)= x(2:n) + x(1:n-1) In the first case, the assignment is: x(i) = x(i) + x(i-1) + x(i-2) + ... + x(1) whereas in the second case the assignment is: x(i) = x(i) + x(i-1) In order to achieve the recursive effect of the DO-loop, in Fortran 90 it would be appropriate to use the intrinsic function SUM.