Re: [Haskell-cafe] Proposal: Non-recursive let

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. > > > > __

Re: [Haskell-cafe] default instance for IsString

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

Re: [Haskell-cafe] default instance for IsString

class-extensions.html#overloaded-strings On Sun, Apr 22, 2012 at 4:54 PM, Greg Weber wrote: > Thanks Markus, I think you have saved the day! > Even after googling for this extension and searching in the manual I > am still coming up pretty blank. > Is there somewhere I missed where this

Re: [Haskell-cafe] default instance for IsString

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

Re: [Haskell-cafe] [haskell-cafe] Some reflections on Haskell

_____ > 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

Re: [Haskell-cafe] Type class for sequences with dependent types

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:

Re: [Haskell-cafe] How to split this string.

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

Re: [Haskell-cafe] Tupling functions

= 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

Re: [Haskell-cafe] ANN: fix-imports-0.1.2

another environment) -- Markus Läll ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Arrow instance of function type [a] -> [b]

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

Re: [Haskell-cafe] The Lisp Curse

> ___ > 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

Re: [Haskell-cafe] Reverse Show instance

; ___ > 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

Re: [Haskell-cafe] Local copy of hackageDB

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

Re: [Haskell-cafe] [Haskell-beginners] how to modify show for a list of certain types

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.

Re: [Haskell-cafe] Learn You a Haskell for Great Good - a few doubts

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

Re: [Haskell-cafe] Learn You a Haskell for Great Good - a few doubts

What about having the order by diagonals, like: 0 1 3 2 4 5 and have none of the pair be bounded? -- Markus Läll On 4 Mar 2011, at 01:10, Daniel Fischer > wrote: On Thursday 03 March 2011 23:25:48, Alexander Solla wrote: On Thu, Mar 3, 2011 at 1:58 PM, Richard O'Keefe wrote:

Re: [Haskell-cafe] Haskell IDE

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>

Re: [Haskell-cafe] Fwd: ANN: vector-buffer package 0.1

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

Re: [Haskell-cafe] Proving correctness

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

Re: [Haskell-cafe] How about Haskell Golf just like vimgolf.com

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

[Haskell-cafe] Happstack related problem with templates/class methods

Hi! I'am trying to express a happstack component like the simplified one here: https://gist.github.com/763597 What exactly is the problem for the compiler? Is there a better way to describe such a "abstract" or parametrized component? Regards alios _

Re: [Haskell-cafe] "record" types and unique names

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

Re: [Haskell-cafe] Offer to mirror Hackage

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

Re: [Haskell-cafe] Offer to mirror Hackage

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

Re: [Haskell-cafe] Offer to mirror Hackage

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

Re: [Haskell-cafe] type level program

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

[Haskell-cafe] GADT and problems with rigid type variables

gid type variable bound by the constructor `Foo' at /home/alios/src/lab/Scratch.hs:7:14 In the second argument of `(==)', namely `b' In the expression: a == b In the definition of `==': (Foo a) == (Foo b) = a == b

Re: [Haskell-cafe] What is <-

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

[Haskell-cafe] Functional programming techniques in small projects

rogramming techniques). Since I am at the very start, I would appreciate further literature advices. In addition, does anybody know particular people who are familiar with this topic? Any answer is appreciated :-) Regards, Markus ___ Haskell-Cafe mailing li

Re: [Haskell-cafe] Removing alternate items from a list

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

Re: [Haskell-cafe] Removing alternate items from a 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

Re: [Haskell-cafe] Removing alternate items from a list

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

Re: [Haskell-cafe] Haskell, Queries and Monad Comprehension

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

AW: [Haskell-cafe] Haskell overview

and for some days now Markus Schnell > -Ursprüngliche Nachricht- > Von: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] Im Auftrag von Gour > Gesendet: Freitag, 12. März 2004 14:53 > An: [EMAIL PROTECTED] > Betreff: Re: [Haskell-cafe] Haskell overview > >

AW: GHC and Panther (Mac OS X 10.3)

try using (sudo) gcc-select 2 Cheers, Markus > -Ursprüngliche Nachricht- > Von: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] Im Auftrag von Thomas Davie > Gesendet: Donnerstag, 20. November 2003 02:07 > An: [EMAIL PROTECTED] > Betreff: GHC and Panther (Mac OS

Graphical Programming Environments (was: ANNOUNCE: Release of Vit al, an interactive visual programming environment for Haskell)

ith 'code of no interest'. I agree that putting together programs just by click and point would be tedious. But _viewing_ programs this way could be advantagous. What do you think? Best wishes, Markus ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

AW: AW: Heap profiling in GHC broken?

ctional Programming, pages 159-183, Olympia, WA, > August 1996. Springer LNCS Vol. 1129. Great! I knew only the more compiler-oriented Runciman/Röjemo papers. (Which were already helpful, but not very 'tutorial'.) Thanks, Markus ___ Has

AW: Heap profiling in GHC broken?

barely mentioned in the Haskell books/tutorials, but they are a real burden if you want to run programs for larger problems. A tutorial on this by one of the experts would be very welcome. :-) Thanks, Markus > -Ursprüngliche Nachricht- > Von: [EMAIL PROTECTED] > [mailto:[EMAIL

Heap profiling in GHC broken?

g the equivalent of "statement in '0x0058db43' points to memory in '0xfffc'. Could not read.") Cheers, Markus -- Markus Schnell ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

AW: Using existential types

Hi Graham, > Instead, I replace the class instances by a single algebraic > data type, > whose members are functions corresponding to OO-style class methods. could you give an example? Thanks, Markus ___ Haskell-Cafe mailing list [EMAIL

AW: Newbie qustion about monads

intended to cover a monad. But it doesn't ensure the laws. That is your sole responsibility. > > what is intended in that "=="? Eq."==" for You can define it to your liking as long as it is commutative. HTH, Markus ___ H

AW: Poll: How to respond to homework questions

most that way" is a very good idea. Markus -- Markus Schnell > -Ursprüngliche Nachricht- > Von: Tom Pledger [mailto:[EMAIL PROTECTED] > Gesendet: Mittwoch, 27. August 2003 23:43 > An: [EMAIL PROTECTED] > Betreff: Poll: How to respond to homework questions > >

Re: Debugging

gram and tests in parallel. Make your code testable from the beginning. That will lead to a more flexible design also. (In a perfect world I would follow this advice myself... ;-)) Cheers, Markus ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://w

AW: Haskell indentation

de should be formatted in a way easy to scan and overview. You have to SEE the structure of the code. That depends very much on what your program does. No rules of thumb. Experience and experiments will do. (That was taken *directly* out of my convoluted brain and may be totally dumb.) Markus

AW: Yet Another Monad Tutorial

uth for the Typesetting-Books and it worked very well (for me). I hope this is a sensible idea. Markus -- Markus Schnell Infineon Technologies AG, CPR ET Tel +49 (89) 234-20875 ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

AW: How to read an initialization file.

I would recommend reading the variables in the main and pack the rest of your program into a monad. But only if you really need to access the variables from everywhere and don't want to pass them around explicitely. Markus > I need to be able to access these values effieiently

AW: ffi

> $ cc -c cfile.c > $ ghc -o myprog Main.hs cfile.o won't you need -fffi also? Markus ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

AW: Editor Tab Expansion

t - unless you develop in a group, then you should have layout rules anyway. Perhaps somebody could come up with a "Haskell indent" (part of a pretty printer?)? Markus ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe