Its name cames from a slogan: <strong>F</strong>unctional = <strong>I</strong>mperative + <strong>Sh</strong>ape.

From <em>Introducion</em> (see below):
<blockquote>
FISh is a new array (*(collection-oriented)) *(programming language) that combines (and extends) the expressive power of *(functional) programming with the efficient execution of *(imperative), or procedural, programming by performing <strong>static shape analysis</strong>. [..]
</blockquote>

<ul class="links">
  <li>_("The FISh homepage"|http://www-staff.it.uts.edu.au/~cbj/FISh/).</li>
  <li>_("Introducion"|http://www-staff.it.uts.edu.au/~cbj/FISh/Announcement/).</li>
  <li>_("Direct Comparison with C"|http://www-staff.it.uts.edu.au/~cbj/FISh/Benchmarks/compare_to_C.html):
    <blockquote>
      [..] When polymorphic programs are used, then FISh is actually faster than _(C|C Language)! [..] The probable source of the difference is that the C comparisons use pointers whereas the FISh comparisons do not, i.e. FISh arrays, even nested arrays, are always unboxed. [..]</li>
    </blockquote>
  <li>_("Barry Jay's homepage"|http://www-staff.it.uts.edu.au/~cbj/index.html), the author.</li>
</ul>
