- Haskell-Cafe - Haskell.org

Re: Interpret haskell within haskell.
by cwitty＠newtonlabs.com 10 Jan '03

10 Jan '03

Matt Hellige <matt(a)immute.net> writes: > So it seems natural, especially to new users, to hope that Haskell and > the ML variants, sharing many other features common to these > languages, would offer this facility as well. The answer, in general, > is that they do not. (Sorry for the belated reply.) Evidently, some ML variants do include eval or eval-like facilities. When reading through the sources of the Isabelle 2002 proof verification system, I noticed the "use_text" eval-like function which is implemented using the following system-specific functions: smlnj-0.93: System.Compile.use_stream polyml: PolyML.Compiler mlworks, mosml: use Carl Witty

1 0

newbie questions
by Max Ischenko 09 Jan '03

09 Jan '03

Hello! I'm started to learn Haskell and have some questions. After reading a "Gentle introduction..." I've decided to write a simple program -- a complement to Literate.hs from hugs demos which reads a plain haskell source file and converts it to literate haskell source. The source code of this program follows. Now the questions: - To be able to run it both in Hugs and by GHC I need an `import Data.Char(isSpace) for GHC`. Can this be conditionally included in a source for GHC only? - Am I reinventing the wheel with my `pad` function? Could I use some standard function(s) instead? - What if I'd want to do a more complex processing, like handling {--} comments? The `classify` function analize one line at a time and I'd want too see a surronding context? Should I use another pass, just like for `addblanks`? module Lit where import System(getArgs) -- classification of the haskell source lines data Classified = Program String | Blank | Comment String deriving (Show) classify :: String -> Classified classify ('-':'-':xs) = Comment (dropWhile isSpace xs) classify s | all isSpace s = Blank | otherwise = Program s unclassify :: Classified -> String unclassify (Program s) = "> " ++ s unclassify (Comment s) = s unclassify Blank = [] process :: String -> String process hs = unlines (map unclassify (addblanks (clines hs))) clines hs = map classify (lines hs) -- inserts a blank between a program line and a comment line where needed addblanks :: [Classified] -> [Classified] addblanks = pad needBlank Blank needBlank :: Classified -> Classified -> Bool needBlank (Program p) (Comment c) = True needBlank (Comment c) (Program p) = True needBlank _ _ = False -- inserts a value between those adjanced elements for which -- function p returns True pad :: (a -> a -> Bool) -> a -> [a] -> [a] pad p value [] = [] pad p value (x:[]) = [x] pad p value (x:xs) | p x (head xs) = x:value:rest | otherwise = x:rest where rest = pad p value xs usage err = err ++ "\n" ++ "USAGE: lit <filename>" main :: IO () main = do strs <- getArgs case strs of [] -> ioError (userError (usage "Not enough arguments.")) [str] -> mklit str _ -> ioError (userError (usage "Too many arguments.")) -- takes a filename without suffix, reads a plain haskell source -- and creates a literate haskell source. mklit :: String -> IO () mklit f = do hs <- readFile (f ++ ".hs") writeFile (f ++ ".lhs") (process hs) -- Bst rgrds, M.A.X.: Mechanical Artificial Xenomorph.

2 2

Re: A newbie question about Arrows.
by Ashley Yakeley 08 Jan '03

08 Jan '03

At 2003-01-06 03:14, Ross Paterson wrote: >class PreArrow ar where > arr :: (a -> b) -> ar a b > (>>>) :: ar a b -> ar b c -> ar a c ... > class (PreArrow ar, Monoidal p u) => GenArrow ar p u where > first :: ar a b -> ar (p a c) (p b c) My own preference is something like this: class (PreArrow ar) => GenArrow' ar where arrApply :: ar p (q -> r) -> ar p q -> ar p r My GenArrow' is actually equivalent to Hughes' Arrow and I assume your GenArrow. In an ideal world, I could leverage my FunctorApply class to have something like this: class (Functor f) => FunctorApply f where -- first arg (fab) "executed" first fApply :: f (a -> b) -> (f a -> f b) -- first arg (fa) "executed" first fPassTo :: f a -> f (a -> b) -> f b fPassTo fa fab = fApply (fmap (\a ab -> ab a) fa) fab class (PreArrow ar,forall p. FunctorApply (ar p)) => GenArrow'' ar Unfortunately, GHC does not yet allow this kind of superclassing. <http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/*checkout*/hbase/Source/HBa se/Category/Functor.hs?rev=HEAD&content-type=text/plain> <http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/*checkout*/hbase/Source/HBa se/Category/Arrow.hs?rev=HEAD&content-type=text/plain> -- Ashley Yakeley, Seattle WA

4 4

OT: Project Idea: Aristo - A Framework for Embedding and Integrating High-Level Languages
by Shlomi Fish 08 Jan '03

08 Jan '03

I just returned from a dinner a few members of the Linux Israeli scene had with Richard Stallman (of GNU fame), as he his now visiting Israel. I got the opportunity to talk with him, and asked him the GNU project insistance of using guile for extensibility. He said the reason for that was that converting any other language to Scheme was a good a choice out of the fact Scheme was so simple, powerful and generic. I said converting Perl 5 code to Scheme would not be too trivial at all, and he said that was the case for converting Perl to almost everything else. :-) (despite this joke, I'm sure converting many languages to Scheme would be incredibly problematic) Then I noted that they should try the GIMP approach instead: and use a procedural database to integrate several languages back-ends. Then, he said that the type system would not be flexible enough for that. After a while that it was a challenge: create a bridge in ANSI C, that will be flexible enough to interoperate code between many virtual machines: perl 5, python, Ruby, Java, Haskell, O'Caml, etc. The codename is dubbed "Aristo", which is the Hebrew pronouncation and spelling of "Aristotle". (it's simpler and without the "totel" at the end). Now what I need is some advice on designing a type system: OK, I can have arrays of ints, and associative arrays from strings to ints, etc. But an array of records whose one field is an array of ints, the other a linked list of strings, the other an associative array from floats to this record itself, is something I'd rather not have to do type interference with. (usually you don't need such strict typing requirements). Here are some of my ideas, so far. Let me know what you think: 1. Aristo can only be written in ANSI C. Any other language will be unacceptable, as all implementations of the back-ends are written in ANSI C. 2. Aristo should have a nice nested namespace organization, with import and export features, package-scope globals etc. The gimp flat list (in which namespace collision is maintained by prefixes) is not scalable. 3. There should be a union type which is a type identifier followed by the type value, which could assume any value. It is possible some types will not be unions and will be plain types without the type value. 4. A standard enum can be used to store the object meta-type, and a standard pointer/long union can be used to store the data. Almost anything will be done using indirection. 5. Types should be declared using a machine-readable type definition, that can be understood by humans. 6. Maybe I can take a look at GIMP PDB for code and ideas, but probably not much. From my impression it's more of an ad-hoc system for the GIMP. 7. A procedure can restrict the types that pass to it, but I'm not sure to what extent. 8. I'll have to translate between conventions of different languages inside each language back-end. 9. It's first implementation will probably not have all the functionality I'd like it to have, but better to release early and release often. Your ideas and comments are most welcome. At the moment Aristo is at the pre-coding stage. (I'm just thinking about its design). But I'd rather have something well-designed and well-scrutinized in mind before I start actual coding. Regards, Shlomi Fish ---------------------------------------------------------------------- Shlomi Fish shlomif(a)vipe.technion.ac.il Home Page: http://t2.technion.ac.il/~shlomif/ He who re-invents the wheel, understands much better how a wheel works.

1 0

Ambiguous defaults
by Ferenc Wagner 08 Jan '03

08 Jan '03

Hello, What's the way to express the following: a compound object is generally made up of two components with identical type. For this common case I'd like to provide some default methods, which take the object apart, operate on the parts and put the results back together. In other cases this default method should be overridden, eg. when the compound object isn't made of two identical components. My first try (below) doesn't work, can you recommend a solution? Thanks: Feri. \begin{code} module Test where class Component b where property :: b -> Int class Compound a where decompose :: Component b => a -> (b,b) additive :: a -> Int additive x = property l + property r where (l,r) = decompose x \end{code} ghci: test.hs:9: Ambiguous type variable(s) `b' in the constraint `Component b' arising from use of `property' at test.hs:9 hugs: ERROR test.hs:9 - Cannot justify constraints in default member binding *** Expression : additive *** Type : Compound a => a -> Int *** Given context : Compound a *** Constraints : Component b

3 2

RE: Space explosion
by Simon Marlow 06 Jan '03

06 Jan '03

> > -- Specs contains the options for the simulation; > rollBounds simply > finds the lowest and highest possible rolls > > -- type RollValue = Int > > -- type RollValueDist = Array RollValue Int > > probDist :: Specs -> [RollValue] -> RollValueDist > > probDist specs rolls = > > accumArray (+) 0 (rollBounds specs) [(r, 1) | r <- rolls] > > It should be doing an in-place array update as it evaluates the > comprehension, but apparently something's being kept in memory longer > than it has an excuse for. It does do a sequence of in-place updates, but this is another instance of the foldl space leak. The additions aren't being performed strictly, so the array is filling up with suspensions. For example: accumArray (+) 0 (1,10) [(3,1), (3,1), (3,1), ...] would produce this sequence of arrays as accumArray processed its input list: { (3,1), ... } { (3,1+1), ... } { (3,1+1+1), ... } we should really have a strict version of accumArray (the lazy version *is* useful sometimes: you can refer recursively to the final array, for example). A quick workaround in your case (GHC only, I'm afraid) is to use UArray instead, available from Data.Array.Unboxed. These arrays contain unboxed values and are therefore strict by definition; and you can use all the usual array operations including accumArray. This workaround only applies if you're using one of the types supported by UArray though (Int, Char, and other base types). Cheers, Simon

1 0

Using SGML/XML in literate code
by Peter Simons 06 Jan '03

06 Jan '03

I understand that I can mark-up code segments in a literate source module using the syntax: \begin{code} ... \end{code} But is it somehow possible to re-define this to be <haskellcode> ... </haskellcode> instead? I am asking because the latter style would enable me to write literate programs in DocBook, HTML, or any other SGML-based mark-up format. And _that_ would be very useful indeed. :-) -peter

1 0

Re: Web Application Development
by Christopher Milton 06 Jan '03

06 Jan '03

--- Dominic Steinitz <dominic.steinitz(a)blueyonder.co.uk> wrote: [snip] > The original code was in PHP and MySQL so rather than re-invent the wheel I [snip] > So my question is: what should I do to re-write this in Haskell? I haven't tried it out, but I found this project on SourceForge: http://sourceforge.net/projects/functional-php/ on to the Haskell stuff... > From the discussion on this mailing list in June and reading through the > libraries section of haskell.org, I think there are the following options: > > HTML > > 1. Use Wash/CGI but maybe somehow move to mod_haskell if the webserver > performance isn't adquate. HaXml could also be quite useful for generating HTML or XML: http://www.cs.york.ac.uk/fp/HaXml/ > SQL > > 2. Use MySQL-HS which requires HaskellDirect or use HSQL. > > I'd be very grateful for any advice and any progress as a result of the > discussion in June. Ashley Yakeley has an interface to MySQL: http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/hbase/Source/Foreign/ and I was thinking of extending the DBI model as found in Perl and the libpq binding as listed on Haskell.org: http://www.astercity.net/~khaliff/haskell/dbi/dbi.tgz Searching Freshmeat and SourceForge for Haskell turns up a few things. Actually, there's quite a bit of alpha and beta Haskell code out on the net, but we don't seem to get very far with much of it... ===== Christopher Milton cmiltonperl(a)yahoo.com __________________________________________________ Do you Yahoo!? Yahoo! Mail Plus - Powerful. Affordable. Sign up now. http://mailplus.yahoo.com

1 0

Editor Tab Expansion
by Jim Greer 03 Jan '03

03 Jan '03

Greets - [ Better late than never. ] Ran across this thread while perusing list trying to figure out whether to join or not. In the interest of sharing info with the great collective unconscious (i.e. Internet), thought I'd include part of my .vimrc so that Vim users (and others considering the same) can see how it handles the embedded tab/whitespace layout problems of various languages: set background=dark syntax on filetype on set textwidth=72 autocmd Filetype haskell set ai autocmd Filetype haskell set expandtab autocmd Filetype haskell set tabstop=8 autocmd Filetype haskell set shiftwidth=8 autocmd Filetype mail set ai autocmd Filetype mail set tabstop=4 autocmd Filetype mail set shiftwidth=4 autocmd Filetype ruby set ai autocmd Filetype ruby set tabstop=2 autocmd Filetype ruby set shiftwidth=2 A complete ('enhanced') install of Vim includes syntax recognition for a great number of file formats, including Haskell (apparently, haven't done much yet). Setting syntax on manages the syntax recognition part, so that you get colorized syntax. Setting filetype on recognizes files (by extension?), so that you can use the autocmd FileType haskell .... commands to tailor settings for particular filetypes. In this case, I'm using expandtab and setting the tab settings to 8, as mentioned previously. Cordially, Jim G p.s. http://www.vim.org/ p.p.s. I'm suprised that the *macs crowd hasn't chimed in with ways to configure their editos^Hr to set tabs differing by day of week, phase of moon, etc. -- James B. Greer <jgreer(a)midsouth.rr.com> [expires: 2004-12-27] 7F49 3D20 03C6 E859 E4F9 0735 E1F9 B259 21FA 1494

1 0

Firmalar İçin En Verimli ve Karlı TİCARET PORTALI Açıldı...
by Neslihan ÇETİN 03 Jan '03

03 Jan '03

Bu mesajın içeriğini düzgün bir şekilde göremiyorsanız, www.e-talep.com/tanitim <http://www.e-talep.com/tanitim> adresini ziyaret edebilirsiniz. <http://www.e-talep.com> _____ Neden ? E-ticaret Neden ? E-talep.com _____ Ticaretin %35'i internete taşınacak, sizde yerinizi alın !!! 2005 yılına kadar firmalar arası ticaretin %35'inin elektronik ortama taşınacağı tahmin edilmektedir. Bir firma çalışanı olarak veya firma sahibi olarak bu gelişmelerin dışında kalmayıp, sizin için tasarlanan ve hizmetinize sunulan E-talep.com gibi ücretsiz teknolojileri çalışma hayatınıza entegre etmelisiniz. E-talep.com ile Firmanız daha hızlı kar edecek Firmaların, Pazarlama ve Satınalma bölümleri için tasarlanan E-talep.com, karlı ticaret ortamı ile satışlarınızda artışa neden olacak, böylece hızlı kar etmenizi sağlayacak. Satın almada ki %15'lere varan fiyat avantajı ile girdi maliyetleriniz azalacak, böylece kar marjınız yükselecektir. E-talep.com ile rekabet gücünüzü ve verimliliğinizi artıracaksınız Tüm kamu ve firma alımlarından veya bizim tabirimizle; güncel taleplerden anında haberdar olacak, rakip firmaların bir adım önüne geçeceksiniz. Ayrıca pazarlama ve satın alımda verimliliği artırarak zaman ve para tasarrufu sağlayacaksınız. Satın alım sırasında %8 ile %15 arası kar edeceksiniz Firmanızın alımlarını e-talep.com üzerinde yayınlayarak, beklemediğiniz fiyat indirimleri ile karşılaşacak, girdi maliyetlerinizi azaltacaksınız. Alımlar sırasında ortalama %8 ila %15 arası kar sağlayacaksınız. Firmalar için zaman çok daha hızlı akıyor Firmaların artık hantal bir yapıyla büyümesi söz konusu değil, artık satacağı ürünleri kısa sürede pazarlamalı, ihtiyaç duyduğu ürünleri ise daha hızlı siparişedip satın almalı. E-talep.com yüksek teknolojisiyle, yatırım yapmanıza ve para harcamanıza gerek kalmadan bu imkanı size sunuyor. E-talep.com ailemizde sizi de görmek istiyoruz Her geçen gün ailemiz büyüyor 2 ay gibi kısa bir sürede 1000 üyeyi aştık, zamanla daha büyüyeceğimiz inancındayız. Ailemize katılarak, küçük ve orta ölçekli firmaların, kamu kurum ve kuruluşlarının oluşturduğu çok geniş bir alıcı ve satıcı kitlesine ulaşacak, yeni iş ortakları edineceksiniz. E-talep.com'un arkasında güçlü bir kadro var E-talep.com firmalar arası ticaret ve bilişim teknolojilerinde uzman olan, profesyonel bir ekip tarafından tasarlandı. Sizlerden gelen öneri ve isteklerle bu ticaret platformu daha da geliştirilerek, kolay kullanılabilir, verimli ve etkin bir ticaret ortamı oluşturulacaktır. E-talep.com Kullanımı kolay güvenli bir ticaret platformudur E-talep.com kullanımı kolay, üyelerin gizlilik kurallarını gözeten, güvenli bir ticaret platformundur. Daha fazla bilgi için; www.e-talep.com <http://www.e-talep.com> adresini ziyaret edin. _____ Görüş, öneri ve sorularınız için; t ı k l a y ı n <http://www.e-talep.com/Pages/Contact.asp> E-posta almak istemiyorsanız; t ı k l a y ı n <mailto:destek@e-talep.com?subject=E-posta almak istemiyorum>

1 0