Anonymous recursion: Difference between revisions
Content added Content deleted
mNo edit summary |
|||
| Line 799: | Line 799: | ||
=={{header|Fōrmulæ}}== |
=={{header|Fōrmulæ}}== |
||
<blockquote style="background-color: lightgrey; border: solid thin grey;"><span style="font-size:80%"> |
|||
Fōrmulæ programs are not textual, visualization/edition of programs is done showing/manipulating structures but not text. Moreover, there can be multiple visual representations of the same program. Even though it is possible to have textual representation —i.e. XML, JSON— they are intended for transportation effects more than visualization and edition. |
Fōrmulæ programs are not textual, visualization/edition of programs is done showing/manipulating structures but not text. Moreover, there can be multiple visual representations of the same program. Even though it is possible to have textual representation —i.e. XML, JSON— they are intended for transportation effects more than visualization and edition. |
||
| Line 805: | Line 804: | ||
In [http://dictionary.formulae.org/Anonymous_recursion this] page you can see the solution of this task. |
In [http://dictionary.formulae.org/Anonymous_recursion this] page you can see the solution of this task. |
||
</span> |
|||
</blockquote> |
|||
=={{header|Forth}}== |
=={{header|Forth}}== |
||