[Haskell-cafe] Debugging a RecSel Error

Hi all, I'm trying to find the spot in my source code that triggered a RecSel Exception (No match in record selector ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Zippers for gui elements?

Hi all, I need to control some gui elements, ie. stuff like when dis button is clicked make dat one inactive. Some time ago, wish I'd remember where, I read about using Zippers for that sort of thing. Does anybody know where I might have read that? Günther

[Haskell-cafe] Books recommendation for LINQ?

Hi, I'll be trying Sigbjorns haskell-dotnet package together with LINQ. What's a good book for LINQ? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Compiling on windows - again

Hi guys, I'm sorry, I asked this before ... What is the flag you have to pass during ghc --make in order to produce an exe on Windows that doesn't open a DOS window. Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

[Haskell-cafe] HDBC 2.1, UTF8 and Umlauts

Hi guys, for some reason, any way I try, all the Umlauts get garbled with HDBC 2.1. HDBC 1.16 worked fine with any backend (ODBC, Sqlite3, ... what have you). Anybody else had similar problems and knows how to solve this? Günther ___ Haskell-Cafe

[Haskell-cafe] Darcs and binary files

Hi, I've gotten used to darcs now, and use it for my project. There is one quirk though, I also added some rather large binary files, an sqlite database and an MS Access database to the repository. Now whenever I do a push from a branch into the main trunk the system runs out of memory.

[Haskell-cafe] Using Takusen is a real intellectual challenge

Hi, well I'm *trying* to use Takusen to export from one database into the other. I'm using Takusen for this so that I can guarantee that during the export not a single huge result is assembled (possibly in memory) and then insert in one lump into the second database. Trying to figure out how

[Haskell-cafe] GLFW - Mac OS X

Hi, has anybody recently install the GLFW package on Mac OS X? It won't install on my machine. Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] GUIs, FRP, (Delimited) Continuations and Zippers

Hi all, In my app, there is one part which has a rather complicated GUI logic, it involves n drop downs with n choices each. Whenever the current selection in one of the drop downs changes by user interaction, the other (n-1) drop downs need to be notified and their item list need to

[Haskell-cafe] Trying to Express Constraints using a data structure

Hi all, I'm trying to express a constraint using a data structure. Let's say I'd want to express a mapping of a to b, c to b, d to b and e to f. A mapping can also be from a to a, b to b and so on. The constraint is that one cannot map a to b if b was already mapped to let's say c. I'd

[Haskell-cafe] Lazy Parsing

Hi all, is it possible to do lazy parsing with Parsec? I understand that one can do that with polyparse, don't know about uulib, but I happen to be already somewhat familiar with Parsec, so before I do switch to polyparse I rather make sure I actually have to. The files it has to parse is

[Haskell-cafe] Re: Lazy Parsing

Dear Doaitse, It is my pleasure to announce that after 5 days of experimenting with uu-parsinglib I have absolutely no clue, whatsoever, on how to use it. Period. I do not even manage to write a parser for even a mere digit or a simple character. I have read the tutorial from a to a to z

[Haskell-cafe] Re: Lazy Parsing

Dear Malcom, thanks for helping. I had actually come to Haskell originally because of a parsing problem. I had been using Smalltalk until I started a project which required parsing files. Until then I had not done any RW parsing. Well the route was more a Parsec - Haskell, wtf is Haskell?

[Haskell-cafe] Umlauts in command line arguments

Hi all, When a command line argument contains an umlaut that argument gets garbled. I'm using ghc 6.10.2 on Win XP. Are there any known solutions for this problem? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

[Haskell-cafe] Compiling a windows app - embedding application icon

Hi all, is it possible to make ghc embedd an application icon in the .exe during the compilation process? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Compiling a windows app - embedding a manifest

Hi all, is it possible to make ghc embedd a particular manifest in the .exe during the compilation process? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Non Empty List?

Hi, I need to design a container data structure that by design cannot be empty and can hold n elements. Something like a non-empty list. I started with: data Container a = Single a | Many a [a] but the problem above is that the data structure would allow to construct a

[Haskell-cafe] Re: Non Empty List?

Hi Jake, Jake McArthur schrieb: GüŸnther Schmidt wrote: data Container a = Single a | Many a [a] but the problem above is that the data structure would allow to construct a Many 5 [] :: Container Int. I think you meant to do either data Container a = Single a | Many a (Container

[Haskell-cafe] Re: Non Empty List?

Hi Tom, thanks for replying, no, I'm not looking for streams. I hope I made myself a bit more clear in my response to Jake. Günther Tom Lokhorst schrieb: Are you looking for something like Streams [1]? They're infinite sequences, defined like this: data Stream a = Cons a (Stream a) They

[Haskell-cafe] Re: Non Empty List?

Dan Weston schrieb: Unless I'm missing something in your description, why not data Container a = Single a | Many a a [a] Hi Dan, the above solution would still allow to construct, for instance, Many 5 42 [] :: Container Int The reason why I'm trying to find the design for a data

[Haskell-cafe] Re: Non Empty List?

to pull a zipper over it, once I had the underlying structure right. Günther PS: please also see my reply to Tillman Tony Morris schrieb: I note that you didn't address the suggestion of a zipper. GüŸnther Schmidt wrote: Dan Weston schrieb: Unless I'm missing something in your description

[Haskell-cafe] Re: Non Empty List? - Apologies

Hi Jake, apologies, Jake McArthur schrieb: GüŸnther Schmidt wrote: data Container a = Single a | Many a [a] but the problem above is that the data structure would allow to construct a Many 5 [] :: Container Int. I think you meant to do either data Container a = Single a | Many

[Haskell-cafe] Re: Non Empty List?

. :) Günther Tillmann Rendel schrieb: Hi Günther, GüŸnther Schmidt wrote: data Container a = Single a | Many a [a] but the problem above I need a data structure as in my example without the [] being possible to be empty. So lets write a variant of list which cannot be empty. A usual list

[Haskell-cafe] Re: Non Empty List?

failed to realize that in Jakes post and only got it after Tillmanns post. It's been a long night :) Günther Jeff Wheeler schrieb: On Fri, 2009-06-05 at 02:08 +0200, GüŸnther Schmidt wrote: As for the zipper: In some of the examples I've seen, the zipper is implemented on top

[Haskell-cafe] com-1.2.3 - problems installing

Hi all, I'm trying to install com-1.2.3 on Win XP with ghc-6.10.3 I get this error message: Resolving dependencies... Configuring com-1.2.3... cabal: Missing dependencies on foreign libraries: * Missing header file: include/WideStringSrc.h * Missing C libraries: kernel32, user32, ole32,

[Haskell-cafe] Need some help with an infinite list

Hi guys, I'd like to generate an infinite list, like [a, b, c .. z, aa, ab, ac .. az, ba, bb, bc .. bz, ca ...] When I had set out to do this I thought, oh yeah no prob, in a heartbeat. Uhm. Help, pls! Günther PS: I know this should be a no-brainer, sry

[Haskell-cafe] Re: Need some help with an infinite list

Dear Ross, thanks for your post, you got it almost right, I needed something like aa, ab, ac ... It seems that Thomas has figured it out. Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

[Haskell-cafe] Re: Need some help with an infinite list

Hi Thomas, thanks, it seems you found it. I find it a bit embarrassing that I was unable to figure this out myself. Günther Thomas Davie schrieb: letterCombos = map (:[]) ['a'..'z'] ++ concatMap (\c - map ((c++) . (:[])) ['a'..'z']) letterCombos Not hugely efficient, if you generate the

[Haskell-cafe] Re: Need some help with an infinite list

Hi Tom, thanks for that. I remembered reading about that in my earliest haskell days, couldn't find it again and couldn't get it right by myself either. Günther Tom Pledger schrieb: GüŸnther Schmidt gue.schmidt at web.de writes: Hi guys, I'd like to generate an infinite list, like

[Haskell-cafe] Re: Need some help with an infinite list

Hi Ross, no problem at all, I certainly appreciate it. Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Re: Need some help with an infinite list

Hi Richard, I'd have to guess here :) Maybe, what you have in mind, is: generate an infinite list with numbers from [1 ..], map it to base 26? Günther Richard O'Keefe schrieb: On 17 Jun 2009, at 12:28 pm, GüŸnther Schmidt wrote: Hi guys, I'd like to generate an infinite list, like

[Haskell-cafe] Re: Performance of functional priority queues

Hi Richard, just a wiiild guess on this, but anyway. Maybe Oleg has something to say on this, in particular when it comes to his domain, ie. delimited continuations. As I said, just a wild guess. Günther Richard O'Keefe schrieb: There's a current thread in the Erlang mailing list about

[Haskell-cafe] Re: Need some help with an infinite list - Ouch

Hi all, you have come up with so many solutions it's embarrassing to admit that I didn't come up with even one. Günther GüŸnther Schmidt schrieb: Hi guys, I'd like to generate an infinite list, like [a, b, c .. z, aa, ab, ac .. az, ba, bb, bc .. bz, ca ...] When I had set out to do

[Haskell-cafe] Re: Which windowing toolkit to use?

Hi Patai, there is one other alternative to gtk2hs and wxhaskell: .NET Forms It is accessable through Sigbjorn Finne's hs-dotnet package. I am right now *starting* to use it myself, so just consider it an option. Both of the others are quite usable, wxhaskell has very easy to use layouts and

[Haskell-cafe] Re: Which windowing toolkit to use?

Magnus Therning schrieb: GüŸnther Schmidt wrote: Hi Patai, there is one other alternative to gtk2hs and wxhaskell: .NET Forms It is accessable through Sigbjorn Finne's hs-dotnet package. Is that usable with mono? Sorry Magnus, dunno. The galois guys provide a lot of really really useful

[Haskell-cafe] Re: Could someone give me a sample about haskelldb?

Hi Magicloud, restrict (t!T.done .. constant False) should dot it but your t!T.done confuses me, is the the T.xxx due to an import? also the line 49 does not seem to be right. Would you mind to post your table and column definitions? Günther Magicloud Magiclouds schrieb: I changed it,

[Haskell-cafe] hs-dotnet users?

Hi all, I'm just touching base with Sigbjorns hs-dotnet package. Are there other users of this package out there who would like to share their experience? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

[Haskell-cafe] Re: haskelldb + sqlite problem.

Hi Cloud, this often occurs when the path to the database includes a non-ascii character. In my dev environment, the path to the database deliberately contains an umlaut and the original code base of hdbc.sqlite3 from John Goerzen, version 2.0 version 2.1 thus does not work. John

[Haskell-cafe] Re: haskelldb + sqlite problem.

Hi John, let me first of all apologize, I didn't mean to criticize you, I'm sure you had good reasons for those changes, I'm merely mean to state how they did affect me after switching to HDBC 2.1. Since after the rollback they no longer occurred I surmise that there is a connection. The

[Haskell-cafe] F# mailing list?

Hi guys, is there a mailing list for haskellers that defected to F#? Not that I was I going to, just asking, absolutely hypothetically. Uhm. Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

[Haskell-cafe] Re: F# mailing list?

Hi Anton, cool I'll keep you in the loop. Would you mind talking about more about what you do in the F# Shop? I must admit I only came to haskell itself only 2 years ago, created 2 apps in it and have no clue for instance on how F# standing in the market is. Günther Anton Tayanovskyy

[Haskell-cafe] Breaking ghci

Hi folks, I would like to announce that I have not merely managed to make the RTS choke during runtime on stack overflows like lesser programmers, no, *I* have managed to write code that ghc is not even able to compile due to exhausting virtual memory! Top that! Günther

[Haskell-cafe] ghc static linking on Windows

Hi, I tried to compile an app that uses sqlite3.dll with the -optl-static flag and the error message is: C:\ghc\ghc-6.10.3\gcc-lib\ld.exe: cannot find -lsqlite3 collect2: ld returned 1 exit status ___ Haskell-Cafe mailing list

[Haskell-cafe] ActiveX and COM

Hi, what is currently the recommend way to interface with COM from haskell? I need to create an Excel Sheet and thus need to use Excel via COM. Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

[Haskell-cafe] Scripting COM Components from Haskell - GreenCard on Hackage

Hi, does anybody know if the Greencard package / lib is the same software that is mentioned in the paper Scripting COM Components from Haskell? http://research.microsoft.com/~simonpj/papers/com.ps.gz I managed to install the hackage Greencard package on XP with GHC 6.8.3 but it seems to be

[Haskell-cafe] Need some advice on deploying an app

Hi, I've just finished developing my haskell - windows app and am ready to ship it now. I'm using Inno Setup for the installation but need another tool that would wrap my app inside itself and check for valid keys or an expiration date on every start up. Can anyone recommend a good tool for

[Haskell-cafe] Samples for http package

Hi everyone, are there any examples on how to use the current version of the http package? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] And another request on how to get started - JSON package

Hi, Sigbjorn has contributed tons of very useful packages and particularly quite a few package that are especially useful for the handful of us haskell-windows users. Right now though I could do with an example for how to actually use his JSON package. Since it's actively maintained and

[Haskell-cafe] Left fold enumerator - a real pearl overlooked?

Hi all, in the last few months I was looking for haskell database library, eventually settling for HDBC (thanks John btw). Takusen also caught my eye although I even failed installing it. Nevertheless a particular property of takusen, left-fold-enumerator, also sparked my interest and I

[Haskell-cafe] a newbies confusion with repositories - darcs or git

Hi, now that I'm finished with my haskell app I take the opportunity to follow up on some things I hadn't quite understood in my so far short venture into the haskell world. Means: Prepare for a number of naive posts to follow. I had the impression that darcs was the preferred repository

[Haskell-cafe] Re: Left fold enumerator - a real pearl overlooked?

Hi everyone, after reading all the responses I would like to ask someone, anyone, to kind of summarize the merits of the left-fold-enumerator approach. From all that I read so far about it all I was able to gather was that it has significance but I'm still not even sure what for and what not

[Haskell-cafe] Re: Left fold enumerator - a real pearl overlooked?

Hi all, thanks again for the explanation. So I have the impression that this approach is something with recognized merit but in a way still considered work in progress as I do not really see it advertised for the general haskell audience. And there are some that study it further. Ok. My

[Haskell-cafe] Purely Functional Data Structures

Hi, is the above mentioned book still *the* authority on the subject? I bought the book, read about 10 pages and then put it back on the shelf. Um. In my app I have to deal with 4 csv files, each between 5 - 10 mb, and some static data. I had put all that data into an Sqlite3 database and

[Haskell-cafe] derive Drift - some help please

Hi, I need to derive Data, Typeable for Data.Time.LocalTime. I had hoped to use either derive or DrIFT to generate the instance declarations for it. I tried to understand the respective user manuals but it's still all Greek to me. Someone please help! Günther

[Haskell-cafe] Re: derive Drift - some help please

, S. On Sun, Mar 8, 2009 at 10:30 AM, Gü?nther Schmidt gue.schm...@web.de mailto:gue.schm...@web.de wrote: Hi, I need to derive Data, Typeable for Data.Time.LocalTime. I had hoped to use either derive or DrIFT to generate the instance declarations for it. I tried to understand

[Haskell-cafe] Re: derive Drift - some help please

that's useful for you. Alex On Sun, Mar 8, 2009 at 12:40 PM, Gü?nther Schmidt gue.schm...@web.de wrote: Hi Alexander, well I have this: newtype AdmissionDate = AdmDt LocalTime deriving (Data,Typeable ..) at least that's where I wonna get. I don't know how to create the proper

[Haskell-cafe] Looking for literature

Hi all, I'm trying to catch up with all the wonderful Haskell Types, classes, Abstract Data Types, Algebraic Data Types, Types that give peoples headaches and all the other, deeper stuff I have been happily putting off. Now to look smart I have a bookshelf full of books for smart people and

[Haskell-cafe] examples for error handling in takusen?

Hi, can someone please point me to error handling examples with takusen? I try to run a piece of code with takusen but just get the very sparse Database.InternalEnumerator.DBException ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

[Haskell-cafe] How can I check which thunks are piling up on the stack?

Hi, How can I check which thunks are piling up on the stack? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] A guess on stack-overflows - thunks build-up and tail recursion

Hi all, I've been running into stack-overflow problems for some time now. Here is what I gathered so far. I used to think that the build up of thunks caused the stack overflow when, as it turns out, it does not. I apparently can have a huge thunk build up eventhough I use a supposedly

[Haskell-cafe] Re: A guess on stack-overflows - thunks build-up and tail recursion

and thus the thunks need to be reduced, starting with the outermost, which can't be reduced without reducing the next one etc and it's these reduction steps that are pushed on the stack until its size cause a stack-overflow. Günther GüŸnther Schmidt schrieb: Hi all, I've been running

[Haskell-cafe] Forcing evaluation when seq or strictness annotation are not possible [was: guess on stack-overflows - thunks build-up and tail recursion]

Hi all, here I am again with my all time favorite unsolved problem: stack overflows. The advice I have received so far from the Haskell community (this list and #haskell) was to use strictness annotation or seq in most cases. And indeed it did help. It certainly helped when I used a data

[Haskell-cafe] Grouping - Map / Reduce

Hi, let say I got an unordered lazy list of key/value pairs like [('a', 99), ('x', 42), ('a', 33) ... ] and I need to sum up all the values with the same keys. So far I wrote a naive implementation, using Data.Map, foldl and insertWith. The result of this grouping operation, which is

[Haskell-cafe] Re: Grouping - Map / Reduce

structures from start to finish, would I have come across this? Günther Luke Palmer schrieb: On Tue, Mar 24, 2009 at 3:51 PM, Luke Palmer lrpal...@gmail.com mailto:lrpal...@gmail.com wrote: On Tue, Mar 24, 2009 at 3:15 PM, Gü?nther Schmidt gue.schm...@web.de mailto:gue.schm...@web.de

[Haskell-cafe] Re: Grouping - Map / Reduce

Hi Ketil, Ketil Malde schrieb: Gü?nther Schmidt gue.schm...@web.de writes: let say I got an unordered lazy list of key/value pairs like [('a', 99), ('x', 42), ('a', 33) ... ] and I need to sum up all the values with the same keys. So far I wrote a naive implementation, using Data.Map

[Haskell-cafe] Re: Grouping - Map / Reduce

Dear Luke, I'm at a loss trying to figure out what is happening here, I'd sincerely appreciate it if you could find the time to give me more clues on this, I'm deeply impressed. If I think that what is happening *is* happening that would mean that this is a way to group in almost constant

[Haskell-cafe] Really need some help understanding a solution

Hi guys, I tried for days now to figure out a solution that Luke Palmer has presented me with, by myself, I'm getting nowhere. He has kindly provided me with this code: import Data.Monoid newtype IntTrie a = IntTrie [a] deriving Show singleton :: (Monoid a) = Int - a - IntTrie a

[Haskell-cafe] Re: Really need some help understanding a solution

Dear Luke, let me thank you first of all for your response, period, and let me also assure you that your efforts are not (totally) in vain. :) Of course I had all kinds of guesses what sort of dark arts you employed here, mostly really long shots (Memoization, CPS ...). And at the end of

[Haskell-cafe] Re: Really need some help understanding a solution

Well Folks, I've been programming for almost a decade now and making a living off it for almost 8 years. To me programing in Haskell is sometimes quite a humbling experience, because I come to realize how shallow my ventures so far were. The depth this language has is just amazing and the

[Haskell-cafe] Re: Really need some help understanding a solution

Guys, I appreciate the contribution but I'm now more confused than ever :) On the Co-Induction-whatever thingy: Thanks, that's certainly something interesting and I'll try to find out more about it. But it looks like none of all the proposals offers a true solution, at least none from start

[Haskell-cafe] A bit of a shock - Memoizing functions

Hi, um, well, I'm not even sure if I have correctly understood this. Some of the memoizing functions, they actually remember stuff *between* calls? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

[Haskell-cafe] Re: A bit of a shock - Memoizing functions

Hi Bulat, that is so cool! Günther Bulat Ziganshin schrieb: Hello Gü?nther, Friday, March 27, 2009, 11:30:41 PM, you wrote: Some of the memoizing functions, they actually remember stuff *between* calls? what i've seen in haskell - functions relying on lazy datastructures that ensure

[Haskell-cafe] Re: A bit of a shock - Memoizing functions

Hi Dan, yep, I've come across that one too and wouldn't you know it, the by now infamous Luke Palmer has left an interesting insight on that blog too :). So I reckon here the cycle closes. Günther Dan Piponi schrieb: 2009/3/27 Kirk Martinez kirk.marti...@gmail.com: I wonder: does the

[Haskell-cafe] Looking for practical examples of Zippers

Hi, my quest for data structures continues. Lately I came across Zippers. Can anybody point be to some useful examples? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Re: Looking for practical examples of Zippers

Thanks Don, I followed some examples but have not yet seen anything that would show me how, for instance, turn a nested Map like Map Int (Map Int (Map String Double) into a zipped version. That is presuming of course that this use is feasible at all. Günther Don Stewart schrieb:

[Haskell-cafe] Re: Looking for practical examples of Zippers

is probably more what I'm looking for, thanks! Günther David Menendez schrieb: On Mon, Mar 30, 2009 at 3:46 PM, Gü?nther Schmidt gue.schm...@web.de wrote: Thanks Don, I followed some examples but have not yet seen anything that would show me how, for instance, turn a nested Map like Map Int

[Haskell-cafe] Haskell EDSL to generate SQL?

Hi, I tried to solve some large data processing solely in Haskell so I could avoid lots of eventually very long and complex SQL statements. Unfortunately, as was to be expected, that approach doesn't scale. So I do need an SQL backend. But I hope to be able to use an DSL from which I can

[Haskell-cafe] Re: Haskell EDSL to generate SQL?

Hi Jeremy, thanks for that. I had come across it before but I think I'd prefer a more light-weight approach. Günther Jeremy Shaw schrieb: At Sat, 04 Apr 2009 15:40:56 +0200, GüŸnther Schmidt wrote: But I hope to be able to use an DSL from which I can automatically generate SQL-Strings

[Haskell-cafe] Re: Haskell EDSL to generate SQL?

Hi Jeremy, apologies for my initial response, that was definately premature. I had a second look and am quite impressed now. What is the best resource to look for more detail examples? Günther Jeremy Shaw schrieb: At Sat, 04 Apr 2009 15:40:56 +0200, GüŸnther Schmidt wrote: But I hope

[Haskell-cafe] haskelldb, how to escape table names

Hi, how can I escape table and column names, from something like: kh-internes-kennz to this: [kh-internes-kennz] ? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Paper: Translating donotation to SQL, Leijden, Meijer

Hi all, is the paper Translating donotation to SQL, Leijden, Meijer (1999) available anywhere? Günther ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Re: Paper: Translating donotation to SQL, Leijden, Meijer

Hi Shan, thanks but the paper I'm looking for is actually the reference #13 from the document you're pointing me to. Günther Chung-chieh Shan schrieb: Gü?nther Schmidt gue.schm...@web.de wrote in article grcti9$c1...@ger.gmane.org in gmane.comp.lang.haskell.cafe: is the paper Translating