Category:Fortran
This programming language may be used to instruct a computer to perform a task.
Garbage collected: | No |
---|---|
Type safety: | Safe |
Type strength: | Strong |
Type compatibility: | Nominative |
Type checking: | Static |
See Also: |
|
Fortran is the oldest programming language still in widespread use. It was given substantial rework in the Fortran 90 standard. By convention, versions before Fortran 90 are spelled with all uppercase letters (e.g. FORTRAN 66, FORTRAN 77), while starting with Fortran 90, the mixed case spelling is used (i.e. Fortran 90, Fortran 95 etc.).
FORTRAN 77, being quite old, lacks almost everything one expects from a modern programming language. It uses a fixed-length line and column oriented line format which was motivated by punch cards. Due to its age, and since FORTRAN compilers generally gave very good performance for numerical code, a lot of code, especially scientific code, was written in FORTRAN. Also, for quite a while there was no free Fortran 90 compiler, which also caused a lot of FORTRAN 77 code to be written even quite some time after Fortran 90 was standardized. Because of the big body of code written in FORTRAN 77 it's still relevant. Indeed, every Fortran compiler still has to accept the old format.
Fortran 90 was a major step in the development of Fortran. It introduced a new free-form source code format, modern programming language features like modules, pointers and user-defined types, an improved type system for built-in types and superiour built-in array handling.
Newer Fortran standards added further modern features, like support for object oriented programming.
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- Fortran examples needing attention (empty)
- Fortran Implementations (3 P)
- Fortran User (98 P)
Pages in category "Fortran"
The following 52 pages are in this category, out of 652 total.
(previous page) (next page)T
- Text processing/Max licenses in use
- The sieve of Sundaram
- The Twelve Days of Christmas
- Thue-Morse
- Tic-tac-toe
- Time a function
- Tokenize a string
- Tokenize a string with escaping
- Top rank per group
- Topological sort
- Topswops
- Towers of Hanoi
- Trabb Pardo–Knuth algorithm
- Tree traversal
- Trigonometric functions
- Truncatable primes
- Truncate a file
- Two identical strings
- Two sum
- Type detection