Tacit programming: Difference between revisions

Revision as of 07:47, 11 August 2020

Revision as of 07:48, 11 August 2020

Line 68:

= \x -> ((.) f) (g x)

= \x -> (((.) f) . g) x

= ((.) f) . g

</syntaxhighlight>

so

<syntaxhighlight lang="haskell">

p = ((.) f) . g

</syntaxhighlight>

Line 113 ⟶ 109:

In [[stack-oriented programming language]]s (and [[concatenative programming language|concatenative ones]], most of which are stack based{{cn|date=January 2020}}), point-free methods are commonly used. For example, a procedure to compute the [[Fibonacci number]]s might look like the following in [[PostScript]]:

<syntaxhighlight lang="postscript">

/fib

{

dup dup 1 eq exch 0 eq or not

{

dup 1 sub fib

exch 2 sub fib

add

} if

} def

</syntaxhighlight>