Quantum entanglement is related to a different kind of categorical
product. So, the metaphor is misleading.
But, that being said : I want to thank you for your blog. A bit
polemic but very interesting.
Christophe.
Came up with an alternative to the container metaphor for functors
that you
Roman,
The text monad is very low level and its functions are mapping
directly to the PDF text environment commands.
text function is generating two PDF commands : Td and Tj. In Adobe
PDF spec :
Td : Move to the start of the next line, offset from the start of the
current line by (tx ,
I have defined a function on types thanks to functional dependencies.
I use it like that:
myFunction :: (TypeFunction MyComplexType f) = f - f
f is unique for MyComplexType. Is there a way to name f ?
I would like to write:
myFunction :: SimplifiedType - SimplifiedType
where
TypeFunction
Can someone confirm me that:
type TA = A :+: B
type TB = C :+: D
type T = TA :+: TB
is not equivalent to
type T = A :+: B :+: C :+: D
where I have defined
infixr 6 :+:
data (f :+: g)
data A
data B
data C
data D
I have a computation at type level which is working with the later
definition
I am pleased to release the version 1.0 of my PDF library that you
can find on hackage:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HPDF-1.0
This email is mainly an opportunity for me to thanks apfelmus who, a
very very long time ago when I released HPDF for the first time,
Since it is not really Haskell related, I have answered by email. If
anyone is interested, don't hesitate to email me.
alpheccar.
This isn't really a Haskell question but I'm guessing some Haskell
hackers have a solution. MacOS X's Spotlight doesn't seem to be able
to search for text in .lhs
summarized the problems I faced when I was a newbie learning
Haskell : http://www.alpheccar.org/en/posts/show/67
Some people told me it was useful. It is a summary of how imperative
programmers should change their state of mind to understand the
Haskell way.
alpheccar.
There are lots
