- Haskell - Haskell.org

Implicit parallel functional programming
by Satnam Singh 10 Feb '05

10 Feb '05

I'm trying to find out about existing work on implicit parallel functional programming. I see that the Glasgow Haskell compiler has a parallel mode which can be used with PVM and there is interesting work with pH at MIT. Does anyone know of any other work on implicitly parallelizing functional programs for fine grain parallel execution? The emergence of multi-core processors makes me think that we should look at implicit parallel functional programming in a new light. Cheers, Satnam ________________________________________ Satnam Singh Microsoft One Microsoft Way Redmond Washington 98052-6399 USA Email: satnams(a)microsoft.com Telephone: +1 425 705 8208 Cell: +1 408 718 2588 Pager: 4087182588(a)mobile.att.com

22 28

ICLP 2005 Doctoral Consortium: Call for Applications
by ICLP 2005 09 Feb '05

09 Feb '05

International Conference on Logic Programming Doctoral Consortium Sitges (Barcelona), Spain October 2-5, 2005 http://www.cs.nmsu.edu/~epontell/DC2005 ----------- The ICLP Doctoral Consortium (DC) is the first ever doctoral consortium to be offered as part of the International Conference on Logic Programming. The DC will take place during ICLP 2005 in Sitges (Barcelona), Spain. The Doctoral Consortium is designed for doctoral students working in areas related to logic programming, who are planning to pursue a career in academia. The Doctoral Consortium aims to provide students with an opportunity to present and discuss their research directions and to obtain feedbacks from peers as well as world-renown experts in the field. The Doctoral Consortium will also offer invited speakers and panels discussions. ------------ The Doctoral Consortium is held the during the regular activities of the ICLP 2005 Conference. The aims of the Doctoral Consortium are: * To provide doctoral students working in the field of logic programming with a friendly and open forum to present their research ideas, listen to ongoing work from peer students, and receive constructive feedback * To provide students with relevant information about important issues for doctoral candidates and future academics * To develop a supportive community of scholars and a spirit of collaborative research. * To support a new generation of researchers with information and advice on academic, research, industrial, and non- traditional career paths. The Consortium is designed for students currently enrolled in a Ph.D. program, though we are also open to exceptions (e.g., students currently in a Masters program and interested in doctoral studies). The Consortium is for students at any stage of their doctoral studies are welcome to apply. Applicants are expected to be conducting research in the field of Logic Programming; topics of interest include (but are not limited to): * Theoretical Foundations of Logic and Constraint Logic Programming * Sequential and Parallel Implementation Technology * Static and Dynamic Analysis, Abstract Interpretation, Compilation Technology, Verification * Logic-based Paradigms (e.g., Answer Set Programming, Concurrent Logic Programming, Inductive Logic Programming) * Innovative Applications of Logic Programming The Consortium allows participants to interact with established researchers and with other students, through presentations, question- answer sessions, panel discussions, and invited presentations. The Doctoral Consortium will provide the possibility to reflect - through short activities, information sessions, and discussions - on the process and lessons of research and life in academia. Each participant will give a short, critiqued, research presentation. The Doctoral Consortium will be held on a date to be determined, in parallel with the regular activities of the ICLP 2005 conference; the ICLP conference will run from October 2nd to October 5th, 2005. Doctoral Consortium participants will be offered the opportunity to have their abstracts published in the ICLP 2005 conference proceedings. Discussants: Several renown faculty members and researchers in the field of Logic Programming will join in evaluating the submission packets and will participate in the Doctoral Consortium, providing feedback to the presenters. The list of the discussants will be published at a later date. -------- Detailed submission instructions can be found in the ICLP 2005 Doctoral Consortium web site, at: http://www.cs.nmsu.edu/~epontell/DC2005 -------- Important Dates Submission Deadline: June 1st, 2005 Acceptance Notification: July, 1st 2005 Last Date to Update Research Summary: July 15th, 2005 Doctoral Consortium: October 2-5, 2005 ICLP 2005 Conference: October 2-5, 2005 ------------ Doctoral Consortium Chair: Enrico Pontelli Department of Computer Science New Mexico State University MSC CS, Box 30001 Las Cruces, NM 88003, USA epontell _a_t_ cs.nmsu.edu

1 0

(no subject)
by Javier García-Vivó Albors 09 Feb '05

09 Feb '05

Hi. I'm trying to use the hs-plugins with ghci for Windows. Do you know how to do it? I've tried several ways to install the and I haven't managed it. Thanks for your help ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program.

1 0

Evaluating expressions given as String
by Javier García-Vivó Albors 08 Feb '05

08 Feb '05

Hello everybody. I'm working on a haskell project in which I need to evaluate haskell expressions that are given in an input File. For instance: A file containing "Peter==Peter" or "3+2==5" or "home in [a-z]*sex[a-z]*" (see I need to use regular expressions too) is given as input The file contents are read as String type and I need to evaluate them to True or False. I'm looking for the way to parse and translate these expressions in order to evaluate them. Thanks for you help. J. ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program.

2 1

help with some basic code that doesn't work
by pablo daniel rey 08 Feb '05

08 Feb '05

hello i'm new to haskell so i'm sorry if this is a stupid question, but i'm having problems with some basic code. the code : data Maybe Dir = Just Dir | Nothing data Dir = Left | Right | Up | Down data Piece = Vertical | Horizontal | CodeA | CodeB flow = [(Horizontal, Left, Left), (Horizontal, Right, Right), (Vertical, Down, Down), (Vertical, Up, Up), ................ etc ] fst :: (a,b,c) -> a fst (x,y,z) = x scnd :: (a,b,c) -> b scnd (x,y,z) = y third :: (a,b,c) -> c third (x,y,z) = z element :: [(Piece, Dir, Dir)] -> Maybe Dir element [] = Nothing element xs = Just (third (head xs)) chgDir :: Piece -> Dir -> Maybe Dir chgDir p d = element (filter (\x -> p == (fst x)) (filter (\x -> d == (scnd x)) flow)) the error i get : Instances of (Eq Dir, Eq Piece) required for definition of chgDir i don't know what's happening. help!!! thanks in advance

4 3

ANNOUNCE: new FGL version (Feb 2005)
by Martin Erwig 07 Feb '05

07 Feb '05

FGL - A Functional Graph Library, Version: February 2005 ======================================================== I am happy to announce a new release of the Functional Graph Library for Haskell, a collection of graph algorithms and tools. Changes since the last release (from January 2004): * fixed an import error in Basic.hs * removed Eq instance of gr because it caused overlapping instance problems. Instead the function equal defined in Graph.hs can be used * added some more functions to the export list of DFS.hs * changed the definition of LPath into a newtype to avoid overlapping instances with lists * fixed the Makefile (for GHC and GHCi) Download: http://eecs.oregonstate.edu/~erwig/fgl/haskell/ Please email comments, bug reports, etc. to erwig(a)cs.orst.edu -- Martin

1 0

Re: xemacs & haskell major mode
by Surendra Singhi 07 Feb '05

07 Feb '05

Jon Fairbairn wrote: > On 2005-01-24 at 16:32MST Surendra Singhi wrote: > >>Is there any ilisp or slime like package for haskell, which integrates >>haskell with xemacs or emacs and provides a kind of integrated >>development environment? >>I am using Hugs 98. > > > Does <URL: > http://www.haskell.org/pipermail/haskell/2004-November/015015.html > >>help? > > I downloaded the haskell mode from that site and I was trying to configure it, but during the process I ran into this error Debugger entered--Lisp error: (void-function charsetp) signal(void-function (charsetp)) byte-code("..." [buf data kill-buffer signal] 3) find-file-noselect("c:/Documents and Settings/Owner/My Documents/haskell practice/picture.hs") experimental-dragdrop-drop-url-default(#<misc-user-event (dragdrop-drop-dispatch (dragdrop-URL "file:c:/Documents and Settings/Owner/My Documents/haskell practice/picture.hs"))> (dragdrop-URL "file:c:/Documents and Settings/Owner/My Documents/haskell practice/picture.hs")) apply(experimental-dragdrop-drop-url-default (#<misc-user-event (dragdrop-drop-dispatch (dragdrop-URL "file:c:/Documents and Settings/Owner/My Documents/haskell practice/picture.hs"))> (dragdrop-URL "file:c:/Documents and Settings/Owner/My Documents/haskell practice/picture.hs"))) dragdrop-drop-do-functions(((experimental-dragdrop-drop-url-default t t) (experimental-dragdrop-drop-mime-default t t)) #<misc-user-event (dragdrop-drop-dispatch (dragdrop-URL "file:c:/Documents and Settings/Owner/My Documents/haskell practice/picture.hs"))> (dragdrop-URL "file:c:/Documents and Settings/Owner/My Documents/haskell practice/picture.hs")) byte-code("..." [object experimental-dragdrop-drop-functions event event-over-text-area-p dragdrop-extents-done (byte-code "Æ!Ç!È!É‰¬…ÊËÉ\"ˆ ¬‚ Ì!ˆÍ Î Ï#‰Éa¬”ÐÑ\nÏ\"#ˆÎ Ï\n$‰ªh-É‡" [window cpos ext buffer event pos event-window event-point event-closest-point nil throw dragdrop-extents-done select-window window-buffer extent-at experimental-dragdrop-drop-functions dragdrop-drop-do-functions extent-property object] 6) dragdrop-drop-do-functions] 4) dragdrop-drop-find-functions(#<misc-user-event (dragdrop-drop-dispatch (dragdrop-URL "file:c:/Documents and Settings/Owner/My Documents/haskell practice/picture.hs"))> (dragdrop-URL "file:c:/Documents and Settings/Owner/My Documents/haskell practice/picture.hs")) dragdrop-drop-dispatch((dragdrop-URL "file:c:/Documents and Settings/Owner/My Documents/haskell practice/picture.hs")) The code in my .init file is (setq load-path (cons "C:\\Program Files\\XEmacs\\xemacs-packages\\lisp\\haskell-mode\\" load-path)) (setq auto-mode-alist (append auto-mode-alist '(("\\.[hg]s$" . haskell-mode) ("\\.hi$" . haskell-mode) ("\\.l[hg]s$" . literate-haskell-mode)))) (autoload 'haskell-mode "haskell-mode" "Major mode for editing Haskell scripts." t) (autoload 'literate-haskell-mode "haskell-mode" "Major mode for editing literate Haskell scripts." t) (add-hook 'haskell-mode-hook 'turn-on-haskell-decl-scan) (add-hook 'haskell-mode-hook 'turn-on-haskell-doc-mode) (add-hook 'haskell-mode-hook 'turn-on-haskell-indent) Am I doing anything wrong? I am using Xemacs 21.4.13 Thanks. -- Surendra Singhi www.public.asu.edu/~sksinghi/

3 6

[newbye] 'Just a'
by Yuri D'Elia 06 Feb '05

06 Feb '05

Hi all. I'm experimenting with haskell and its type system. I've done a function which scans a list, and returns "Just a" value if the element is found, or Nothing. get :: a -> Maybe a and implemented getAorB :: Maybe a -> Maybe a -> a getAorB a b = ... a function which returns "Just (get a)" or "Just (get b)" if (get a) is Nothing (excluding failures in both). By now, I've implemented it in terms of pattern matching: getAorB a b = f (get a) (get b) where f (Just a) Nothing = a f Nothing (Just a) = a but I'd like to know if there are other possible ways to do it, possibly without enforcing an evaluation order like pattern matching does.

2 1

Re: [Possible Spam]RE: [Haskell] Job Posting (Looking for a few good functionalprogrammers)
by Yaron Minsky 04 Feb '05

04 Feb '05

David Bergman wrote: >Yaron, > >This is probably out-of-topic, but: are you, or have you considered, using >the .NET implementation of OCaml. I managed - painstakingly - to integrate >it into a toy .NET project of mine, using .NET Direct3D, and see some virtue >in that combination. > > I've been following OCaml/.NET integration, and it does seem potentially quite interesting, particularly in a business environment like ours where all of the traders use Windows machines. Which .NET implementation did you look at, OCamIL? Or F#? >If only we Haskellers would be as lucky: both a fast implementation and an >integrated one with a Real (trademark...) environment such as .NET :-( > >/David > > > >>-----Original Message----- >>From: haskell-bounces(a)haskell.org >>[mailto:haskell-bounces@haskell.org] On Behalf Of Yaron Minsky >>Sent: Thursday, February 03, 2005 3:28 PM >>To: S. Alexander Jacobson >>Cc: haskell(a)haskell.org >>Subject: Re: [Haskell] Job Posting (Looking for a few good >>functionalprogrammers) >> >>S. Alexander Jacobson wrote: >> >> >> >>>Yaron, would you mind sharing the reason your firm chose OCaml over >>>Haskell for your applications? >>> >>> >>I started the quantitative research group, and I knew OCaml >>very well, and didn't know Haskell except by reputation. As >>to the merits, it is my general impression that OCaml is >>faster, and is all around a more pragmatic language than >>Haskell. That's merely an ill-informed impression, but there it is. >> >>Yaron >> >> >> >>>For others, I would love to organize an informal gathering of NYC >>>Haskell programmers if there are any. If you are >>> >>> >>interested, please >> >> >>>contact me and I'll try to make it happen. >>> >>>-Alex- >>>______________________________________________________________ >>>S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com >>> >>> >>>On Thu, 3 Feb 2005, Yaron Minsky wrote: >>> >>> >>> >>>>Jane Street Capital (an affiliate of Henry Capital >>>><http://henrycapital.com>) is a proprietary trading >>>> >>>> >>company located >> >> >>>>in Manhattan. The quantitative research department is >>>> >>>> >>responsible for >> >> >>>>analyzing, improving, and generating trading strategies. It's an >>>>open and informal environment (you can wear shorts and a >>>> >>>> >>t-shirt to >> >> >>>>the office), and the work is technically challenging, including >>>>systems work, machine learning, statistical analysis, parallel >>>>processing, and anything that crosses our path that looks useful. >>>> >>>>One unusual attraction of the job is that the large >>>> >>>> >>majority of our >> >> >>>>programming is done in OCaml. Pay is competitive, and we're a >>>>reasonably small company (around 85 employees), so advancement is >>>>pretty quick for someone who performs well. >>>> >>>>Here's what we're looking for: >>>> >>>>- Top-notch mathematical and analytic skills. We want people who >>>>can solve difficult technical problems, and think clearly and >>>>mathematically about all sorts of problems. >>>> >>>>- Strong programming skills. Pretty much all of our >>>> >>>> >>programming is >> >> >>>>in OCaml, so being a solid caml hacker is a big plus. But we're >>>>also interested in great programmers who we are convinced will be >>>>able to pick up OCaml quickly, so anyone with a high-level of >>>>proficiency with functional languages could be a good match. >>>> >>>>- Strong Unix/Linux skills --- We're looking for someone >>>> >>>> >>who knows >> >> >>>>their way around the standard unix tools, can write >>>> >>>> >>makefiles, shell >> >> >>>>scripts, etc. We use a beowulf cluster for >>>> >>>> >>compute-intensive jobs, >> >> >>>>so experience programming for and administering clusters is a big >>>>plus. >>>> >>>>If you're interested (or have any students you think might >>>> >>>> >>be a good >> >> >>>>match) and would be willing to relocate to New York, please send a >>>>cover-letter and resume to: >>>> >>>>yminsky(a)janestcapital.com >>>> >>>> >>>>_______________________________________________ >>>>Haskell mailing list >>>>Haskell(a)haskell.org >>>>http://www.haskell.org/mailman/listinfo/haskell >>>> >>>> >>>> >>> >>> >>> >>_______________________________________________ >>Haskell mailing list >>Haskell(a)haskell.org >>http://www.haskell.org/mailman/listinfo/haskell >> >> >> > > > > >

2 1

International M.Sc. Program in COMPUTATIONAL LOGIC
by Int. Center for Computational Logic 04 Feb '05

04 Feb '05

International M.Sc. Program in COMPUTATIONAL LOGIC The International Center for Computational Logic at the Technische Universitaet Dresden is offering a two-year study program, in English, leading to a master of science (M.Sc.) in computer science. This is part of the European Master's Program in Computational Logic, a distributed study program funded by the EU within Erasmus Mundus jointly run by the Free University of Bozen-Bolzano, the Technische Universitaet Dresden, the Universidade Nova de Lisboa, the Universidad Politecnica de Madrid and the Technische Universitaet Wien. Courses focus on logic and constraint programming, artificial intelligence, knowledge representation and reasoning, type theory, model theory, proof theory, equational reasoning, databases, natural language processing, planning and formal methods, among others. At the end of the programme a research master thesis has to be prepared. Prerequisites are a good knowledge of the basics of logic, and familiarity with mathematical reasoning. Knowledge of foundations of artificial intelligence and declarative programming is desirable. It is indispensable being fluent in English; German is not necessary at all, but there are facilities for studying it if desired. A bachelor in Computer Science, or equivalent degree, is required by the beginning of courses, in October 2005. Dresden, on the river Elbe, is one of the most important art cities of Germany. The economy is growing rapidly and Dresden is a top high-tech centre. AMD built the most modern chip factory in Europe, Infineon Technologies, Siemens and many other companies invest here. The possibilities of getting a job after the master are excellent. The University is very well equipped and the teachers/students ratio is close to 1. International contacts make it easy for interested students to continue pursuing a career in research. Deadline for applications is June 15, 2005, but applications are processed as they come. To apply, please send all the relevant documents by post to the address below. Further information is on the web at www.computational-logic.org including information about possible scholarships. Paper information material is available on request. Please give this message broad distribution. Sylvia Epp, secretary International Center for Computational Logic Technische Universitaet Dresden, D-01062 Dresden, Germany Tel: [49] (351) 463-38341 Fax: [49] (351) 463-38342 email: cl-secretary(a)Inf.TU-Dresden.DE

1 0