Fortran

Origins

In late 1953, John W. Backus submitted a proposal to his superiors at IBM to develop a more practical alternative to assembly language for programming their IBM 704 mainframe computer. Backus' historic FORTRAN team consisted of programmers Richard Goldberg, Sheldon F. Best, Harlan Herrick, Peter Sheridan, Roy Nutt, Robert Nelson, Irving Ziller, Harold Stern, Lois Haibt, and David Sayre. Its concepts included easier entry of equations into a computer, an idea developed by J. Halcombe Laning and demonstrated in the Laning and Zierler system of 1952. As with other developments in the early days of computing, there were several parallel, independent efforts along these lines, with other instances of proto-Fortran languages including the A-0 System for the UNIVAC I and its follow-on MATH-MATIC, under the direction of Grace Murray Hopper; the high-level language work developed by Heinz Rutishauser for the Zuse 4 computer; and the Mark 1 Autocode work done by R. A. Brooker for the Ferranti Mercury.

A draft specification for The IBM Mathematical Formula Translating System was completed by November 1954. The first manual for FORTRAN appeared in October 1956, with the first FORTRAN compiler delivered in April 1957. Fortran produced efficient enough code for assembly language programmers to accept a high-level programming language replacement.

John Backus said during a 1979 interview with Think, the IBM employee magazine, "Much of my work has come from being lazy. I didn't like writing programs, and so, when I was working on the IBM 701, writing programs for computing missile trajectories, I started work on a programming system to make it easier to write programs."

The language was widely adopted by scientists for writing numerically intensive programs, which encouraged compiler writers to produce compilers that could generate faster and more efficient code. The inclusion of a complex number data type in the language made Fortran especially suited to technical applications such as electrical engineering.

By 1960, versions of FORTRAN were available for IBM's 709, 650, 1620 and 7090 computers. Significantly, the increasing popularity of FORTRAN spurred competing computer manufacturers to provide FORTRAN compilers for their machines, so that by 1963 over 40 FORTRAN compilers existed. So pervasive was the language within the computing industry that by that time, over 220,000 Fortran manuals of all kinds had been distributed.

FORTRAN was provided for the IBM 1401 computer by an innovative 63-phase compiler that ran entirely in its core memory of only 8000 (six-bit) characters. The compiler could be run from tape, or from a 2200-card deck; it used no further tape or disk storage. It kept the program in memory and loaded overlays that gradually transformed it, in place, into executable form, as described by Haines. This article was reprinted, edited, in both editions of Anatomy of a Compiler and in the IBM manual "Fortran Specifications and Operating Procedures, IBM 1401". The executable form was not entirely machine language; rather, floating-point arithmetic, sub-scripting, input/output, and function references were interpreted, preceding UCSD Pascal P-code by two decades. GOTRAN, a simplified, interpreted version of FORTRAN I (with only 12 types of statements not 32) for "load and go" operation was available (at least for the early IBM 1620 computer). Modern Fortran, and almost all later versions, are fully compiled, as done for other high-performance languages.

The development of Fortran paralleled the early evolution of compiler technology, and many advances in the theory and design of compilers were specifically motivated by the need to generate efficient code for Fortran programs. Indeed, the Fortran compiler was one of the most complicated programs of any kind in existence at the time, and it was used by IBM's Product Test group in Poughkeepsie, New York, as part of acceptance testing for newly built computers.

FORTRAN

The initial release of FORTRAN for the IBM 704 contained 32 types of statements, including:

• DIMENSION and EQUIVALENCE statements
• Assignment statements
• Three-way arithmetic IF statement (since deprecated), which passed control to one of three locations in the program depending on whether the result of the arithmetic expression was negative, zero, or positive
• Control statements for checking exceptions (IF ACCUMULATOR OVERFLOW, IF QUOTIENT OVERFLOW, and IF DIVIDE CHECK); and control statements for manipulating sense switches and sense lights (IF (SENSE SWITCH), IF (SENSE LIGHT), and SENSE LIGHT)
• GO TO, computed GO TO, ASSIGN, and assigned GO TO
• DO loops
• Formatted I/O: FORMAT, READ, READ INPUT TAPE, WRITE OUTPUT TAPE, PRINT, and PUNCH
• Unformatted I/O: READ TAPE, READ DRUM, WRITE TAPE, and WRITE DRUM
• Other I/O: END FILE, REWIND, and BACKSPACE
• PAUSE, STOP, and CONTINUE
• FREQUENCY statement (for providing optimization hints to the compiler).

The arithmetic IF statement was reminiscent of (but not readily implementable by) a three-way comparison instruction (CAS—Compare Accumulator with Storage) available on the 704. The statement provided the only way to compare numbers—by testing their difference, with an attendant risk of overflow. This deficiency was later overcome by "logical" facilities introduced in FORTRAN IV.

The FREQUENCY statement was used originally (and optionally) to give branch probabilities for the three branch cases of the arithmetic IF statement. It could also be used to suggest how many iterations a DO loop might run. The first FORTRAN compiler used this weighting to perform at compile time a Monte Carlo simulation of the generated code, the results of which were used to optimize the placement of basic blocks in memory—a very sophisticated optimization for its time. The Monte Carlo technique is documented in Backus et al.'s paper on this original implementation, The FORTRAN Automatic Coding System:

The fundamental unit of program is the basic block; a basic block is a stretch of program which has one entry point and one exit point. The purpose of section 4 is to prepare for section 5 a table of predecessors (PRED table) which enumerates the basic blocks and lists for every basic block each of the basic blocks which can be its immediate predecessor in flow, together with the absolute frequency of each such basic block link. This table is obtained by running the program once in Monte-Carlo fashion, in which the outcome of conditional transfers arising out of IF-type statements and computed GO TO's is determined by a random number generator suitably weighted according to whatever FREQUENCY statements have been provided.

The first FORTRAN compiler reported diagnostic information by halting the program when an error was found and outputting an error code on its console. That code could be looked up by the programmer in an error messages table in the operator's manual, providing them with a brief description of the problem. Later, an error-handling subroutine to handle user errors such as division by zero, developed by NASA, was incorporated, informing users of which line of code contained the error.

Fixed layout and punched cards

Before the development of disk files, text editors and terminals, programs were most often entered on a keypunch keyboard onto 80-column punched cards, one line to a card. The resulting deck of cards would be fed into a card reader to be compiled. Punched card codes included no lower-case letters or many special characters, and special versions of the IBM 026 keypunch were offered that would correctly print the re-purposed special characters used in FORTRAN.

Reflecting punched card input practice, Fortran programs were originally written in a fixed-column format. A letter "C" in column 1 caused the entire card to be treated as a comment and ignored by the compiler. Otherwise, the columns of the card were divided into four fields:

• 1 to 5 were the label field: a sequence of digits here was taken as a label for use in DO or control statements such as GO TO and IF, or to identify a FORMAT statement referred to in a WRITE or READ statement. Leading zeros are ignored and 0 is not a valid label number.
• 6 was a continuation field: a character other than a blank or a zero here caused the card to be taken as a continuation of the statement on the prior card. The continuation cards were usually numbered 1, 2, etc. and the starting card might therefore have zero in its continuation column—which is not a continuation of its preceding card.
• 7 to 72 contained the statement field.
• 73 to 80 were ignored (the card reader for the IBM 704, the computer on which Fortran was developed, could only read 72 columns, placing them into twenty-four 36-bit words).

Columns 73 to 80 could therefore be used for identification information, such as punching a sequence number or text, which could be used to re-order cards if a stack of cards was dropped; though in practice this was reserved for stable, production programs. An IBM 519 could be used to copy a program deck and add sequence numbers. Some early compilers, e.g., the IBM 650's, had additional restrictions due to limitations on their card readers. Keypunches could be programmed to tab to column 7 and skip out after column 72. Later compilers relaxed most fixed-format restrictions, and the requirement was eliminated in the Fortran 90 standard.

Within the statement field, whitespace characters (blanks) were ignored outside a text literal. This allowed omitting spaces between tokens for brevity or including spaces within identifiers for clarity. For example, AVG OF X was a valid identifier, equivalent to AVGOFX, and 101010DO101I=1,101 was a valid statement, equivalent to 10101 DO 101 I = 1, 101 because the zero in column 6 is treated as if it were a space, while 101010DO101I=1.101 was instead 10101 DO101I = 1.101, the assignment of 1.101 to a variable called DO101I. Note the slight visual difference between a comma and a period.

Hollerith strings, originally allowed only in FORMAT and DATA statements, were prefixed by a character count and the letter H (e.g., 26HTHIS IS ALPHANUMERIC DATA.), allowing blanks to be retained within the character string. Miscounts were a problem.

Evolution

FORTRAN II

IBM's FORTRAN II appeared in 1958. The main enhancement was to support procedural programming by allowing user-written subroutines and functions which returned values with parameters passed by reference. The COMMON statement provided a way for subroutines to access common (or global) variables. Six new statements were introduced:

• SUBROUTINE, FUNCTION, and END
• CALL and RETURN
• COMMON

In the view of computing pioneer Robert Bemer, the addition of separately compiled subroutines to the language was "a development equivalent in importance to the original FORTRAN."

Over the next few years, FORTRAN II added support for the DOUBLE PRECISION and COMPLEX data types.

Early FORTRAN compilers supported no recursion in subroutines. Early computer architectures supported no concept of a stack, and when they did directly support subroutine calls, the return location was often stored in one fixed location adjacent to the subroutine code (e.g. the IBM 1130) or a specific machine register (IBM 360 et seq), which only allows recursion if a stack is maintained by software and the return address is stored on the stack before the call is made and restored after the call returns. The lack of recursion was a significant detriment to the language being used in conjunction with certain algorithms and applications, and indeed limited how programmers could think about such things. Although not specified in FORTRAN 77, many F77 compilers supported recursion as an option, and the Burroughs mainframes, designed with recursion built-in, did so by default. It became a standard in Fortran 90 via the new keyword RECURSIVE.

Simple FORTRAN II program

This program, for Heron's formula, reads data on a tape reel containing three 5-digit integers A, B, and C as input. There are no "type" declarations available: variables whose name starts with I, J, K, L, M, or N are "fixed-point" (i.e. integers), otherwise floating-point. Since integers are to be processed in this example, the names of the variables start with the letter "I". The name of a variable must start with a letter and can continue with both letters and digits, up to a limit of six characters in FORTRAN II. If A, B, and C cannot represent the sides of a triangle in plane geometry, then the program's execution will end with an error code of "STOP 1". Otherwise, an output line will be printed showing the input values for A, B, and C, followed by the computed AREA of the triangle as a floating-point number occupying ten spaces along the line of output and showing 2 digits after the decimal point, the .2 in F10.2 of the FORMAT statement with label 601.

<span id="mwAjw"></span><span class="linenos" data-line="1" id="mwAj0"></span><span class="c" id="mwAj4">C AREA OF A TRIANGLE WITH A STANDARD SQUARE ROOT FUNCTION</span> <span class="linenos" data-line="2" id="mwAj8"></span><span class="c" id="mwAkA">C INPUT - TAPE READER UNIT 5, INTEGER INPUT</span> <span class="linenos" data-line="3" id="mwAkE"></span><span class="c" id="mwAkI">C OUTPUT - LINE PRINTER UNIT 6, REAL OUTPUT</span> <span class="linenos" data-line="4" id="mwAkM"></span><span class="c" id="mwAkQ">C INPUT ERROR DISPLAY ERROR OUTPUT CODE 1 IN JOB CONTROL LISTING</span> <span class="linenos" data-line="5" id="mwAkU"></span><span class="nl" id="mwAkY"> </span> <span class="k" id="mwAkc">READ </span><span class="n" id="mwAkg">INPUT</span><span class="w" id="mwAkk"> </span><span class="n" id="mwAko">TAPE</span><span class="w" id="mwAks"> </span><span class="mi" id="mwAkw">5</span><span class="p" id="mwAk0">,</span><span class="w" id="mwAk4"> </span><span class="mi" id="mwAk8">501</span><span class="p" id="mwAlA">,</span><span class="w" id="mwAlE"> </span><span class="n" id="mwAlI">IA</span><span class="p" id="mwAlM">,</span><span class="w" id="mwAlQ"> </span><span class="n" id="mwAlU">IB</span><span class="p" id="mwAlY">,</span><span class="w" id="mwAlc"> </span><span class="n" id="mwAlg">IC</span> <span class="linenos" data-line="6" id="mwAlk"></span><span class="nl" id="mwAlo"> 501</span> <span class="k" id="mwAls">FORMAT</span><span class="w" id="mwAlw"> </span><span class="p" id="mwAl0">(</span><span class="mi" id="mwAl4">3</span><span class="n" id="mwAl8">I5</span><span class="p" id="mwAmA">)</span> <span class="linenos" data-line="7" id="mwAmE"></span><span class="c" id="mwAmI">C IA, IB, AND IC MAY NOT BE NEGATIVE OR ZERO</span> <span class="linenos" data-line="8" id="mwAmM"></span><span class="c" id="mwAmQ">C FURTHERMORE, THE SUM OF TWO SIDES OF A TRIANGLE</span> <span class="linenos" data-line="9" id="mwAmU"></span><span class="c" id="mwAmY">C MUST BE GREATER THAN THE THIRD SIDE, SO WE CHECK FOR THAT, TOO</span> <span class="linenos" data-line="10" id="mwAmc"></span><span class="nl" id="mwAmg"> </span> <span class="k" id="mwAmk">IF</span><span class="w" id="mwAmo"> </span><span class="p" id="mwAms">(</span><span class="n" id="mwAmw">IA</span><span class="p" id="mwAm0">)</span><span class="w" id="mwAm4"> </span><span class="mi" id="mwAm8">777</span><span class="p" id="mwAnA">,</span><span class="w" id="mwAnE"> </span><span class="mi" id="mwAnI">777</span><span class="p" id="mwAnM">,</span><span class="w" id="mwAnQ"> </span><span class="mi" id="mwAnU">701</span> <span class="linenos" data-line="11" id="mwAnY"></span><span class="nl" id="mwAnc"> 701</span> <span class="k" id="mwAng">IF</span><span class="w" id="mwAnk"> </span><span class="p" id="mwAno">(</span><span class="n" id="mwAns">IB</span><span class="p" id="mwAnw">)</span><span class="w" id="mwAn0"> </span><span class="mi" id="mwAn4">777</span><span class="p" id="mwAn8">,</span><span class="w" id="mwAoA"> </span><span class="mi" id="mwAoE">777</span><span class="p" id="mwAoI">,</span><span class="w" id="mwAoM"> </span><span class="mi" id="mwAoQ">702</span> <span class="linenos" data-line="12" id="mwAoU"></span><span class="nl" id="mwAoY"> 702</span> <span class="k" id="mwAoc">IF</span><span class="w" id="mwAog"> </span><span class="p" id="mwAok">(</span><span class="n" id="mwAoo">IC</span><span class="p" id="mwAos">)</span><span class="w" id="mwAow"> </span><span class="mi" id="mwAo0">777</span><span class="p" id="mwAo4">,</span><span class="w" id="mwAo8"> </span><span class="mi" id="mwApA">777</span><span class="p" id="mwApE">,</span><span class="w" id="mwApI"> </span><span class="mi" id="mwApM">703</span> <span class="linenos" data-line="13" id="mwApQ"></span><span class="nl" id="mwApU"> 703</span> <span class="k" id="mwApY">IF</span><span class="w" id="mwApc"> </span><span class="p" id="mwApg">(</span><span class="n" id="mwApk">IA</span><span class="o" id="mwApo">+</span><span class="n" id="mwAps">IB</span><span class="o" id="mwApw">-</span><span class="n" id="mwAp0">IC</span><span class="p" id="mwAp4">)</span><span class="w" id="mwAp8"> </span><span class="mi" id="mwAqA">777</span><span class="p" id="mwAqE">,</span><span class="w" id="mwAqI"> </span><span class="mi" id="mwAqM">777</span><span class="p" id="mwAqQ">,</span><span class="w" id="mwAqU"> </span><span class="mi" id="mwAqY">704</span> <span class="linenos" data-line="14" id="mwAqc"></span><span class="nl" id="mwAqg"> 704</span> <span class="k" id="mwAqk">IF</span><span class="w" id="mwAqo"> </span><span class="p" id="mwAqs">(</span><span class="n" id="mwAqw">IA</span><span class="o" id="mwAq0">+</span><span class="n" id="mwAq4">IC</span><span class="o" id="mwAq8">-</span><span class="n" id="mwArA">IB</span><span class="p" id="mwArE">)</span><span class="w" id="mwArI"> </span><span class="mi" id="mwArM">777</span><span class="p" id="mwArQ">,</span><span class="w" id="mwArU"> </span><span class="mi" id="mwArY">777</span><span class="p" id="mwArc">,</span><span class="w" id="mwArg"> </span><span class="mi" id="mwArk">705</span> <span class="linenos" data-line="15" id="mwAro"></span><span class="nl" id="mwArs"> 705</span> <span class="k" id="mwArw">IF</span><span class="w" id="mwAr0"> </span><span class="p" id="mwAr4">(</span><span class="n" id="mwAr8">IB</span><span class="o" id="mwAsA">+</span><span class="n" id="mwAsE">IC</span><span class="o" id="mwAsI">-</span><span class="n" id="mwAsM">IA</span><span class="p" id="mwAsQ">)</span><span class="w" id="mwAsU"> </span><span class="mi" id="mwAsY">777</span><span class="p" id="mwAsc">,</span><span class="w" id="mwAsg"> </span><span class="mi" id="mwAsk">777</span><span class="p" id="mwAso">,</span><span class="w" id="mwAss"> </span><span class="mi" id="mwAsw">799</span> <span class="linenos" data-line="16" id="mwAs0"></span><span class="nl" id="mwAs4"> 777</span> <span class="k" id="mwAs8">STOP </span><span class="mi" id="mwAtA">1</span> <span class="linenos" data-line="17" id="mwAtE"></span><span class="c" id="mwAtI">C USING HERON'S FORMULA WE CALCULATE THE</span> <span class="linenos" data-line="18" id="mwAtM"></span><span class="c" id="mwAtQ">C AREA OF THE TRIANGLE</span> <span class="linenos" data-line="19" id="mwAtU"></span><span class="nl" id="mwAtY"> 799</span> <span class="n" id="mwAtc">S</span><span class="w" id="mwAtg"> </span><span class="o" id="mwAtk">=</span><span class="w" id="mwAto"> </span><span class="n" id="mwAts">FLOATF</span><span class="w" id="mwAtw"> </span><span class="p" id="mwAt0">(</span><span class="n" id="mwAt4">IA</span><span class="w" id="mwAt8"> </span><span class="o" id="mwAuA">+</span><span class="w" id="mwAuE"> </span><span class="n" id="mwAuI">IB</span><span class="w" id="mwAuM"> </span><span class="o" id="mwAuQ">+</span><span class="w" id="mwAuU"> </span><span class="n" id="mwAuY">IC</span><span class="p" id="mwAuc">)</span><span class="w" id="mwAug"> </span><span class="o" id="mwAuk">/</span><span class="w" id="mwAuo"> </span><span class="mf" id="mwAus">2.0</span> <span class="linenos" data-line="20" id="mwAuw"></span><span class="nl" id="mwAu0"> </span> <span class="n" id="mwAu4">AREA</span><span class="w" id="mwAu8"> </span><span class="o" id="mwAvA">=</span><span class="w" id="mwAvE"> </span><span class="n" id="mwAvI">SQRTF</span><span class="p" id="mwAvM">(</span><span class="w" id="mwAvQ"> </span><span class="n" id="mwAvU">S</span><span class="w" id="mwAvY"> </span><span class="o" id="mwAvc">*</span><span class="w" id="mwAvg"> </span><span class="p" id="mwAvk">(</span><span class="n" id="mwAvo">S</span><span class="w" id="mwAvs"> </span><span class="o" id="mwAvw">-</span><span class="w" id="mwAv0"> </span><span class="n" id="mwAv4">FLOATF</span><span class="p" id="mwAv8">(</span><span class="n" id="mwAwA">IA</span><span class="p" id="mwAwE">))</span><span class="w" id="mwAwI"> </span><span class="o" id="mwAwM">*</span><span class="w" id="mwAwQ"> </span><span class="p" id="mwAwU">(</span><span class="n" id="mwAwY">S</span><span class="w" id="mwAwc"> </span><span class="o" id="mwAwg">-</span><span class="w" id="mwAwk"> </span><span class="n" id="mwAwo">FLOATF</span><span class="p" id="mwAws">(</span><span class="n" id="mwAww">IB</span><span class="p" id="mwAw0">))</span><span class="w" id="mwAw4"> </span><span class="o" id="mwAw8">*</span> <span class="linenos" data-line="21" id="mwAxA"></span><span class="nl" id="mwAxE"> </span><span class="gs" id="mwAxI">+</span><span class="w" id="mwAxM"> </span><span class="p" id="mwAxQ">(</span><span class="n" id="mwAxU">S</span><span class="w" id="mwAxY"> </span><span class="o" id="mwAxc">-</span><span class="w" id="mwAxg"> </span><span class="n" id="mwAxk">FLOATF</span><span class="p" id="mwAxo">(</span><span class="n" id="mwAxs">IC</span><span class="p" id="mwAxw">)))</span> <span class="linenos" data-line="22" id="mwAx0"></span><span class="nl" id="mwAx4"> </span> <span class="k" id="mwAx8">WRITE </span><span class="n" id="mwAyA">OUTPUT</span><span class="w" id="mwAyE"> </span><span class="n" id="mwAyI">TAPE</span><span class="w" id="mwAyM"> </span><span class="mi" id="mwAyQ">6</span><span class="p" id="mwAyU">,</span><span class="w" id="mwAyY"> </span><span class="mi" id="mwAyc">601</span><span class="p" id="mwAyg">,</span><span class="w" id="mwAyk"> </span><span class="n" id="mwAyo">IA</span><span class="p" id="mwAys">,</span><span class="w" id="mwAyw"> </span><span class="n" id="mwAy0">IB</span><span class="p" id="mwAy4">,</span><span class="w" id="mwAy8"> </span><span class="n" id="mwAzA">IC</span><span class="p" id="mwAzE">,</span><span class="w" id="mwAzI"> </span><span class="n" id="mwAzM">AREA</span> <span class="linenos" data-line="23" id="mwAzQ"></span><span class="nl" id="mwAzU"> 601</span> <span class="k" id="mwAzY">FORMAT</span><span class="w" id="mwAzc"> </span><span class="p" id="mwAzg">(</span><span class="mi" id="mwAzk">4</span><span class="n" id="mwAzo">H</span><span class="w" id="mwAzs"> </span><span class="n" id="mwAzw">A</span><span class="o" id="mwAz0">=</span><span class="w" id="mwAz4"> </span><span class="p" id="mwAz8">,</span><span class="n" id="mwA0A">I5</span><span class="p" id="mwA0E">,</span><span class="mi" id="mwA0I">5</span><span class="n" id="mwA0M">H</span><span class="w" id="mwA0Q"> </span><span class="n" id="mwA0U">B</span><span class="o" id="mwA0Y">=</span><span class="w" id="mwA0c"> </span><span class="p" id="mwA0g">,</span><span class="n" id="mwA0k">I5</span><span class="p" id="mwA0o">,</span><span class="mi" id="mwA0s">5</span><span class="n" id="mwA0w">H</span><span class="w" id="mwA00"> </span><span class="n" id="mwA04">C</span><span class="o" id="mwA08">=</span><span class="w" id="mwA1A"> </span><span class="p" id="mwA1E">,</span><span class="n" id="mwA1I">I5</span><span class="p" id="mwA1M">,</span><span class="mi" id="mwA1Q">8</span><span class="n" id="mwA1U">H</span><span class="w" id="mwA1Y"> </span><span class="n" id="mwA1c">AREA</span><span class="o" id="mwA1g">=</span><span class="w" id="mwA1k"> </span><span class="p" id="mwA1o">,</span><span class="n" id="mwA1s">F10</span><span class="p" id="mwA1w">.</span><span class="mi" id="mwA10">2</span><span class="p" id="mwA14">,</span> <span class="linenos" data-line="24" id="mwA18"></span><span class="nl" id="mwA2A"> </span><span class="gs" id="mwA2E">+</span><span class="w" id="mwA2I"> </span><span class="mi" id="mwA2M">13</span><span class="n" id="mwA2Q">H</span><span class="w" id="mwA2U"> </span><span class="n" id="mwA2Y">SQUARE</span><span class="w" id="mwA2c"> </span><span class="n" id="mwA2g">UNITS</span><span class="p" id="mwA2k">)</span> <span class="linenos" data-line="25" id="mwA2o"></span><span class="nl" id="mwA2s"> </span> <span class="k" id="mwA2w">STOP</span> <span class="linenos" data-line="26" id="mwA20"></span><span class="nl" id="mwA24"> </span> <span class="k" id="mwA28">END</span>

FORTRAN III

IBM also developed a FORTRAN III in 1958 that allowed for inline assembly code among other features; however, this version was never released as a product. Like the 704 FORTRAN and FORTRAN II, FORTRAN III included machine-dependent features that made code written in it unportable from machine to machine, as well as Boolean expression support. Early versions of FORTRAN provided by other vendors suffered from the same disadvantage.

FORTRAN IV

IBM began development of FORTRAN IV in 1961 as a result of customer demands. FORTRAN IV removed the machine-dependent features of FORTRAN II (such as READ INPUT TAPE), while adding new features such as a LOGICAL data type, logical Boolean expressions, and the logical IF statement as an alternative to the arithmetic IF statement. Type declarations were added, along with an IMPLICIT statement to override earlier conventions that variables are INTEGER if their name begins with I, J, K, L, M, or N; and REAL otherwise.

FORTRAN IV was eventually released in 1962, first for the IBM 7030 ("Stretch") computer, followed by versions for the IBM 7090/7094 in 1963 and later for the IBM 1401 in 1966.

By 1965, FORTRAN IV was supposed to be compliant with the standard being developed by the American Standards Association X3.4.3 FORTRAN Working Group.

Between 1966 and 1968, IBM offered several FORTRAN IV compilers for its System/360, each named by letters that indicated the minimum amount of memory the compiler needed to run. The letters (F, G, H) matched the codes used with System/360 model numbers to indicate memory size, each letter increment being a factor of two larger:

• 1966 : FORTRAN IV F for DOS/360 (64K bytes)
• 1966 : FORTRAN IV G for OS/360 (128K bytes)
• 1968 : FORTRAN IV H for OS/360 (256K bytes)

In particular, the FORTRAN H compiler played an important role in the development of certain kinds of optimization approaches, such as allocating a specific set of registers to hold the values of variables while in a loop. Overall, the compiler had three levels of possible optimization, as Fortran compiler developers had learned early on that the ability to turn off optimization was a necessity, since it drove up compilation times considerability for program runs that often were not going to work anyway. Even with the larger amount of main memory available to it, the FORTRAN H compiler was still organized via a number of overlays. Overall, Fortran compilers were a significant source of revenue for IBM, with sales of some $300 million in 1966 (equivalent to $2,977 million in 2025).

Digital Equipment Corporation maintained DECSYSTEM-10 Fortran IV (F40) for PDP-10 from 1967 to 1975. Compilers were also available for the UNIVAC 1100 series and the Control Data 6000 series and 7000 series systems.

In the FORTRAN IV programming environment of the era, except for that used on Control Data Corporation (CDC) systems, only one instruction was placed per line. The CDC version allowed for multiple instructions per line if separated by a $ (dollar) character. The FORTRAN sheet was divided into four fields, as described above.

Two compilers of the time, IBM "G" and UNIVAC, allowed comments to be written on the same line as instructions, separated by a special character: "master space": V (perforations 7 and 8) for UNIVAC and perforations 12/11/0/7/8/9 (hexadecimal FF) for IBM. These comments were not to be inserted in the middle of continuation cards.

FORTRAN 66

Perhaps the most significant development in the early history of FORTRAN was the decision by the American Standards Association (now American National Standards Institute (ANSI)) to form a committee sponsored by the Business Equipment Manufacturers Association (BEMA) to develop an American Standard Fortran. The resulting two standards, approved in March 1966, defined two languages, FORTRAN (based on FORTRAN IV, which had served as a de facto standard), and Basic FORTRAN (based on FORTRAN II, but stripped of its machine-dependent features). The FORTRAN defined by the first standard, officially denoted X3.9-1966, became known as FORTRAN 66 (although many continued to term it FORTRAN IV, the language on which the standard was largely based). FORTRAN 66 effectively became the first industry-standard version of FORTRAN. FORTRAN 66 included:

• Main program, SUBROUTINE, FUNCTION, and BLOCK DATA program units
• INTEGER, REAL, DOUBLE PRECISION, COMPLEX, and LOGICAL data types
• COMMON, DIMENSION, and EQUIVALENCE statements
• DATA statement for specifying initial values
• Intrinsic and EXTERNAL (e.g., library) functions
• Assignment statement
• GO TO, computed GO TO, assigned GO TO, and ASSIGN statements
• Logical IF and arithmetic (three-way) IF statements
• DO loop statement
• READ, WRITE, BACKSPACE, REWIND, and ENDFILE statements for sequential I/O
• FORMAT statement and assigned format
• CALL, RETURN, PAUSE, and STOP statements
• Hollerith constants in DATA and FORMAT statements, and as arguments to procedures
• Identifiers of up to six characters in length
• Comment lines
• END line

The above Fortran II version of the Heron program needs several modifications to compile as a Fortran 66 program. Modifications include using the more machine independent versions of the READ and WRITE statements, and removal of the unneeded FLOATF type conversion functions. Though not required, the arithmetic IF statements can be re-written to use logical IF statements and expressions in a more structured fashion.

<span id="mwBDQ"></span><span class="linenos" data-line="1" id="mwBDU"></span><span class="c" id="mwBDY">C AREA OF A TRIANGLE WITH A STANDARD SQUARE ROOT FUNCTION</span> <span class="linenos" data-line="2" id="mwBDc"></span><span class="c" id="mwBDg">C INPUT - TAPE READER UNIT 5, INTEGER INPUT</span> <span class="linenos" data-line="3" id="mwBDk"></span><span class="c" id="mwBDo">C OUTPUT - LINE PRINTER UNIT 6, REAL OUTPUT</span> <span class="linenos" data-line="4" id="mwBDs"></span><span class="c" id="mwBDw">C INPUT ERROR DISPLAY ERROR OUTPUT CODE 1 IN JOB CONTROL LISTING</span> <span class="linenos" data-line="5" id="mwBD0"></span><span class="nl" id="mwBD4"> </span> <span class="k" id="mwBD8">READ</span><span class="w" id="mwBEA"> </span><span class="p" id="mwBEE">(</span><span class="mi" id="mwBEI">5</span><span class="p" id="mwBEM">,</span><span class="w" id="mwBEQ"> </span><span class="mi" id="mwBEU">501</span><span class="p" id="mwBEY">)</span><span class="w" id="mwBEc"> </span><span class="n" id="mwBEg">IA</span><span class="p" id="mwBEk">,</span><span class="w" id="mwBEo"> </span><span class="n" id="mwBEs">IB</span><span class="p" id="mwBEw">,</span><span class="w" id="mwBE0"> </span><span class="n" id="mwBE4">IC</span> <span class="linenos" data-line="6" id="mwBE8"></span><span class="nl" id="mwBFA"> 501</span> <span class="k" id="mwBFE">FORMAT</span><span class="w" id="mwBFI"> </span><span class="p" id="mwBFM">(</span><span class="mi" id="mwBFQ">3</span><span class="n" id="mwBFU">I5</span><span class="p" id="mwBFY">)</span> <span class="linenos" data-line="7" id="mwBFc"></span><span class="c" id="mwBFg">C</span> <span class="linenos" data-line="8" id="mwBFk"></span><span class="c" id="mwBFo">C IA, IB, AND IC MAY NOT BE NEGATIVE OR ZERO</span> <span class="linenos" data-line="9" id="mwBFs"></span><span class="c" id="mwBFw">C FURTHERMORE, THE SUM OF TWO SIDES OF A TRIANGLE</span> <span class="linenos" data-line="10" id="mwBF0"></span><span class="c" id="mwBF4">C MUST BE GREATER THAN THE THIRD SIDE, SO WE CHECK FOR THAT, TOO</span> <span class="linenos" data-line="11" id="mwBF8"></span><span class="nl" id="mwBGA"> </span> <span class="k" id="mwBGE">IF</span><span class="w" id="mwBGI"> </span><span class="p" id="mwBGM">(</span><span class="n" id="mwBGQ">IA</span><span class="w" id="mwBGU"> </span><span class="p" id="mwBGY">.</span><span class="n" id="mwBGc">GT</span><span class="p" id="mwBGg">.</span><span class="w" id="mwBGk"> </span><span class="mi" id="mwBGo">0</span><span class="w" id="mwBGs"> </span><span class="p" id="mwBGw">.</span><span class="nb" id="mwBG0">AND</span><span class="p" id="mwBG4">.</span><span class="w" id="mwBG8"> </span><span class="n" id="mwBHA">IB</span><span class="w" id="mwBHE"> </span><span class="p" id="mwBHI">.</span><span class="n" id="mwBHM">GT</span><span class="p" id="mwBHQ">.</span><span class="w" id="mwBHU"> </span><span class="mi" id="mwBHY">0</span><span class="w" id="mwBHc"> </span><span class="p" id="mwBHg">.</span><span class="nb" id="mwBHk">AND</span><span class="p" id="mwBHo">.</span><span class="w" id="mwBHs"> </span><span class="n" id="mwBHw">IC</span><span class="w" id="mwBH0"> </span><span class="p" id="mwBH4">.</span><span class="n" id="mwBH8">GT</span><span class="p" id="mwBIA">.</span><span class="w" id="mwBIE"> </span><span class="mi" id="mwBII">0</span><span class="p" id="mwBIM">)</span><span class="w" id="mwBIQ"> </span><span class="k" id="mwBIU">GOTO</span><span class="w" id="mwBIY"> </span><span class="mi" id="mwBIc">10</span> <span class="linenos" data-line="12" id="mwBIg"></span><span class="nl" id="mwBIk"> </span> <span class="w" id="mwBIo"> </span><span class="k" id="mwBIs">WRITE</span><span class="w" id="mwBIw"> </span><span class="p" id="mwBI0">(</span><span class="mi" id="mwBI4">6</span><span class="p" id="mwBI8">,</span><span class="w" id="mwBJA"> </span><span class="mi" id="mwBJE">602</span><span class="p" id="mwBJI">)</span> <span class="linenos" data-line="13" id="mwBJM"></span><span class="nl" id="mwBJQ"> 602</span> <span class="w" id="mwBJU"> </span><span class="k" id="mwBJY">FORMAT</span><span class="w" id="mwBJc"> </span><span class="p" id="mwBJg">(</span><span class="mi" id="mwBJk">42</span><span class="n" id="mwBJo">H</span><span class="w" id="mwBJs"> </span><span class="n" id="mwBJw">IA</span><span class="p" id="mwBJ0">,</span><span class="w" id="mwBJ4"> </span><span class="n" id="mwBJ8">IB</span><span class="p" id="mwBKA">,</span><span class="w" id="mwBKE"> </span><span class="nb" id="mwBKI">AND </span><span class="n" id="mwBKM">IC</span><span class="w" id="mwBKQ"> </span><span class="n" id="mwBKU">MUST</span><span class="w" id="mwBKY"> </span><span class="n" id="mwBKc">BE</span><span class="w" id="mwBKg"> </span><span class="n" id="mwBKk">GREATER</span><span class="w" id="mwBKo"> </span><span class="n" id="mwBKs">THAN</span><span class="w" id="mwBKw"> </span><span class="n" id="mwBK0">ZERO</span><span class="p" id="mwBK4">.)</span> <span class="linenos" data-line="14" id="mwBK8"></span><span class="nl" id="mwBLA"> </span> <span class="w" id="mwBLE"> </span><span class="k" id="mwBLI">STOP </span><span class="mi" id="mwBLM">1</span> <span class="linenos" data-line="15" id="mwBLQ"></span><span class="nl" id="mwBLU"> 10</span> <span class="k" id="mwBLY">CONTINUE</span> <span class="linenos" data-line="16" id="mwBLc"></span><span class="c" id="mwBLg">C</span> <span class="linenos" data-line="17" id="mwBLk"></span><span class="nl" id="mwBLo"> </span> <span class="k" id="mwBLs">IF</span><span class="w" id="mwBLw"> </span><span class="p" id="mwBL0">(</span><span class="n" id="mwBL4">IA</span><span class="o" id="mwBL8">+</span><span class="n" id="mwBMA">IB</span><span class="o" id="mwBME">-</span><span class="n" id="mwBMI">IC</span><span class="w" id="mwBMM"> </span><span class="p" id="mwBMQ">.</span><span class="n" id="mwBMU">GT</span><span class="p" id="mwBMY">.</span><span class="w" id="mwBMc"> </span><span class="mi" id="mwBMg">0</span> <span class="linenos" data-line="18" id="mwBMk"></span><span class="nl" id="mwBMo"> </span><span class="gs" id="mwBMs">+</span><span class="w" id="mwBMw"> </span><span class="p" id="mwBM0">.</span><span class="nb" id="mwBM4">AND</span><span class="p" id="mwBM8">.</span><span class="w" id="mwBNA"> </span><span class="n" id="mwBNE">IA</span><span class="o" id="mwBNI">+</span><span class="n" id="mwBNM">IC</span><span class="o" id="mwBNQ">-</span><span class="n" id="mwBNU">IB</span><span class="w" id="mwBNY"> </span><span class="p" id="mwBNc">.</span><span class="n" id="mwBNg">GT</span><span class="p" id="mwBNk">.</span><span class="w" id="mwBNo"> </span><span class="mi" id="mwBNs">0</span> <span class="linenos" data-line="19" id="mwBNw"></span><span class="nl" id="mwBN0"> </span><span class="gs" id="mwBN4">+</span><span class="w" id="mwBN8"> </span><span class="p" id="mwBOA">.</span><span class="nb" id="mwBOE">AND</span><span class="p" id="mwBOI">.</span><span class="w" id="mwBOM"> </span><span class="n" id="mwBOQ">IB</span><span class="o" id="mwBOU">+</span><span class="n" id="mwBOY">IC</span><span class="o" id="mwBOc">-</span><span class="n" id="mwBOg">IA</span><span class="w" id="mwBOk"> </span><span class="p" id="mwBOo">.</span><span class="n" id="mwBOs">GT</span><span class="p" id="mwBOw">.</span><span class="w" id="mwBO0"> </span><span class="mi" id="mwBO4">0</span><span class="p" id="mwBO8">)</span><span class="w" id="mwBPA"> </span><span class="k" id="mwBPE">GOTO</span><span class="w" id="mwBPI"> </span><span class="mi" id="mwBPM">20</span> <span class="linenos" data-line="20" id="mwBPQ"></span><span class="nl" id="mwBPU"> </span> <span class="w" id="mwBPY"> </span><span class="k" id="mwBPc">WRITE</span><span class="w" id="mwBPg"> </span><span class="p" id="mwBPk">(</span><span class="mi" id="mwBPo">6</span><span class="p" id="mwBPs">,</span><span class="w" id="mwBPw"> </span><span class="mi" id="mwBP0">603</span><span class="p" id="mwBP4">)</span> <span class="linenos" data-line="21" id="mwBP8"></span><span class="nl" id="mwBQA"> 603</span> <span class="w" id="mwBQE"> </span><span class="k" id="mwBQI">FORMAT</span><span class="w" id="mwBQM"> </span><span class="p" id="mwBQQ">(</span><span class="mi" id="mwBQU">50</span><span class="n" id="mwBQY">H</span><span class="w" id="mwBQc"> </span><span class="nb" id="mwBQg">SUM </span><span class="n" id="mwBQk">OF</span><span class="w" id="mwBQo"> </span><span class="n" id="mwBQs">TWO</span><span class="w" id="mwBQw"> </span><span class="n" id="mwBQ0">SIDES</span><span class="w" id="mwBQ4"> </span><span class="n" id="mwBQ8">MUST</span><span class="w" id="mwBRA"> </span><span class="n" id="mwBRE">BE</span><span class="w" id="mwBRI"> </span><span class="n" id="mwBRM">GREATER</span><span class="w" id="mwBRQ"> </span><span class="n" id="mwBRU">THAN</span><span class="w" id="mwBRY"> </span><span class="n" id="mwBRc">THIRD</span><span class="w" id="mwBRg"> </span><span class="n" id="mwBRk">SIDE</span><span class="p" id="mwBRo">.)</span> <span class="linenos" data-line="22" id="mwBRs"></span><span class="nl" id="mwBRw"> </span> <span class="w" id="mwBR0"> </span><span class="k" id="mwBR4">STOP </span><span class="mi" id="mwBR8">1</span> <span class="linenos" data-line="23" id="mwBSA"></span><span class="nl" id="mwBSE"> 20</span> <span class="k" id="mwBSI">CONTINUE</span> <span class="linenos" data-line="24" id="mwBSM"></span><span class="c" id="mwBSQ">C</span> <span class="linenos" data-line="25" id="mwBSU"></span><span class="c" id="mwBSY">C USING HERON'S FORMULA WE CALCULATE THE</span> <span class="linenos" data-line="26" id="mwBSc"></span><span class="c" id="mwBSg">C AREA OF THE TRIANGLE</span> <span class="linenos" data-line="27" id="mwBSk"></span><span class="nl" id="mwBSo"> </span> <span class="n" id="mwBSs">S</span><span class="w" id="mwBSw"> </span><span class="o" id="mwBS0">=</span><span class="w" id="mwBS4"> </span><span class="p" id="mwBS8">(</span><span class="n" id="mwBTA">IA</span><span class="w" id="mwBTE"> </span><span class="o" id="mwBTI">+</span><span class="w" id="mwBTM"> </span><span class="n" id="mwBTQ">IB</span><span class="w" id="mwBTU"> </span><span class="o" id="mwBTY">+</span><span class="w" id="mwBTc"> </span><span class="n" id="mwBTg">IC</span><span class="p" id="mwBTk">)</span><span class="w" id="mwBTo"> </span><span class="o" id="mwBTs">/</span><span class="w" id="mwBTw"> </span><span class="mf" id="mwBT0">2.0</span> <span class="linenos" data-line="28" id="mwBT4"></span><span class="nl" id="mwBT8"> </span> <span class="n" id="mwBUA">AREA</span><span class="w" id="mwBUE"> </span><span class="o" id="mwBUI">=</span><span class="w" id="mwBUM"> </span><span class="nb" id="mwBUQ">SQRT</span><span class="w" id="mwBUU"> </span><span class="p" id="mwBUY">(</span><span class="w" id="mwBUc"> </span><span class="n" id="mwBUg">S</span><span class="w" id="mwBUk"> </span><span class="o" id="mwBUo">*</span><span class="w" id="mwBUs"> </span><span class="p" id="mwBUw">(</span><span class="n" id="mwBU0">S</span><span class="w" id="mwBU4"> </span><span class="o" id="mwBU8">-</span><span class="w" id="mwBVA"> </span><span class="n" id="mwBVE">IA</span><span class="p" id="mwBVI">)</span><span class="w" id="mwBVM"> </span><span class="o" id="mwBVQ">*</span><span class="w" id="mwBVU"> </span><span class="p" id="mwBVY">(</span><span class="n" id="mwBVc">S</span><span class="w" id="mwBVg"> </span><span class="o" id="mwBVk">-</span><span class="w" id="mwBVo"> </span><span class="n" id="mwBVs">IB</span><span class="p" id="mwBVw">)</span><span class="w" id="mwBV0"> </span><span class="o" id="mwBV4">*</span><span class="w" id="mwBV8"> </span><span class="p" id="mwBWA">(</span><span class="n" id="mwBWE">S</span><span class="w" id="mwBWI"> </span><span class="o" id="mwBWM">-</span><span class="w" id="mwBWQ"> </span><span class="n" id="mwBWU">IC</span><span class="p" id="mwBWY">))</span> <span class="linenos" data-line="29" id="mwBWc"></span><span class="nl" id="mwBWg"> </span> <span class="k" id="mwBWk">WRITE</span><span class="w" id="mwBWo"> </span><span class="p" id="mwBWs">(</span><span class="mi" id="mwBWw">6</span><span class="p" id="mwBW0">,</span><span class="w" id="mwBW4"> </span><span class="mi" id="mwBW8">601</span><span class="p" id="mwBXA">)</span><span class="w" id="mwBXE"> </span><span class="n" id="mwBXI">IA</span><span class="p" id="mwBXM">,</span><span class="w" id="mwBXQ"> </span><span class="n" id="mwBXU">IB</span><span class="p" id="mwBXY">,</span><span class="w" id="mwBXc"> </span><span class="n" id="mwBXg">IC</span><span class="p" id="mwBXk">,</span><span class="w" id="mwBXo"> </span><span class="n" id="mwBXs">AREA</span> <span class="linenos" data-line="30" id="mwBXw"></span><span class="nl" id="mwBX0"> 601</span> <span class="k" id="mwBX4">FORMAT</span><span class="w" id="mwBX8"> </span><span class="p" id="mwBYA">(</span><span class="mi" id="mwBYE">4</span><span class="n" id="mwBYI">H</span><span class="w" id="mwBYM"> </span><span class="n" id="mwBYQ">A</span><span class="o" id="mwBYU">=</span><span class="w" id="mwBYY"> </span><span class="p" id="mwBYc">,</span><span class="n" id="mwBYg">I5</span><span class="p" id="mwBYk">,</span><span class="mi" id="mwBYo">5</span><span class="n" id="mwBYs">H</span><span class="w" id="mwBYw"> </span><span class="n" id="mwBY0">B</span><span class="o" id="mwBY4">=</span><span class="w" id="mwBY8"> </span><span class="p" id="mwBZA">,</span><span class="n" id="mwBZE">I5</span><span class="p" id="mwBZI">,</span><span class="mi" id="mwBZM">5</span><span class="n" id="mwBZQ">H</span><span class="w" id="mwBZU"> </span><span class="n" id="mwBZY">C</span><span class="o" id="mwBZc">=</span><span class="w" id="mwBZg"> </span><span class="p" id="mwBZk">,</span><span class="n" id="mwBZo">I5</span><span class="p" id="mwBZs">,</span><span class="mi" id="mwBZw">8</span><span class="n" id="mwBZ0">H</span><span class="w" id="mwBZ4"> </span><span class="n" id="mwBZ8">AREA</span><span class="o" id="mwBaA">=</span><span class="w" id="mwBaE"> </span><span class="p" id="mwBaI">,</span><span class="n" id="mwBaM">F10</span><span class="p" id="mwBaQ">.</span><span class="mi" id="mwBaU">2</span><span class="p" id="mwBaY">,</span> <span class="linenos" data-line="31" id="mwBac"></span><span class="nl" id="mwBag"> </span><span class="gs" id="mwBak">+</span><span class="w" id="mwBao"> </span><span class="mi" id="mwBas">13</span><span class="n" id="mwBaw">H</span><span class="w" id="mwBa0"> </span><span class="n" id="mwBa4">SQUARE</span><span class="w" id="mwBa8"> </span><span class="n" id="mwBbA">UNITS</span><span class="p" id="mwBbE">)</span> <span class="linenos" data-line="32" id="mwBbI"></span><span class="nl" id="mwBbM"> </span> <span class="k" id="mwBbQ">STOP</span> <span class="linenos" data-line="33" id="mwBbU"></span><span class="nl" id="mwBbY"> </span> <span class="k" id="mwBbc">END</span>

Although ill-suited for most military-related applications, Fortran was nonetheless one of only a few high-level languages approved for use by the U.S. Department of Defense in the 1970s. The intent was that these would all be replaced by the Defense Department-sponsored Ada programming language, but that did not happen, and the rationale for the Ada 9X revision of the language indicated that since much mathematical software still existed and was still being written in Fortran, there needed to be support in Ada for explicitly interfacing to Fortran routines.

FORTRAN 77

After the release of the FORTRAN 66 standard, compiler vendors introduced several extensions to Standard Fortran, prompting ANSI committee X3J3 in 1969 to begin work on revising the 1966 standard, under sponsorship of CBEMA, the Computer Business Equipment Manufacturers Association (formerly BEMA). Final drafts of this revised standard circulated in 1977, leading to formal approval of the new FORTRAN standard in April 1978. The new standard, called FORTRAN 77 and officially denoted X3.9-1978, added a number of significant features to address many of the shortcomings of FORTRAN 66:

• Block IF and END IF statements, with optional ELSE IF and ELSE clauses, to provide improved language support for structured programming
• DO loop extensions, including parameter expressions, negative increments, and zero trip counts
• OPEN, CLOSE, and INQUIRE statements for improved I/O capability
• Direct-access file I/O
• CHARACTER data type, replacing Hollerith strings with vastly expanded facilities for character input and output and processing of character-based data
• PARAMETER statement for specifying constants
• SAVE statement for persistent local variables
• Generic names for intrinsic functions (e.g. SQRT also accepts arguments of other types, such as COMPLEX or REAL*16).
• A set of intrinsics (LGE, LGT, LLE, LLT) for lexical comparison of strings, based upon the ASCII collating sequence. (These ASCII functions were demanded by the U.S. Department of Defense, in their conditional approval vote.)
• A maximum of seven dimensions in arrays, rather than three. Allowed subscript expressions were also generalized.

In this revision of the standard, a number of features were removed or altered in a manner that might invalidate formerly standard-conforming programs. (Removal was the only allowable alternative to X3J3 at that time, since the concept of "deprecation" was not yet available for ANSI standards.) While most of the 24 items in the conflict list (see Appendix A2 of X3.9-1978) addressed loopholes or pathological cases permitted by the prior standard but rarely used, a small number of specific capabilities were deliberately removed, such as:

• Hollerith constants and Hollerith data, such as GREET = 12HHELLO THERE!
• Reading into an H edit (Hollerith field) descriptor in a FORMAT specification
• Overindexing of array bounds by subscripts

  <span id="mwBhM"></span><span class="nl" id="mwBhQ"> </span> <span class="k" id="mwBhU">DIMENSION </span><span class="n" id="mwBhY">A</span><span class="p" id="mwBhc">(</span><span class="mi" id="mwBhg">10</span><span class="p" id="mwBhk">,</span><span class="mi" id="mwBho">5</span><span class="p" id="mwBhs">)</span> <span class="nl" id="mwBhw"> </span> <span class="n" id="mwBh0">Y</span><span class="w" id="mwBh4"> </span><span class="o" id="mwBh8">=</span><span class="w" id="mwBiA"> </span><span class="n" id="mwBiE">A</span><span class="p" id="mwBiI">(</span><span class="mi" id="mwBiM">11</span><span class="p" id="mwBiQ">,</span><span class="mi" id="mwBiU">1</span><span class="p" id="mwBiY">)</span>

• Transfer of control out of and back into the range of a DO loop (also known as "Extended Range")

A Fortran 77 version of the Heron program requires no modifications to the Fortran 66 version. However this example demonstrates additional cleanup of the I/O statements, including using list-directed I/O, and replacing the Hollerith edit descriptors in the FORMAT statements with quoted strings. It also uses structured IF and END IF statements, rather than GOTO/CONTINUE.

<span id="mwBjA"></span><span class="linenos" data-line="1" id="mwBjE"></span><span class="nl" id="mwBjI"> </span> <span class="k" id="mwBjM">PROGRAM </span><span class="n" id="mwBjQ">HERON</span> <span class="linenos" data-line="2" id="mwBjU"></span><span class="c" id="mwBjY">C AREA OF A TRIANGLE WITH A STANDARD SQUARE ROOT FUNCTION</span> <span class="linenos" data-line="3" id="mwBjc"></span><span class="c" id="mwBjg">C INPUT - DEFAULT STANDARD INPUT UNIT, INTEGER INPUT</span> <span class="linenos" data-line="4" id="mwBjk"></span><span class="c" id="mwBjo">C OUTPUT - DEFAULT STANDARD OUTPUT UNIT, REAL OUTPUT</span> <span class="linenos" data-line="5" id="mwBjs"></span><span class="c" id="mwBjw">C INPUT ERROR DISPLAY ERROR OUTPUT CODE 1 IN JOB CONTROL LISTING</span> <span class="linenos" data-line="6" id="mwBj0"></span><span class="nl" id="mwBj4"> </span> <span class="k" id="mwBj8">READ</span><span class="w" id="mwBkA"> </span><span class="p" id="mwBkE">(</span><span class="o" id="mwBkI">*</span><span class="p" id="mwBkM">,</span><span class="w" id="mwBkQ"> </span><span class="o" id="mwBkU">*</span><span class="p" id="mwBkY">)</span><span class="w" id="mwBkc"> </span><span class="n" id="mwBkg">IA</span><span class="p" id="mwBkk">,</span><span class="w" id="mwBko"> </span><span class="n" id="mwBks">IB</span><span class="p" id="mwBkw">,</span><span class="w" id="mwBk0"> </span><span class="n" id="mwBk4">IC</span> <span class="linenos" data-line="7" id="mwBk8"></span><span class="c" id="mwBlA">C</span> <span class="linenos" data-line="8" id="mwBlE"></span><span class="c" id="mwBlI">C IA, IB, AND IC MAY NOT BE NEGATIVE OR ZERO</span> <span class="linenos" data-line="9" id="mwBlM"></span><span class="c" id="mwBlQ">C FURTHERMORE, THE SUM OF TWO SIDES OF A TRIANGLE</span> <span class="linenos" data-line="10" id="mwBlU"></span><span class="c" id="mwBlY">C MUST BE GREATER THAN THE THIRD SIDE, SO WE CHECK FOR THAT, TOO</span> <span class="linenos" data-line="11" id="mwBlc"></span><span class="nl" id="mwBlg"> </span> <span class="k" id="mwBlk">IF</span><span class="w" id="mwBlo"> </span><span class="p" id="mwBls">(</span><span class="n" id="mwBlw">IA</span><span class="w" id="mwBl0"> </span><span class="p" id="mwBl4">.</span><span class="n" id="mwBl8">LE</span><span class="p" id="mwBmA">.</span><span class="w" id="mwBmE"> </span><span class="mi" id="mwBmI">0</span><span class="w" id="mwBmM"> </span><span class="p" id="mwBmQ">.</span><span class="nb" id="mwBmU">OR</span><span class="p" id="mwBmY">.</span><span class="w" id="mwBmc"> </span><span class="n" id="mwBmg">IB</span><span class="w" id="mwBmk"> </span><span class="p" id="mwBmo">.</span><span class="n" id="mwBms">LE</span><span class="p" id="mwBmw">.</span><span class="w" id="mwBm0"> </span><span class="mi" id="mwBm4">0</span><span class="w" id="mwBm8"> </span><span class="p" id="mwBnA">.</span><span class="nb" id="mwBnE">OR</span><span class="p" id="mwBnI">.</span><span class="w" id="mwBnM"> </span><span class="n" id="mwBnQ">IC</span><span class="w" id="mwBnU"> </span><span class="p" id="mwBnY">.</span><span class="n" id="mwBnc">LE</span><span class="p" id="mwBng">.</span><span class="w" id="mwBnk"> </span><span class="mi" id="mwBno">0</span><span class="p" id="mwBns">)</span><span class="w" id="mwBnw"> </span><span class="k" id="mwBn0">THEN</span> <span class="linenos" data-line="12" id="mwBn4"></span><span class="nl" id="mwBn8"> </span> <span class="w" id="mwBoA"> </span><span class="k" id="mwBoE">WRITE</span><span class="w" id="mwBoI"> </span><span class="p" id="mwBoM">(</span><span class="o" id="mwBoQ">*</span><span class="p" id="mwBoU">,</span><span class="w" id="mwBoY"> </span><span class="o" id="mwBoc">*</span><span class="p" id="mwBog">)</span><span class="w" id="mwBok"> </span><span class="s1" id="mwBoo">'IA, IB, and IC must be greater than zero.'</span> <span class="linenos" data-line="13" id="mwBos"></span><span class="nl" id="mwBow"> </span> <span class="w" id="mwBo0"> </span><span class="k" id="mwBo4">STOP </span><span class="mi" id="mwBo8">1</span> <span class="linenos" data-line="14" id="mwBpA"></span><span class="nl" id="mwBpE"> </span> <span class="k" id="mwBpI">END IF</span> <span class="linenos" data-line="15" id="mwBpM"></span><span class="c" id="mwBpQ">C</span> <span class="linenos" data-line="16" id="mwBpU"></span><span class="nl" id="mwBpY"> </span> <span class="k" id="mwBpc">IF</span><span class="w" id="mwBpg"> </span><span class="p" id="mwBpk">(</span><span class="n" id="mwBpo">IA</span><span class="o" id="mwBps">+</span><span class="n" id="mwBpw">IB</span><span class="o" id="mwBp0">-</span><span class="n" id="mwBp4">IC</span><span class="w" id="mwBp8"> </span><span class="p" id="mwBqA">.</span><span class="n" id="mwBqE">LE</span><span class="p" id="mwBqI">.</span><span class="w" id="mwBqM"> </span><span class="mi" id="mwBqQ">0</span> <span class="linenos" data-line="17" id="mwBqU"></span><span class="nl" id="mwBqY"> </span><span class="gs" id="mwBqc">+</span><span class="w" id="mwBqg"> </span><span class="p" id="mwBqk">.</span><span class="nb" id="mwBqo">OR</span><span class="p" id="mwBqs">.</span><span class="w" id="mwBqw"> </span><span class="n" id="mwBq0">IA</span><span class="o" id="mwBq4">+</span><span class="n" id="mwBq8">IC</span><span class="o" id="mwBrA">-</span><span class="n" id="mwBrE">IB</span><span class="w" id="mwBrI"> </span><span class="p" id="mwBrM">.</span><span class="n" id="mwBrQ">LE</span><span class="p" id="mwBrU">.</span><span class="w" id="mwBrY"> </span><span class="mi" id="mwBrc">0</span> <span class="linenos" data-line="18" id="mwBrg"></span><span class="nl" id="mwBrk"> </span><span class="gs" id="mwBro">+</span><span class="w" id="mwBrs"> </span><span class="p" id="mwBrw">.</span><span class="nb" id="mwBr0">OR</span><span class="p" id="mwBr4">.</span><span class="w" id="mwBr8"> </span><span class="n" id="mwBsA">IB</span><span class="o" id="mwBsE">+</span><span class="n" id="mwBsI">IC</span><span class="o" id="mwBsM">-</span><span class="n" id="mwBsQ">IA</span><span class="w" id="mwBsU"> </span><span class="p" id="mwBsY">.</span><span class="n" id="mwBsc">LE</span><span class="p" id="mwBsg">.</span><span class="w" id="mwBsk"> </span><span class="mi" id="mwBso">0</span><span class="p" id="mwBss">)</span><span class="w" id="mwBsw"> </span><span class="k" id="mwBs0">THEN</span> <span class="linenos" data-line="19" id="mwBs4"></span><span class="nl" id="mwBs8"> </span> <span class="w" id="mwBtA"> </span><span class="k" id="mwBtE">WRITE</span><span class="w" id="mwBtI"> </span><span class="p" id="mwBtM">(</span><span class="o" id="mwBtQ">*</span><span class="p" id="mwBtU">,</span><span class="w" id="mwBtY"> </span><span class="o" id="mwBtc">*</span><span class="p" id="mwBtg">)</span><span class="w" id="mwBtk"> </span><span class="s1" id="mwBto">'Sum of two sides must be greater than third side.'</span> <span class="linenos" data-line="20" id="mwBts"></span><span class="nl" id="mwBtw"> </span> <span class="w" id="mwBt0"> </span><span class="k" id="mwBt4">STOP </span><span class="mi" id="mwBt8">1</span> <span class="linenos" data-line="21" id="mwBuA"></span><span class="nl" id="mwBuE"> </span> <span class="k" id="mwBuI">END IF</span> <span class="linenos" data-line="22" id="mwBuM"></span><span class="c" id="mwBuQ">C</span> <span class="linenos" data-line="23" id="mwBuU"></span><span class="c" id="mwBuY">C USING HERON'S FORMULA WE CALCULATE THE</span> <span class="linenos" data-line="24" id="mwBuc"></span><span class="c" id="mwBug">C AREA OF THE TRIANGLE</span> <span class="linenos" data-line="25" id="mwBuk"></span><span class="nl" id="mwBuo"> </span> <span class="n" id="mwBus">S</span><span class="w" id="mwBuw"> </span><span class="o" id="mwBu0">=</span><span class="w" id="mwBu4"> </span><span class="p" id="mwBu8">(</span><span class="n" id="mwBvA">IA</span><span class="w" id="mwBvE"> </span><span class="o" id="mwBvI">+</span><span class="w" id="mwBvM"> </span><span class="n" id="mwBvQ">IB</span><span class="w" id="mwBvU"> </span><span class="o" id="mwBvY">+</span><span class="w" id="mwBvc"> </span><span class="n" id="mwBvg">IC</span><span class="p" id="mwBvk">)</span><span class="w" id="mwBvo"> </span><span class="o" id="mwBvs">/</span><span class="w" id="mwBvw"> </span><span class="mf" id="mwBv0">2.0</span> <span class="linenos" data-line="26" id="mwBv4"></span><span class="nl" id="mwBv8"> </span> <span class="n" id="mwBwA">AREA</span><span class="w" id="mwBwE"> </span><span class="o" id="mwBwI">=</span><span class="w" id="mwBwM"> </span><span class="nb" id="mwBwQ">SQRT</span><span class="w" id="mwBwU"> </span><span class="p" id="mwBwY">(</span><span class="w" id="mwBwc"> </span><span class="n" id="mwBwg">S</span><span class="w" id="mwBwk"> </span><span class="o" id="mwBwo">*</span><span class="w" id="mwBws"> </span><span class="p" id="mwBww">(</span><span class="n" id="mwBw0">S</span><span class="w" id="mwBw4"> </span><span class="o" id="mwBw8">-</span><span class="w" id="mwBxA"> </span><span class="n" id="mwBxE">IA</span><span class="p" id="mwBxI">)</span><span class="w" id="mwBxM"> </span><span class="o" id="mwBxQ">*</span><span class="w" id="mwBxU"> </span><span class="p" id="mwBxY">(</span><span class="n" id="mwBxc">S</span><span class="w" id="mwBxg"> </span><span class="o" id="mwBxk">-</span><span class="w" id="mwBxo"> </span><span class="n" id="mwBxs">IB</span><span class="p" id="mwBxw">)</span><span class="w" id="mwBx0"> </span><span class="o" id="mwBx4">*</span><span class="w" id="mwBx8"> </span><span class="p" id="mwByA">(</span><span class="n" id="mwByE">S</span><span class="w" id="mwByI"> </span><span class="o" id="mwByM">-</span><span class="w" id="mwByQ"> </span><span class="n" id="mwByU">IC</span><span class="p" id="mwByY">))</span> <span class="linenos" data-line="27" id="mwByc"></span><span class="nl" id="mwByg"> </span> <span class="k" id="mwByk">WRITE</span><span class="w" id="mwByo"> </span><span class="p" id="mwBys">(</span><span class="o" id="mwByw">*</span><span class="p" id="mwBy0">,</span><span class="w" id="mwBy4"> </span><span class="mi" id="mwBy8">601</span><span class="p" id="mwBzA">)</span><span class="w" id="mwBzE"> </span><span class="n" id="mwBzI">IA</span><span class="p" id="mwBzM">,</span><span class="w" id="mwBzQ"> </span><span class="n" id="mwBzU">IB</span><span class="p" id="mwBzY">,</span><span class="w" id="mwBzc"> </span><span class="n" id="mwBzg">IC</span><span class="p" id="mwBzk">,</span><span class="w" id="mwBzo"> </span><span class="n" id="mwBzs">AREA</span> <span class="linenos" data-line="28" id="mwBzw"></span><span class="nl" id="mwBz0"> 601</span> <span class="k" id="mwBz4">FORMAT</span><span class="w" id="mwBz8"> </span><span class="p" id="mwB0A">(</span><span class="s1" id="mwB0E">'A= '</span><span class="p" id="mwB0I">,</span><span class="w" id="mwB0M"> </span><span class="n" id="mwB0Q">I5</span><span class="p" id="mwB0U">,</span><span class="w" id="mwB0Y"> </span><span class="s1" id="mwB0c">' B= '</span><span class="p" id="mwB0g">,</span><span class="w" id="mwB0k"> </span><span class="n" id="mwB0o">I5</span><span class="p" id="mwB0s">,</span><span class="w" id="mwB0w"> </span><span class="s1" id="mwB00">' C= '</span><span class="p" id="mwB04">,</span><span class="w" id="mwB08"> </span><span class="n" id="mwB1A">I5</span><span class="p" id="mwB1E">,</span><span class="w" id="mwB1I"> </span><span class="s1" id="mwB1M">' AREA= '</span><span class="p" id="mwB1Q">,</span><span class="w" id="mwB1U"> </span><span class="n" id="mwB1Y">F10</span><span class="p" id="mwB1c">.</span><span class="mi" id="mwB1g">2</span><span class="p" id="mwB1k">,</span> <span class="linenos" data-line="29" id="mwB1o"></span><span class="nl" id="mwB1s"> </span><span class="gs" id="mwB1w">+</span><span class="w" id="mwB10"> </span><span class="s1" id="mwB14">' square units'</span><span class="p" id="mwB18">)</span> <span class="linenos" data-line="30" id="mwB2A"></span><span class="nl" id="mwB2E"> </span> <span class="k" id="mwB2I">STOP</span> <span class="linenos" data-line="31" id="mwB2M"></span><span class="nl" id="mwB2Q"> </span> <span class="k" id="mwB2U">END</span>

Transition to ANSI Standard Fortran

The development of a revised standard to succeed FORTRAN 77 would be repeatedly delayed as the standardization process struggled to keep up with rapid changes in computing and programming practice. In the meantime, as the "Standard FORTRAN" for nearly fifteen years, FORTRAN 77 would become the historically most important dialect.

An important practical extension to FORTRAN 77 was the release of MIL-STD-1753 in 1978. This specification, developed by the U.S. Department of Defense, standardized a number of features implemented by most FORTRAN 77 compilers but not included in the ANSI FORTRAN 77 standard. These features would eventually be incorporated into the Fortran 90 standard.

• DO WHILE and END DO statements
• INCLUDE statement
• IMPLICIT NONE variant of the IMPLICIT statement
• Bit manipulation intrinsic functions, based on similar functions included in Industrial Real-Time Fortran (ANSI/ISA S61.1 (1976))

The IEEE 1003.9 POSIX Standard, released in 1991, provided a simple means for FORTRAN 77 programmers to issue POSIX system calls. Over 100 calls were defined in the document – allowing access to POSIX-compatible process control, signal handling, file system control, device control, procedure pointing, and stream I/O in a portable manner.

Fortran 90

The much-delayed successor to FORTRAN 77, informally known as Fortran 90 (and prior to that, Fortran 8X), was finally released as ISO/IEC standard 1539:1991 in 1991 and an ANSI Standard in 1992. In addition to changing the official spelling from FORTRAN to Fortran, this major revision added many new features to reflect the significant changes in programming practice that had evolved since the 1978 standard:

• Free-form source input removes the need to skip the first six character positions before entering statements. Line continuations are specified by the & character at the end of the line, rather than in column 6 of the next line. Blanks also become significant. Typically files with names ending in .f90 signify free-format source code. The older fixed-form source form is still defined, but considered obsolescent.
• Lowercase Fortran keywords
• Identifiers up to 31 characters in length (in the previous standard, it was only six characters).
• Inline comments
• Ability to operate on arrays (or array sections) as a whole, thus greatly simplifying math and engineering computations.
  • whole, partial and masked array assignment statements and array expressions, such as X(1:N)=R(1:N)*COS(A(1:N))
  • WHERE statement for selective array assignment
  • array-valued constants and expressions,
  • user-defined array-valued functions and array constructors.
• RECURSIVE procedures
• Modules, to group related procedures and data together, and make them available to other program units, including the capability to limit the accessibility to only specific parts of the module.
• A vastly improved argument-passing mechanism, allowing interfaces to be checked at compile time
• User-written interfaces for generic procedures
• Operator overloading
• Derived (structured) data types
• New data type declaration syntax, to specify the data type and other attributes of variables
• Dynamic memory allocation by means of the ALLOCATABLE attribute and the ALLOCATE and DEALLOCATE statements
• POINTER attribute, pointer assignment, and NULLIFY statement to facilitate the creation and manipulation of dynamic data structures
• Structured looping constructs, with an END DO statement for loop termination, and EXIT and CYCLE statements for terminating normal DO loop iterations in an orderly way
• SELECT CASE, CASE, . . . CASE DEFAULT, END SELECT construct for multi-way selection
• Portable specification of numerical precision under the user's control
• New and enhanced intrinsic procedures.

Obsolescence and deletions

Unlike the prior revision, Fortran 90 removed no features. Any standard-conforming FORTRAN 77 program was also standard-conforming under Fortran 90, and either standard should have been usable to define its behavior.

A small set of features were identified as "obsolescent" and were expected to be removed in a future standard. All of the functionalities of these early-version features can be performed by newer Fortran features. Some are kept to simplify porting of old programs but many were deleted in Fortran 95.

"Hello, World!" example

<span id="mwCBM"></span><span class="k" id="mwCBQ">program </span><span class="n" id="mwCBU">helloworld</span> <span class="w" id="mwCBY"> </span><span class="k" id="mwCBc">print</span><span class="w" id="mwCBg"> </span><span class="o" id="mwCBk">*</span><span class="p" id="mwCBo">,</span><span class="w" id="mwCBs"> </span><span class="s2" id="mwCBw">"Hello, World!"</span> <span class="k" id="mwCB0">end program </span><span class="n" id="mwCB4">helloworld</span>

Fortran 95

Fortran 95, published officially as ISO/IEC 1539-1:1997, was a minor revision, mostly to resolve some outstanding issues from the Fortran 90 standard. Nevertheless, Fortran 95 also added a number of extensions, notably from the High Performance Fortran specification:

• FORALL and nested WHERE constructs to aid vectorization
• User-defined PURE and ELEMENTAL procedures
• Default initialization of derived type components, including pointer initialization
• Expanded the ability to use initialization expressions for data objects
• Initialization of pointers to NULL()
• Clearly defined that ALLOCATABLE arrays are automatically deallocated when they go out of scope.

A number of intrinsic functions were extended (for example a dim argument was added to the maxloc intrinsic).

Several features noted in Fortran 90 to be "obsolescent" were removed from Fortran 95:

• DO statements using REAL and DOUBLE PRECISION index variables
• Branching to an END IF statement from outside its block
• PAUSE statement
• ASSIGN and assigned GO TO statement, and assigned format specifiers
• H Hollerith edit descriptor.

An important supplement to Fortran 95 was the ISO technical report TR-15581: Enhanced Data Type Facilities, informally known as the Allocatable TR. This specification defined enhanced use of ALLOCATABLE arrays, prior to the availability of fully Fortran 2003-compliant Fortran compilers. Such uses include ALLOCATABLE arrays as derived type components, in procedure dummy argument lists, and as function return values. (ALLOCATABLE arrays are preferable to POINTER-based arrays because ALLOCATABLE arrays are guaranteed by Fortran 95 to be deallocated automatically when they go out of scope, eliminating the possibility of memory leakage. In addition, elements of allocatable arrays are contiguous, and aliasing is not an issue for optimization of array references, allowing compilers to generate faster code than in the case of pointers.)

Another important supplement to Fortran 95 was the ISO technical report TR-15580: Floating-point exception handling, informally known as the IEEE TR. This specification defined support for IEEE floating-point arithmetic and floating-point exception handling.

Conditional compilation and varying length strings

In addition to the mandatory "Base language" (defined in ISO/IEC 1539-1 : 1997), the Fortran 95 language also included two optional modules:

• Varying length character strings (ISO/IEC 1539-2 : 2000)
• Conditional compilation (ISO/IEC 1539-3 : 1998)

which, together, compose the multi-part International Standard (ISO/IEC 1539).

According to the standards developers, "the optional parts describe self-contained features which have been requested by a substantial body of users and/or implementors, but which are not deemed to be of sufficient generality for them to be required in all standard-conforming Fortran compilers." Nevertheless, if a standard-conforming Fortran does provide such options, then they "must be provided in accordance with the description of those facilities in the appropriate Part of the Standard".

Modern Fortran

The language defined by the twenty-first century standards, in particular because of its incorporation of object-oriented programming support and subsequently Coarray Fortran, is often referred to as 'Modern Fortran', and the term is increasingly used in the literature.

Fortran 2003

Fortran 2003, officially published as ISO/IEC 1539-1:2004, was a major revision introducing many new features. A comprehensive summary of the new features of Fortran 2003 is available at the Fortran Working Group (ISO/IEC JTC1/SC22/WG5) official Web site.

From that article, the major enhancements for this revision include:

• Derived type enhancements: parameterized derived types, improved control of accessibility, improved structure constructors, and finalizers
• Object-oriented programming support: type extension and inheritance, polymorphism, dynamic type allocation, and type-bound procedures, providing complete support for abstract data types
• Data manipulation enhancements: allocatable components (incorporating TR 15581), deferred type parameters, VOLATILE attribute, explicit type specification in array constructors and allocate statements, pointer enhancements, extended initialization expressions, and enhanced intrinsic procedures
• Input/output enhancements: asynchronous transfer, stream access, user specified transfer operations for derived types, user specified control of rounding during format conversions, named constants for preconnected units, the FLUSH statement, regularization of keywords, and access to error messages
• Procedure pointers
• Support for IEEE floating-point arithmetic and floating-point exception handling (incorporating TR 15580)
• Interoperability with the C programming language
• Support for international usage: access to ISO 10646 4-byte characters and choice of decimal or comma in numeric formatted input/output
• Enhanced integration with the host operating system: access to command-line arguments, environment variables, and processor error messages

An important supplement to Fortran 2003 was the ISO technical report TR-19767: Enhanced module facilities in Fortran. This report provided sub-modules, which make Fortran modules more similar to Modula-2 modules. They are similar to Ada private child sub-units. This allows the specification and implementation of a module to be expressed in separate program units, which improves packaging of large libraries, allows preservation of trade secrets while publishing definitive interfaces, and prevents compilation cascades.

Fortran 2008

ISO/IEC 1539-1:2010, informally known as Fortran 2008, was approved in September 2010. As with Fortran 95, this is a minor upgrade, incorporating clarifications and corrections to Fortran 2003, as well as introducing some new capabilities. The new capabilities include:

• Sub-modules – additional structuring facilities for modules; supersedes ISO/IEC TR 19767:2005
• Coarray Fortran – a parallel execution model
• The DO CONCURRENT construct – for loop iterations with no interdependencies
• The CONTIGUOUS attribute – to specify storage layout restrictions
• The BLOCK construct – can contain declarations of objects with construct scope
• Recursive allocatable components – as an alternative to recursive pointers in derived types

The Final Draft international Standard (FDIS) is available as document N1830.

A supplement to Fortran 2008 is the International Organization for Standardization (ISO) Technical Specification (TS) 29113 on Further Interoperability of Fortran with C, which has been submitted to ISO in May 2012 for approval. The specification adds support for accessing the array descriptor from C and allows ignoring the type and rank of arguments.

Fortran 2018

The Fortran 2018 revision of the language was earlier referred to as Fortran 2015. It was a significant revision and was released on November 28, 2018.

Fortran 2018 incorporates two previously published Technical Specifications:

• ISO/IEC TS 29113:2012 Further Interoperability with C
• ISO/IEC TS 18508:2015 Additional Parallel Features in Fortran

Additional changes and new features include support for ISO/IEC/IEEE 60559:2011 (the version of the IEEE floating-point standard before the latest minor revision IEEE 754–2019), hexadecimal input/output, IMPLICIT NONE enhancements and other changes.

Fortran 2018 deleted the arithmetic IF statement. It also deleted non-block DO constructs - loops which do not end with an END DO or CONTINUE statement. These had been an obsolescent part of the language since Fortran 90.

New obsolescences are: COMMON and EQUIVALENCE statements and the BLOCK DATA program unit, labelled DO loops, specific names for intrinsic functions, and the FORALL statement and construct.

Fortran 2023

Fortran 2023 (ISO/IEC 1539-1:2023) was published in November 2023, and can be purchased from the ISO. Fortran 2023 is a minor extension of Fortran 2018 that focuses on correcting errors and omissions in Fortran 2018. It also adds several small features, including conditional expressions and arguments, simple procedures, and an enumerated type capability. Degree- and half revolution based trig functions were also added. Degree-based trig functions were previously a very common vendor extension.

Language features

A full description of the Fortran language features brought by Fortran 95 is covered in the related article, Fortran 95 language features. The language versions defined by later standards are often referred to collectively as 'Modern Fortran' and are described in the literature.

Science and engineering

Although a 1968 journal article by the authors of BASIC already described FORTRAN as "old-fashioned", programs have been written in Fortran for many decades and there is a vast body of Fortran software in daily use throughout the scientific and engineering communities. Jay Pasachoff wrote in 1984 that "physics and astronomy students simply have to learn FORTRAN. So much exists in FORTRAN that it seems unlikely that scientists will change to Pascal, Modula-2, or whatever." In 1993, Cecil E. Leith called FORTRAN the "mother tongue of scientific computing", adding that its replacement by any other possible language "may remain a forlorn hope".

It is the primary language for some of the most intensive super-computing tasks, such as in astronomy, climate modeling, computational chemistry, computational economics, computational fluid dynamics, computational physics, data analysis, hydrological modeling, numerical linear algebra and numerical libraries (LAPACK, IMSL and NAG), optimization, satellite simulation, structural engineering, and weather prediction. Many of the floating-point benchmarks to gauge the performance of new computer processors, such as the floating-point components of the SPEC benchmarks (e.g., CFP2006, CFP2017) are written in Fortran. Math algorithms are well documented in Numerical Recipes.

Apart from this, more modern codes in computational science generally use large program libraries, such as METIS for graph partitioning, PETSc or Trilinos for linear algebra capabilities, deal.II or FEniCS for mesh and finite element support, and other generic libraries. Since the early 2000s, many of the widely used support libraries have also been implemented in C and more recently, in C++. On the other hand, high-level languages such as the Wolfram Language, MATLAB, Python, and R have become popular in particular areas of computational science. Consequently, a growing fraction of scientific programs are also written in such higher-level scripting languages. For this reason, facilities for inter-operation with C were added to Fortran 2003 and enhanced by the ISO/IEC technical specification 29113, which was incorporated into Fortran 2018 to allow more flexible interoperation with other programming languages.

Portability

Portability was a problem in the early days because there was no agreed upon standard—not even IBM's reference manual—and computer companies vied to differentiate their offerings from others by providing incompatible features. Standards have improved portability. The 1966 standard provided a reference syntax and semantics, but vendors continued to provide incompatible extensions. Although careful programmers were coming to realize that use of incompatible extensions caused expensive portability problems, and were therefore using programs such as The PFORT Verifier, it was not until after the 1977 standard, when the National Bureau of Standards (now NIST) published FIPS PUB 69, that processors purchased by the U.S. Government were required to diagnose extensions of the standard. Rather than offer two processors, essentially every compiler eventually had at least an option to diagnose extensions.

Incompatible extensions were not the only portability problem. For numerical calculations, it is important to take account of the characteristics of the arithmetic. This was addressed by Fox et al. in the context of the 1966 standard by the PORT library. The ideas therein became widely used, and were eventually incorporated into the 1990 standard by way of intrinsic inquiry functions. The widespread (now almost universal) adoption of the IEEE 754 standard for binary floating-point arithmetic has essentially removed this problem.

Access to the computing environment (e.g., the program's command line, environment variables, textual explanation of error conditions) remained a problem until it was addressed by the 2003 standard.

Large collections of library software that could be described as being loosely related to engineering and scientific calculations, such as graphics libraries, have been written in C, and therefore access to them presented a portability problem. This has been addressed by incorporation of C interoperability into the 2003 standard.

It is now possible (and relatively easy) to write an entirely portable program in Fortran, even without recourse to a preprocessor.

Historical variants

Manufacturer versions

Until the Fortran 66 standard was developed, each compiler supported its own variant of Fortran. Some were more divergent from the mainstream than others. One of the most prominent textbooks of the time, Daniel D. McCracken's A Guide to FORTRAN IV Programming (1965), devoted a full two-page matrix of 24 feature differences versus 29 manufacturer-and-computer versions. Another textbook author from that era, John M. Blatt, despaired of doing the same, writing that "manufacturers tend to consider 'their own' FORTRAN as a selling point, and as soon as one dialect of FORTRAN acquire some 'gimmick' or other, other dialects try to go it one better." Nonetheless, Fortran programs were far more portable than assembly languages ones, and in practice those familiar with one manufacturer's Fortran could straighforwardly adapt themselves to that of a different manufacturer.

Fortran 5 was marketed by Data General Corp from the early 1970s to the early 1980s, for the Nova, Eclipse, and MV line of computers. It had an optimizing compiler that was quite good for minicomputers of its time. The language most closely resembles FORTRAN 66.

FORTRAN V was distributed by Control Data Corporation in 1968 for the CDC 6600 series. The language was based upon FORTRAN IV.

Univac also offered a compiler for the 1100 series known as FORTRAN V. A spinoff of Univac Fortran V was Athena FORTRAN.

Specific variants produced by the vendors of high-performance scientific computers (e.g., Burroughs, Control Data Corporation (CDC), Cray, Honeywell, IBM, Texas Instruments, and UNIVAC) added extensions to Fortran to take advantage of special hardware features such as instruction cache, CPU pipelines, and vector arrays. For example, one of IBM's FORTRAN compilers (H Extended IUP) had a level of optimization which reordered the machine code instructions to keep multiple internal arithmetic units busy simultaneously. Another example is CFD, a special variant of FORTRAN designed specifically for the ILLIAC IV supercomputer, running at NASA's Ames Research Center. IBM Research Labs also developed an extended FORTRAN-based language called VECTRAN for processing vectors and matrices.

Object-Oriented Fortran was an object-oriented extension of Fortran, in which data items can be grouped into objects, which can be instantiated and executed in parallel. It was available for Solaris, IRIX, NeXTSTEP, iPSC, and nCUBE, but is no longer supported.

Such machine-specific extensions have either disappeared over time or have had elements incorporated into the main standards. The major remaining extension is OpenMP, which is a cross-platform extension for shared memory programming. One new extension, Coarray Fortran, is intended to support parallel programming.

FOR TRANSIT was the name of a reduced version of the IBM 704 FORTRAN language, which was implemented for the IBM 650, using a translator program developed at Carnegie in the late 1950s. The following comment appears in the IBM Reference Manual (FOR TRANSIT Automatic Coding System C28-4038, Copyright 1957, 1959 by IBM):

The FORTRAN system was designed for a more complex machine than the 650, and consequently some of the 32 statements found in the FORTRAN Programmer's Reference Manual are not acceptable to the FOR TRANSIT system. In addition, certain restrictions to the FORTRAN language have been added. However, none of these restrictions make a source program written for FOR TRANSIT incompatible with the FORTRAN system for the 704.

The permissible statements were:

• Arithmetic assignment statements, e.g., a = b
• GO to n
• GO TO (n1, n2, ..., nm), i
• IF (a) n1, n2, n3
• PAUSE
• STOP
• DO n i = m1, m2
• CONTINUE
• END
• READ n, list
• PUNCH n, list
• DIMENSION V, V, V, ...
• EQUIVALENCE (a,b,c), (d,c), ...

Up to ten subroutines could be used in one program.

FOR TRANSIT statements were limited to columns 7 through 56, only. Punched cards were used for input and output on the IBM 650. Three passes were required to translate source code to the "IT" language, then to compile the IT statements into SOAP assembly language, and finally to produce the object program, which could then be loaded into the machine to run the program (using punched cards for data input, and outputting results onto punched cards).

Two versions existed for the 650s with a 2000 word memory drum: FOR TRANSIT I (S) and FOR TRANSIT II, the latter for machines equipped with indexing registers and automatic floating-point decimal (bi-quinary) arithmetic. Appendix A of the manual included wiring diagrams for the IBM 533 card reader/punch control panel.

Student compilers

The first FORTRAN compiler set a high standard of efficiency for compiled code. This goal made it difficult to create a compiler so it was usually done by the computer manufacturers to support hardware sales. The requirement for execution efficiency remained the primary design criteria for the language through the early evolution of the language. This left an important niche: compilers that were fast in the compilation and loading phase and provided good diagnostics for the programmer, who was often a student as by this time FORTRAN IV had started to become an important educational tool.

WATFOR, introduced in the 1960s, was popularly used in colleges and universities. Developed, supported, and distributed by the University of Waterloo, WATFOR was based largely on FORTRAN IV. A student using WATFOR could submit their batch FORTRAN job and, if there were no syntax errors, the program would move straight to execution. This simplification allowed students to concentrate on their program's syntax and semantics, or execution logic flow, rather than dealing with submission Job Control Language (JCL), the compile/link-edit/execution successive process(es), or other complexities of a mainframe environment.

Moreover, WATFOR presented a superset of the Fortran language, in particular providing so-called "free" READ and PRINT commands as an alternative to the formatted READ and WRITE> statements of regular Fortran. The FORMAT statements of the latter allowed considerable flexibility but could be quite complicated, and were sometimes subject to manufacturer differences or site-specific guidelines. Since the formatted approach caused even experienced programmers difficulties, providing an alternative in a student compiler was a definite advantage. A down side to this simplified environment was that WATFOR was not a good choice for programmers needing the expanded abilities of their host processor(s), e.g., WATFOR typically had very limited access to I/O devices. WATFOR was succeeded by WATFIV and later versions.

Another student compiler was PUFFT, and on a smaller scale, FORGO, Wits Fortran, and Kingston Fortran 2.

Fortran-based languages

Prior to FORTRAN 77, many preprocessors were commonly used to provide a friendlier language, with the advantage that the preprocessed code could be compiled on any machine with a standard FORTRAN compiler. These preprocessors would typically support structured programming, variable names longer than six characters, additional data types, conditional compilation, and even macro capabilities. Popular preprocessors included EFL, FLECS, iftran, MORTRAN, SFtran, S-Fortran, Ratfor, and Ratfiv. EFL, Ratfor and Ratfiv, for example, implemented C-like languages, outputting preprocessed code in standard FORTRAN 66. The PFORT preprocessor was often used to verify that code conformed to a portable subset of the language. Despite advances in the Fortran language, preprocessors continue to be used for conditional compilation and macro substitution.

<span id="mwCh8"></span><span class="k" id="mwCiA">program</span><span class="p" id="mwCiE">;</span><span class="w" id="mwCiI"> </span><span class="n" id="mwCiM">s</span><span class="o" id="mwCiQ">=</span><span class="mi" id="mwCiU">0</span><span class="w" id="mwCiY"> </span><span class="n" id="mwCic">i</span><span class="o" id="mwCig">=</span><span class="mi" id="mwCik">1</span><span class="p" id="mwCio">,</span><span class="n" id="mwCis">n</span><span class="p" id="mwCiw">;</span><span class="w" id="mwCi0"> </span><span class="n" id="mwCi4">s</span><span class="o" id="mwCi8">=</span><span class="n" id="mwCjA">s</span><span class="o" id="mwCjE">+</span><span class="mi" id="mwCjI">1</span><span class="p" id="mwCjM">;</span><span class="w" id="mwCjQ"> </span><span class="k" id="mwCjU">stop </span><span class="n" id="mwCjY">i</span><span class="p" id="mwCjc">;</span><span class="w" id="mwCjg"> </span><span class="n" id="mwCjk">s</span><span class="o" id="mwCjo">=</span><span class="s1" id="mwCjs">'s'</span><span class="w" id="mwCjw"> </span><span class="k" id="mwCj0">Stop</span>

(line programming)

LRLTRAN was developed at the Lawrence Radiation Laboratory to provide support for vector arithmetic and dynamic storage, among other extensions to support systems programming. The distribution included the Livermore Time Sharing System (LTSS) operating system.

The Fortran-95 Standard includes an optional Part 3 which defines an optional conditional compilation capability. This capability is often referred to as "CoCo".

Many Fortran compilers have integrated subsets of the C preprocessor into their systems.

SIMSCRIPT is an application specific Fortran preprocessor for modeling and simulating large discrete systems.

The F programming language was designed to be a clean subset of Fortran 95 that attempted to remove the redundant, unstructured, and deprecated features of Fortran, such as the EQUIVALENCE statement. F retains the array features added in Fortran 90, and removes control statements that were made obsolete by structured programming constructs added to both FORTRAN 77 and Fortran 90. F is described by its creators as "a compiled, structured, array programming language especially well suited to education and scientific computing". Essential Lahey Fortran 90 (ELF90) was a similar subset.

Lahey and Fujitsu teamed up to create Fortran for the Microsoft .NET Framework. Silverfrost FTN95 is also capable of creating .NET code.

Code examples

The following program demonstrates dynamic memory allocation and array-based operations, two features introduced with Fortran 90. Particularly noteworthy is the absence of DO loops and IF/THEN statements in manipulating the array; mathematical operations are applied to the array as a whole. Also apparent is the use of descriptive variable names and general code formatting that conform with contemporary programming style. This example computes an average over data entered interactively.

<span id="mwCmQ"></span><span class="linenos" data-line="1" id="mwCmU"></span><span class="k" id="mwCmY">program </span><span class="n" id="mwCmc">average</span> <span class="linenos" data-line="2" id="mwCmg"></span> <span class="linenos" data-line="3" id="mwCmk"></span><span class="w" id="mwCmo"> </span><span class="c" id="mwCms">! Read in some numbers and take the average</span> <span class="linenos" data-line="4" id="mwCmw"></span><span class="w" id="mwCm0"> </span><span class="c" id="mwCm4">! As written, if there are no data points, an average of zero is returned</span> <span class="linenos" data-line="5" id="mwCm8"></span><span class="w" id="mwCnA"> </span><span class="c" id="mwCnE">! While this may not be desired behavior, it keeps this example simple</span> <span class="linenos" data-line="6" id="mwCnI"></span> <span class="linenos" data-line="7" id="mwCnM"></span><span class="w" id="mwCnQ"> </span><span class="k" id="mwCnU">implicit none</span> <span class="linenos" data-line="8" id="mwCnY"></span> <span class="linenos" data-line="9" id="mwCnc"></span><span class="k" id="mwCng"> </span><span class="kt" id="mwCnk">real</span><span class="p" id="mwCno">,</span><span class="w" id="mwCns"> </span><span class="k" id="mwCnw">allocatable</span><span class="w" id="mwCn0"> </span><span class="kd" id="mwCn4">::</span><span class="w" id="mwCn8"> </span><span class="n" id="mwCoA">points</span><span class="p" id="mwCoE">(:)</span> <span class="linenos" data-line="10" id="mwCoI"></span><span class="w" id="mwCoM"> </span><span class="kt" id="mwCoQ">integer</span><span class="w" id="mwCoU"> </span><span class="kd" id="mwCoY">::</span><span class="w" id="mwCoc"> </span><span class="n" id="mwCog">number_of_points</span> <span class="linenos" data-line="11" id="mwCok"></span><span class="w" id="mwCoo"> </span><span class="kt" id="mwCos">real</span><span class="w" id="mwCow"> </span><span class="kd" id="mwCo0">::</span><span class="w" id="mwCo4"> </span><span class="n" id="mwCo8">average_points</span><span class="p" id="mwCpA">,</span><span class="w" id="mwCpE"> </span><span class="n" id="mwCpI">positive_average</span><span class="p" id="mwCpM">,</span><span class="w" id="mwCpQ"> </span><span class="n" id="mwCpU">negative_average</span> <span class="linenos" data-line="12" id="mwCpY"></span><span class="w" id="mwCpc"> </span><span class="n" id="mwCpg">average_points</span><span class="w" id="mwCpk"> </span><span class="o" id="mwCpo">=</span><span class="w" id="mwCps"> </span><span class="mf" id="mwCpw">0.</span> <span class="linenos" data-line="13" id="mwCp0"></span><span class="w" id="mwCp4"> </span><span class="n" id="mwCp8">positive_average</span><span class="w" id="mwCqA"> </span><span class="o" id="mwCqE">=</span><span class="w" id="mwCqI"> </span><span class="mf" id="mwCqM">0.</span> <span class="linenos" data-line="14" id="mwCqQ"></span><span class="w" id="mwCqU"> </span><span class="n" id="mwCqY">negative_average</span><span class="w" id="mwCqc"> </span><span class="o" id="mwCqg">=</span><span class="w" id="mwCqk"> </span><span class="mf" id="mwCqo">0.</span> <span class="linenos" data-line="15" id="mwCqs"></span><span class="w" id="mwCqw"> </span><span class="k" id="mwCq0">write</span><span class="w" id="mwCq4"> </span><span class="p" id="mwCq8">(</span><span class="o" id="mwCrA">*</span><span class="p" id="mwCrE">,</span><span class="o" id="mwCrI">*</span><span class="p" id="mwCrM">)</span><span class="w" id="mwCrQ"> </span><span class="s2" id="mwCrU">"Input number of points to average:"</span> <span class="linenos" data-line="16" id="mwCrY"></span><span class="w" id="mwCrc"> </span><span class="k" id="mwCrg">read</span><span class="w" id="mwCrk"> </span><span class="p" id="mwCro">(</span><span class="o" id="mwCrs">*</span><span class="p" id="mwCrw">,</span><span class="o" id="mwCr0">*</span><span class="p" id="mwCr4">)</span><span class="w" id="mwCr8"> </span><span class="n" id="mwCsA">number_of_points</span> <span class="linenos" data-line="17" id="mwCsE"></span> <span class="linenos" data-line="18" id="mwCsI"></span><span class="w" id="mwCsM"> </span><span class="k" id="mwCsQ">allocate</span><span class="w" id="mwCsU"> </span><span class="p" id="mwCsY">(</span><span class="n" id="mwCsc">points</span><span class="p" id="mwCsg">(</span><span class="n" id="mwCsk">number_of_points</span><span class="p" id="mwCso">))</span> <span class="linenos" data-line="19" id="mwCss"></span> <span class="linenos" data-line="20" id="mwCsw"></span><span class="w" id="mwCs0"> </span><span class="k" id="mwCs4">write</span><span class="w" id="mwCs8"> </span><span class="p" id="mwCtA">(</span><span class="o" id="mwCtE">*</span><span class="p" id="mwCtI">,</span><span class="o" id="mwCtM">*</span><span class="p" id="mwCtQ">)</span><span class="w" id="mwCtU"> </span><span class="s2" id="mwCtY">"Enter the points to average:"</span> <span class="linenos" data-line="21" id="mwCtc"></span><span class="w" id="mwCtg"> </span><span class="k" id="mwCtk">read</span><span class="w" id="mwCto"> </span><span class="p" id="mwCts">(</span><span class="o" id="mwCtw">*</span><span class="p" id="mwCt0">,</span><span class="o" id="mwCt4">*</span><span class="p" id="mwCt8">)</span><span class="w" id="mwCuA"> </span><span class="n" id="mwCuE">points</span> <span class="linenos" data-line="22" id="mwCuI"></span> <span class="linenos" data-line="23" id="mwCuM"></span><span class="w" id="mwCuQ"> </span><span class="c" id="mwCuU">! Take the average by summing points and dividing by number_of_points</span> <span class="linenos" data-line="24" id="mwCuY"></span><span class="w" id="mwCuc"> </span><span class="k" id="mwCug">if</span><span class="w" id="mwCuk"> </span><span class="p" id="mwCuo">(</span><span class="n" id="mwCus">number_of_points</span><span class="w" id="mwCuw"> </span><span class="o" id="mwCu0">></span><span class="w" id="mwCu4"> </span><span class="mi" id="mwCu8">0</span><span class="p" id="mwCvA">)</span><span class="w" id="mwCvE"> </span><span class="n" id="mwCvI">average_points</span><span class="w" id="mwCvM"> </span><span class="o" id="mwCvQ">=</span><span class="w" id="mwCvU"> </span><span class="nb" id="mwCvY">sum</span><span class="p" id="mwCvc">(</span><span class="n" id="mwCvg">points</span><span class="p" id="mwCvk">)</span><span class="w" id="mwCvo"> </span><span class="o" id="mwCvs">/</span><span class="w" id="mwCvw"> </span><span class="n" id="mwCv0">number_of_points</span> <span class="linenos" data-line="25" id="mwCv4"></span> <span class="linenos" data-line="26" id="mwCv8"></span><span class="w" id="mwCwA"> </span><span class="c" id="mwCwE">! Now form average over positive and negative points only</span> <span class="linenos" data-line="27" id="mwCwI"></span><span class="w" id="mwCwM"> </span><span class="k" id="mwCwQ">if</span><span class="w" id="mwCwU"> </span><span class="p" id="mwCwY">(</span><span class="nb" id="mwCwc">count</span><span class="p" id="mwCwg">(</span><span class="n" id="mwCwk">points</span><span class="w" id="mwCwo"> </span><span class="o" id="mwCws">></span><span class="w" id="mwCww"> </span><span class="mf" id="mwCw0">0.</span><span class="p" id="mwCw4">)</span><span class="w" id="mwCw8"> </span><span class="o" id="mwCxA">></span><span class="w" id="mwCxE"> </span><span class="mi" id="mwCxI">0</span><span class="p" id="mwCxM">)</span><span class="w" id="mwCxQ"> </span><span class="n" id="mwCxU">positive_average</span><span class="w" id="mwCxY"> </span><span class="o" id="mwCxc">=</span><span class="w" id="mwCxg"> </span><span class="nb" id="mwCxk">sum</span><span class="p" id="mwCxo">(</span><span class="n" id="mwCxs">points</span><span class="p" id="mwCxw">,</span><span class="w" id="mwCx0"> </span><span class="n" id="mwCx4">points</span><span class="w" id="mwCx8"> </span><span class="o" id="mwCyA">></span><span class="w" id="mwCyE"> </span><span class="mf" id="mwCyI">0.</span><span class="p" id="mwCyM">)</span><span class="w" id="mwCyQ"> </span><span class="o" id="mwCyU">/</span><span class="w" id="mwCyY"> </span><span class="nb" id="mwCyc">count</span><span class="p" id="mwCyg">(</span><span class="n" id="mwCyk">points</span><span class="w" id="mwCyo"> </span><span class="o" id="mwCys">></span><span class="w" id="mwCyw"> </span><span class="mf" id="mwCy0">0.</span><span class="p" id="mwCy4">)</span> <span class="linenos" data-line="28" id="mwCy8"></span><span class="w" id="mwCzA"> </span><span class="k" id="mwCzE">if</span><span class="w" id="mwCzI"> </span><span class="p" id="mwCzM">(</span><span class="nb" id="mwCzQ">count</span><span class="p" id="mwCzU">(</span><span class="n" id="mwCzY">points</span><span class="w" id="mwCzc"> </span><span class="o" id="mwCzg"><</span><span class="w" id="mwCzk"> </span><span class="mf" id="mwCzo">0.</span><span class="p" id="mwCzs">)</span><span class="w" id="mwCzw"> </span><span class="o" id="mwCz0">></span><span class="w" id="mwCz4"> </span><span class="mi" id="mwCz8">0</span><span class="p" id="mwC0A">)</span><span class="w" id="mwC0E"> </span><span class="n" id="mwC0I">negative_average</span><span class="w" id="mwC0M"> </span><span class="o" id="mwC0Q">=</span><span class="w" id="mwC0U"> </span><span class="nb" id="mwC0Y">sum</span><span class="p" id="mwC0c">(</span><span class="n" id="mwC0g">points</span><span class="p" id="mwC0k">,</span><span class="w" id="mwC0o"> </span><span class="n" id="mwC0s">points</span><span class="w" id="mwC0w"> </span><span class="o" id="mwC00"><</span><span class="w" id="mwC04"> </span><span class="mf" id="mwC08">0.</span><span class="p" id="mwC1A">)</span><span class="w" id="mwC1E"> </span><span class="o" id="mwC1I">/</span><span class="w" id="mwC1M"> </span><span class="nb" id="mwC1Q">count</span><span class="p" id="mwC1U">(</span><span class="n" id="mwC1Y">points</span><span class="w" id="mwC1c"> </span><span class="o" id="mwC1g"><</span><span class="w" id="mwC1k"> </span><span class="mf" id="mwC1o">0.</span><span class="p" id="mwC1s">)</span> <span class="linenos" data-line="29" id="mwC1w"></span> <span class="linenos" data-line="30" id="mwC10"></span><span class="w" id="mwC14"> </span><span class="c" id="mwC18">! Print result to terminal stdout unit 6</span> <span class="linenos" data-line="31" id="mwC2A"></span><span class="w" id="mwC2E"> </span><span class="k" id="mwC2I">write</span><span class="w" id="mwC2M"> </span><span class="p" id="mwC2Q">(</span><span class="o" id="mwC2U">*</span><span class="p" id="mwC2Y">,</span><span class="s1" id="mwC2c">'(a,g12.4)'</span><span class="p" id="mwC2g">)</span><span class="w" id="mwC2k"> </span><span class="s1" id="mwC2o">'Average = '</span><span class="p" id="mwC2s">,</span><span class="w" id="mwC2w"> </span><span class="n" id="mwC20">average_points</span> <span class="linenos" data-line="32" id="mwC24"></span><span class="w" id="mwC28"> </span><span class="k" id="mwC3A">write</span><span class="w" id="mwC3E"> </span><span class="p" id="mwC3I">(</span><span class="o" id="mwC3M">*</span><span class="p" id="mwC3Q">,</span><span class="s1" id="mwC3U">'(a,g12.4)'</span><span class="p" id="mwC3Y">)</span><span class="w" id="mwC3c"> </span><span class="s1" id="mwC3g">'Average of positive points = '</span><span class="p" id="mwC3k">,</span><span class="w" id="mwC3o"> </span><span class="n" id="mwC3s">positive_average</span> <span class="linenos" data-line="33" id="mwC3w"></span><span class="w" id="mwC30"> </span><span class="k" id="mwC34">write</span><span class="w" id="mwC38"> </span><span class="p" id="mwC4A">(</span><span class="o" id="mwC4E">*</span><span class="p" id="mwC4I">,</span><span class="s1" id="mwC4M">'(a,g12.4)'</span><span class="p" id="mwC4Q">)</span><span class="w" id="mwC4U"> </span><span class="s1" id="mwC4Y">'Average of negative points = '</span><span class="p" id="mwC4c">,</span><span class="w" id="mwC4g"> </span><span class="n" id="mwC4k">negative_average</span> <span class="linenos" data-line="34" id="mwC4o"></span><span class="w" id="mwC4s"> </span><span class="k" id="mwC4w">deallocate</span><span class="w" id="mwC40"> </span><span class="p" id="mwC44">(</span><span class="n" id="mwC48">points</span><span class="p" id="mwC5A">)</span><span class="w" id="mwC5E"> </span><span class="c" id="mwC5I">! free memory</span> <span class="linenos" data-line="35" id="mwC5M"></span> <span class="linenos" data-line="36" id="mwC5Q"></span><span class="k" id="mwC5U">end program </span><span class="n" id="mwC5Y">average</span>

Humor

During the same FORTRAN standards committee meeting at which the name "FORTRAN 77" was chosen, a satirical technical proposal was incorporated into the official distribution bearing the title "Letter O Considered Harmful". This proposal purported to address the confusion that sometimes arises between the letter "O" and the numeral zero, by eliminating the letter from allowable variable names. However, the method proposed was to eliminate the letter from the character set entirely (thereby retaining 48 as the number of lexical characters, which the colon had increased to 49). This was considered beneficial in that it would promote structured programming, by making it impossible to use the notorious GO TO statement as before. (Troublesome FORMAT statements would also be eliminated.) It was noted that this "might invalidate some existing programs" but that most of these "probably were non-conforming, anyway".

When X3J3 debated whether the minimum trip count for a DO loop should be zero or one in Fortran 77, Loren Meissner suggested a minimum trip count of two—reasoning (tongue-in-cheek) that if it were less than two, then there would be no reason for a loop.

When assumed-length arrays were being added, there was a dispute as to the appropriate character to separate upper and lower bounds. In a comment examining these arguments, Walt Brainerd penned an article entitled "Astronomy vs. Gastroenterology" because some proponents had suggested using the star or asterisk ("*"), while others favored the colon (":").

Variable names beginning with the letters I–N have a default type of integer, while variables starting with any other letters defaulted to real, although programmers could override the defaults with an explicit declaration. This led to the joke: "In FORTRAN, GOD is REAL (unless declared INTEGER)."

The American Mathematical Monthly (November, 1978) printed a one-line review in verse: "A lively approach to seduce,/In manner quite sim'lar to Seuss./Handwritten, with drawings and lots of guffawings/Disposed to make Fortran transluce."