[Jprogramming] @: and capped fork (and puzzles)

[Jose Mario Quintana]

To Linda,

   2.5 (>. % [: <. + * -) 4
_0.4
   2.5 (>. % <. @: + * -) 4
_0.444444444
   2.5 (>. % <. @: (+ * -)) 4
_0.4
   2.5 (>. % [ <.@] + * -) 4
_0.4

NB. This is the example given in the Dictionary’s entry for Cap.


To Dan,

I am glad that somebody is having fun.  These are very good questions
and the necessary clarifications give away some clues:

- re (Ca f p g) vs ([: f g) :   the equivalence fails because the
execution of sentences involving (Ca f p g) break down when applied to
(meaningful) identical arguments.

- re the interpreter "preferring" @: to [: in certain cases: actually,
the puzzle was to find “instances where the interpreter even favors
atop (@) over ([:)” but there are also instances where the interpreter
favors (@:) over ([:)  and, yes, this preferences are demonstrated in
other contexts not involving (13 :)  (I could not help to leave behind
a red herring behind, hence:  “(This is a tricky puzzle thought)”).
:)

By the way, there is a bonus puzzle within the solutions.