User Portlet
| Discussions |
|---|
| Seeking a means to have a persistent cloud based storage for structured data, I stumbled upon [CloudExpressions][1], but, trying to update in place a cloud expression holding an association using iterated [AssociateTo][2] calls, I found it rather... |
| Dear Wolframers, regarding the problem of Quantified Boolean Formula satisfiability checking, how are the capabilities of the Wolfram Language best harnessed ? On the one hand, we have Resolve that performs quantifier elimination, for example : ... |
| In functional languages, such as Haskell, where list is a recursive datatype of the form List[x] -> EmptyList[x] | x:List[x], structural induction over a list may be expressed with pattern matching like so : foldr f z [] = z foldr f... |
| Do we have an easy way, without having recourse to join or flatten, of generating flat lists in the Wolfram Programming Language, akin to the list comprehension construct available in other functional programming languages ? For example in... |
| Given a symbol F used in function definitions like so : F[x_,y_,z_] := ... ; F[x_,y_] := ... ; F[x_] := ... ; F := ... Is it possible to introspect the system and get the various arities of that function symbol, something like : ... |
| Dear Wolframers, do you know if there is some efficient way to test that the only entries in a sparse array are set to the default element, without having recourse to the conversion of the sparse array into a list of array rules like so : ... |
| Dear Wolframers, I am looking for some builtin transpose-like function such that : TransposeLike[f[g[x11,x12,...x2n],g[x21,x22,...,x2n],...,g[xm1,xm2,...,xmn]] = g[f[x11,x21,...xm1],f[x12,x22,...,xm2],...,f[x1n,x2n,...,xmn]] ie not... |