Hello Dinh,
Friday, July 08, 2005, 9:12:22 PM, you wrote:
DTTA Another question, it's said in the book that using cyclic structure
(like
DTTA ones = 1:ones) , the list would be represented by a fixed amount of
memory.
DTTA Does it mean [1,1,1..] only occupy one cell of memory ?
DTTA
Hello Tomasz,
This stuff is very interesting! At first sight, your definition of
getCC seems quite odd, but it can in fact be derived from its
implementation in an untyped language.
On 7/7/05, Tomasz Zielonka [EMAIL PROTECTED] wrote:
Some time ago I wanted to return the escape continuation out
Keean Schupke wrote:
So the linear operator is translation (ie: + v)... effectively 'plus'
could be viewed as a function which takes a vector and returns a matrix
(operator)
(+) :: Vector - Matrix
Since a matrix _is_ not a linear map but only its representation, this
would
On Thu, Jul 07, 2005 at 06:02:36PM -0700, [EMAIL PROTECTED] wrote:
Delimited continuations are really cool.
Thanks for the pointer. I am reading the paper by Dybvig, Jones and
Sabry right now.
Best regards
Tomasz
___
Haskell-Cafe mailing list
