[Jprogramming] Function programming

Ralph G Selfridge selfrid at cns.ufl.edu
Thu Mar 1 09:25:33 HKT 2007


In the argument about tacit or explicit I offer the following verb, comes 
from a Black-Scholes algorithm. Lets assume we have the verb cndn. I won't 
claim I can't make this tacit, I will claim it won't be easy and or 
readable and far more work than I think its worth. And I doubt it will run 
any faster.

bsn=: 3 : 0
's x t r v'=.y
|(s,x*^-r*t)-/ .*cndn 1 _1*/~((^.s%x)+t*r(+,-)-:*:v)%v*%:t
)

R.S.

>From rauldmiller at gmail.com Tue Feb 27 20:27:42 2007
Date: Tue, 27 Feb 2007 20:27:27 -0500
From: Raul Miller <rauldmiller at gmail.com>

On 2/27/07, Ralph G Selfridge <selfrid at cns.ufl.edu> wrote:
> One possible example is a verb which needs several nouns. Yes I can make it
> tacit but I must then extract the noun from the argument in several places.
> Not worth it from my prespective.

You mean like this?

explicit=:verb define
  a, b, c
)

var=: ". bind
tacit=: 'a'var, 'b'var, 'c'var

-- 
Raul
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm


More information about the Programming mailing list