Posts Tagged ‘ curry ’

HOFs, closures, partial application and currying to solve the function environment problem in Scala

November 16, 2015
By
HOFs, closures, partial application and currying to solve the function environment problem in Scala

Introduction Functional programming (FP) is a programming style that emphasises the use of referentially transparent pure functions and immutable data structures. Higher order functions (HOFs) tend to be used extensively to enable a clean functional programming style. A HOF is just a function that either takes a function as an argument or returns a function. … Continue reading HOFs, closures, partial application and currying to solve the function environment problem…

Read more »

checking for finite variance of importance samplers

June 10, 2014
By
checking for finite variance of importance samplers

Over a welcomed curry yesterday night in Edinburgh I read this 2008 paper by Koopman, Shephard and Creal, testing the assumptions behind importance sampling, which purpose is to check on-line for (in)finite variance in an importance sampler, based on the empirical distribution of the importance weights. To this goal, the authors use the upper tail  […]

Read more »


Subscribe

Email:

  Subscribe