One very nice example of a "higher-order" algorithm is the notion of region
(i.e. Point -> Bool) defined in Hudak's paper, that is using functions as
data structures...
http://delivery.acm.org/10.1145/25/242477/a196-hudak.html?key1=242477&key2=4611513821&coll=GUIDE&dl=GUIDE&CFID=99830619&CFTOK
On 8/24/10 11:10 AM, Daniel Peebles wrote:
Interesting. I've come across this general idea/algorithm the factor graph /
sum-product algorithm papers[1] but I was wondering if you knew of any
implementations of it in haskell? I wrote one a while back but it was fairly
ugly and not as general as I'
Automatic differentiation can also bee seen this way. In a sense it
transforms a function to compute f(x) into a function to compute
f'(x), where f' is the derivative of f.
--
Dan
On Mon, Aug 23, 2010 at 6:03 AM, Eugene Kirpichov wrote:
> Most of the well-known algorithms are first-order, in the
Interesting. I've come across this general idea/algorithm the factor graph /
sum-product algorithm papers[1] but I was wondering if you knew of any
implementations of it in haskell? I wrote one a while back but it was fairly
ugly and not as general as I'd have liked, so I never released it.
Thanks
On Mon, Aug 23, 2010 at 6:10 PM, Max Rabkin wrote:
> (Accidentally sent off-list, resending)
>
> On Mon, Aug 23, 2010 at 15:03, Eugene Kirpichov
> wrote:
> > * Difference lists
>
> > I mean that not only higher-order facilities are used, but the essence
> > of the algorithm is some non-trivial h
On 8/24/10 12:29 AM, wren ng thornton wrote:
All of these are the same algorithm, just with different (augmented)
semirings. In order to prevent underflow for very small probabilities,
we usually run these algorithms with probabilities in the log-domain.
Those variants are also the same algorithm
On 23 August 2010 14:03, Eugene Kirpichov wrote:
> Do there exist other nontrivial higher-order algorithms and datastructures?
> Is the field of higher-order algorithms indeed as unexplored as it seems?
Aren't higher order algorithms "functional pearls"? :-)
You might find Olivier Danvy and Mic
Eugene Kirpichov wrote:
Do there exist other nontrivial higher-order algorithms and datastructures?
Is the field of higher-order algorithms indeed as unexplored as it seems?
Many algorithms in natural language processing can be captured by
higher-order algorithms parameterized by the choice of
2010/8/23 Eugene Kirpichov :
> For example, parser combinators are not so interesting: they are a
> bunch of relatively orthogonal (by their purpose) combinators, each of
> which is by itself quite trivial, plus not-quite-higher-order
> backtracking at the core.
This is only if you're not quite co
2010/8/23 Eugene Kirpichov :
> [snip]
> Do there exist other nontrivial higher-order algorithms and datastructures?
> Is the field of higher-order algorithms indeed as unexplored as it seems?
> [snip]
Hi,
I'm thinking to some HOAS (higher order abstract syntax) representation.
Cheers,
Thu
_
10 matches
Mail list logo
