e would have some idea
> of what was happening, because that's how state changes are
> supposed to be expressed in Haskell, and anything else
> counts as obfuscation.
>
> But THE ACTUAL CODE might show that this case was different
> in some important way.
>
>
>
> __
IsString, like we do for Num,
> given it's special syntactic association with OverloadedStrings?
>
> -- Johan
>
> ___
> Glasgow-haskell-users mailing list
> glasgow-haskell-us...@haskell.org
> http://www.haskell.org/mailman/listinfo/g
is documented or somewhere I
> can contribute documentation?
>
> On Sun, Apr 22, 2012 at 4:47 AM, Markus Läll wrote:
>> ExtendedDefaultRules
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
see defaulting capability is available for Num. Is there any way to
>>>> do this for IsString?
>>>>
>>>> Thanks,
>>>> Greg Weber
>>>>
>>>> ___
>>>> Glasgow-haskell-users mailing list
>>>> glasgow-haskell-us...@haskell.org
>>>> http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
>>>
>>>
>
> ___
> Glasgow-haskell-users mailing list
> glasgow-haskell-us...@haskell.org
> http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
_____
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
t give me a nil of type [Int] and an app of type [Int] ->
> [Int] -> [Int].
>
> Does anyone know whether Haskell allows me to do this in a better way?
>
> Best,
>
> Robbert
>
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http:
ly the opposite of what the OP wants, however it's
> interesting that Text has a function like that and not the String
> functions in the standard
> library.
>
> -- Anupam
>
> ___
> Haskell-Cafe mailing list
&g
= x1
>>type Result (x1 -> a, x2 -> b) = (a, b)
>>tuple (f, g) x = (f x, g x)
>
> That's it, that's what I was after. Thanks.
>
>
> _______
> Haskell-Cafe mailing list
> Haskell-Cafe@hask
another environment)
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
defining the X... Is it at all
possible, or is a newtype the only way to do it?
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
; ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
This could be a nice feature and not hard to implement, maybe someone could
take it up?
2011/4/7 José Pedro Magalhães
> Yes, I have that tarball. I just don't know how to tell cabal-install to
> use it. Going to each package, individually unpacking and installing it is
> what I've been doing so
Check out "unlines"!
On Sat, Apr 2, 2011 at 4:32 PM, Manfred Lotz wrote:
> Hi there,
> I have a list of say type Record which I write to a file and
> read back from the file if required.
>
> The list's content is a single line in the file it doesn't matter how
> many records the list contains.
er,Integer) -> (Integer,Integer) -> Bool
(a,b) `lt` (c,d) = let
sum1 = (a + b)
sum2 = (c + d)
in if sum1 == sum2
then a < c
else sum1 < sum2
Implementing fromEnum looks like a bit harder problem..
--
Markus Läll
On Fri, Mar 4, 2011 at 5
I have been using Notepad++ -- it has proper (I think) syntaks highlighting
and in the latest version now has line wrapping a la kate: broken lines
start at the indent level of the first one.
--
Markus Läll
On Fri, Mar 4, 2011 at 1:14 AM, Daniel Fischer <
daniel.is.fisc...@googlemail.com>
nitions should be exactly the same. And the breakage can only happen
because of using unsafePerformIO, which allowes you to go out in the IO
world and get stuff, but bypass the order of evaluation that IO monad forces
you to otherwise have.
Someone correct me if I'm wrong :)
--
Markus Läll
st == that
all the apropriate functions exist.
And it is correct only that far -- the value-level coding is still up to
you, so no mind-reading...
--
Markus Läll
On Fri, Feb 11, 2011 at 1:16 PM, Ivan Lazar Miljenovic <
ivan.miljeno...@gmail.com> wrote:
> On 11 February 2011 22:06, C K Kas
cific feature
or extension, like scoped type variables, type families/functional
dependencies, or even just typeclasses... (Remember, there was a deep list
concatenation problem thread some days ago.)
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
function in another module and
import qualified, or
- write a typeclass with a 'name' function and fit the non-accessor
function 'name' somehow into that...
I think the best approach is the modular one, but this really depends on
what you are doing.
--
Markus Läll
On Thu, Dec
the central? I mean -- if we don't trust DNS,
then the main hackage has no special security advantages?
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Dec 9, 2010 at 11:04 PM, Richard O'Keefe wrote:
>
> On 10/12/2010, at 12:18 AM, Markus Läll wrote:
>
> > My take on the issue is that we should make it possible to easily mirror
> hackage (what the OP asked for), so that people could use it when they
> wanted
many of us are just playing around and developing
things for themselves.
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
rs by Alexey Khudyakov (which does type-level binary
encoding(!) for natural numbers)
As for the terminology, I can't tell..
Out of intrest, is this kind of type-level stuff to prove things about
your container types and operations on them?
--
Markus Läll
On Mon, Oct 25, 2010 at 12:52 PM, Patr
Hi Michael,
although I never used it myself, lists seem strange in the way that when
combining list monads, then all the values go through the chain one by one
-- x will be 1 first, then 2, then 3 and so on.. Try it out, to see. (I
think the result is then also a list of all combinations of result
Yep, the test is done by a rookie. If I get more time, I'll try to
look into testing a little more, and redo the timing (if anyone
doesn't do it firs) -- using optimizations, more runs per function and
the criterion package.
___
Haskell-Cafe mailing list
ern10 (a:_:c:_:e:_: rest)= a:c:e:rest
matchPattern10 (a:_:c:_:rest) = a:c:rest
matchPattern10 (a:_:rest) = a:rest
matchPattern10 (rest) = rest
On Wed, Jun 9, 2010 at 11:47 PM, Markus
besides -O2 ;-) -- I remembered it too late and didn't
want to restart... At least for the last two functions it showed a
similar difference in seconds as with no -O2)
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.or
I would be intrested in seeing this! Could you paste or upload it somewhere?
2010/5/24 C. McCann :
> 2010/5/23 Günther Schmidt :
>> is there anybody currently using Haskell to construct or implement a query
>> language?
>
> I've a half-baked, type-indexed (in HList style) implementation of
> rela
29 matches
Mail list logo