Hello Everyone,
I am currently recruiting a Functional Programming Developer for one of the
bank in Singapore. Anyone interested please contact me at +65-83991283 or
please drop a note to me at manimaran_eluma...@kellyit.com.sgwith your contact
details.
Below are some skills my client is
Matthew Steele asked why foo type-checks and bar doesn't:
class FooClass a where ...
foo :: (forall a. (FooClass a) = a - Int) - Bool
foo fn = ...
newtype IntFn a = IntFn (a - Int)
bar :: (forall a. (FooClass a) = IntFn a) - Bool
bar (IntFn fn) = foo fn
This and further
Hello.
I think I have an explanation for the problem with regex-pcre, ghc-7.4.2
and UTF Strings.
The Text.Regex.PCRE.String module uses the withCString and
withCStringLen from the module Foreign.C.String to pass a Haskell string
to the C library pcre functions that compile regular expressions,
{-I am trying to apply model theoretic concepts to Haskell by considering type classes as theories and instances as models.Then the declaration of a sub-class specifies a signature morphism from the superclass to the subclass.In case below the theories (classes) are signature only (no default
On Thu, Aug 23, 2012 at 01:25:39PM +0100, Patrick Browne wrote:
If there is no model expansion could it be because of the constructor
discipline, which only allows variables, and constructors in the LHS
argument patterns.
Indeed, a variable name as a pattern on the LHS of a function
Not in 7.4.2, correct?
--
dude
On 08/22/2012 09:58 AM, Brent Yorgey wrote:
I believe in the paper it is actually a lowercase Greek chi (χ), which
should work too. ;)
-Brent
On Wed, Aug 22, 2012 at 08:15:48AM +0200, José Pedro Magalhães wrote:
Nope, but it should work on 7.6 (also on the
We are pleased to announce a new release of basic-prelude.
http://hackage.haskell.org/package/basic-prelude-0.3.0.0
We apparently weren't entirely clear about
the original purpose of basic-prelude,
and we got repeated feedback of the form
where are the list functions?
Somewhat in response to
Dear Haskell Cafe
I'm looking for information on past and current attempts to write semantics
for Haskell.
Features I'm particularly interested in are:
- formal
- mechanised
- maintainable
- up to date
Of course, if nothing like that exists then partial attempts towards it
could
On 23/08/12, Brent Yorgey byor...@seas.upenn.edu wrote:fun1 returns 8 for all inputs. The fact that fun1's definition usesthe name 'constant' which happens to have the same name as somethingin scope is irrelevant. For example, this is precisely the same as the above:constant :: Intconstant =
On Thu, Aug 23, 2012 at 08:59:52AM -0300, José Romildo Malaquias wrote:
Hello.
I think I have an explanation for the problem with regex-pcre, ghc-7.4.2
and UTF Strings.
The Text.Regex.PCRE.String module uses the withCString and
withCStringLen from the module Foreign.C.String to pass a
Hello everyone.
I just posted about a fact that happens to everyone who codes in Java
while learning Haskell.
You end up trading knowledge from both sides.
I'll appreciate if you could read and send me feedbacks:
http://me-hunz.blogspot.com.br/2012/08/bringing-knowledge-from-haskell-to-java.html
On 8/22/12 9:18 AM, Leon Smith wrote:
I think we actually agree more than we disagree; I do think distinguishing
hard and soft upper bounds (no matter what they are called) would help,
and I'm just trying to justify them to some of the more dismissive
attitudes towards the idea
Hopefully.
On 8/22/12 12:35 PM, David Menendez wrote:
As I see it, there are four possibilities for a given version of dependency:
1. The version DOES work. The author (or some delegate) has compiled
the package against this version and the resulting code is considered
good.
2. The version SHOULD work. No
On 8/22/12 5:23 PM, Matthew Steele wrote:
So my next question is: why does unpacking the newtype via pattern matching
suddenly limit it to a single monomorphic type?
Some Haskell code:
foo :: (forall a. a - Int) - Bool
foo fn = ...
newtype IntFn a = IntFn (a - Int)
bar1 ::
On 8/23/12 1:02 PM, Patrick Browne wrote:
I am just not sure whether there is a model expansion from the super-class model
to the subclass model.
If by model expansion from... you mean that there is a
canonical/unique/special mapping from every superclass model to some
subclass model, then
From page 3 of
http://research.microsoft.com/en-us/um/people/emeijer/Papers/meijer94more.pdf
:
it is not true in general that catamorphisms are closed under composition
When is this true?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I agree that the behavior is a bit confusing (Dan Burton just filed an
issue about this[1], I'm guessing this email is related).
I put up a wiki page[2] to hopefully explain the issue. Can you review
it and let me know if it helps? If so, I'll link to it from the
Haddocks.
Michael
[1]
17 matches
Mail list logo
