Mike D wrote: > Note that types can help. Eg. on http://www.haskell.org/hoogle/ you would > search for something like "[a] -> (a, [a])". That is, you would be > searching by semantics and not by syntax.
Raul responded: > Well, except that static types are syntactic types and allow arbitrary > implementation. So the analogy in J to searching for types in statically-typed languages would be to search for sequences of words? As in, just as you could search as Haskell codebase for functions of type "int" (primitive) or "int -> (int, [char])" (compound) or "data Suit = "Club | Diamond | Heart | Spade" (named) or whatever, you could search a J codebase for functions like "+" (primitive) or "+/@%" (compound) or "avg =: +/ % #" (named) or whatever? Is that what you mean by drawing an equivalence between "static type searching" and "syntactic searching"? -Dan ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
