June 2005 - Haskell - Haskell.org

Haskell-mode 2.0
by Stefan Monnier 02 Feb '09

02 Feb '09

I have recently taken over maintainership of Haskell-mode, and after making a bunch of changes, I figured it would be a good idea to make a new release. You can find this new release at: http://www-perso.iro.umontreal.ca/~monnier/elisp/ If you think it should also be found at http://www.haskell.org/haskell-mode/, then please tell John Peterson to get back to me (my email to him seem to go straight to the bitbucket. John?). This release has several changes that have all been only lightly tested, especially w.r.t compatibility with various Emacsen. See appended the NEWS file that describes some of the notewirthy changes. Stefan Changes since 1.45: * keybindings C-c <char> have been replaced by C-c C-<char> so as not to collide with minor modes. * The following modules are now automatically activated without having to add anything to haskell-mode-hook: haskell-font-lock (just turn on global-font-lock-mode). haskell-decl-scan (just bind `imenu' to some key). * In recent Emacsen, haskell-doc hooks into eldoc-mode. * haskell-hugs and haskell-ghci are superceded by inf-haskell. * Indentation rules have been improved when using layout inside parens/braces. * Symbols like -> and \ can be displayed as actual arrows and lambdas. See haskell-font-lock-symbols. * Tweaks to the font-lock settings. Among other things paren-matching with things like \(x,y) should work correctly now. * New maintainer <monnier(a)gnu.org>.

3 6

Mixing monadic and non-monadic functions
by Sean E. Russell 17 Sep '05

17 Sep '05

Hello, I posted this question to comp.lang.functional, and someone suggested that I try this group instead. I'm struggling with monads. Well, not monads themselves, but mixing them with non-monadic functions. Here's my base case: someFunc :: String -> IO [a] ... ax <- someFunc a bx <- someFunc b assertBool "fail" $ length ax == length bx I don't like the assignments; the typing is redundant, if I have a lot of asserts like this, and the "variables" are temporary. What I'd much rather have is: ... assertBool "fail" $ (length $ someFunc a) == (length $ someFunc b) which is more readable, to my eye. The only solution which has been suggested that may work is liberal use of the liftM variants, but this gets *really* tedious and obtuse. Is there an elegant way to do what I want to do, or am I stuck with procedural-style assignments and bunches of temp vars? Thanks! -- ### SER ### Deutsch|Esperanto|Francaise|Linux|XML|Java|Ruby|Aikido ### http://www.germane-software.com/~ser jabber.com:ser ICQ:83578737 ### GPG: http://www.germane-software.com/~ser/Security/ser_public.gpg

23 37

ICFP 2005 - Final Call for Papers
by Benjamin C. Pierce 28 Jul '05

28 Jul '05

NEWS: * submission and formatting instructions are now available * the dates of the author response period have changed slightly --------- International Conference on Functional Programming (ICFP 2005) Call for Papers September 26-28, 2005 Tallinn, Estonia Submission deadline: 13 April, 2005 Submission instructions: http://www.cis.upenn.edu/~bcpierce/icfp05 ICFP 2005 seeks original papers on the art and science of functional programming. Submissions are invited on all topics ranging from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects and concurrency. Particular topics of interest include: * Applications and domain-specific languages: Systems programming, scientific and numerical computing, symbolic computing and artificial intelligence, databases, graphical user interfaces, multimedia programming, application scripting, system administration, distributed-systems and web programming, XML processing, security. * Foundations: Formal semantics, lambda calculus, type theory, monads, continuations, control, state, effects. * Design: Algorithms and data structures, modules and type systems, concurrency and distribution, components and composition, relations to object-oriented and logic programming. * Implementation: Abstract machines, compile-time and run-time optimization, just-in-time compilers, memory management. Interfaces to foreign functions, services, components and low-level machine resources. * Transformation and analysis: Abstract interpretation, partial evaluation, program transformation. * Software-development techniques for functional programming: Design patterns, specification, verification, validation, debugging, test generation, tracing and profiling. * Practice and experience: Functional programming in education and industry. * Functional pearls: Elegant, instructive examples of functional programming. Papers in the last three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. A special issue of the Journal of Functional Programming will highlight selected papers from the meeting. Submission instructions are available here: http://www.cis.upenn.edu/~bcpierce/icfp05 Important Dates: Submission deadline: 13 April, 2005, at 6PM (in Philadelphia) On-line response to reviews: 19-21 May, 2005 Author notification: 3 June, 2005 Camera-ready copy: 10 July, 2005 Organizers: Conference Chair: Olivier Danvy (BRICS, University of Aarhus) Program Chair: Benjamin Pierce (University of Pennsylvania) Program Committee: Mariangiola Dezani (Universita di Torino) Mary Fernandez (AT&T Labs) Matthew Flatt (University of Utah) Cedric Fournet (Microsoft Research) Jacques Garrigue (Kyoto University) Jason Hickey (California Institute of Technology) John Hughes (Chalmers University) Johan Jeuring (Utrecht University) Frank Pfenning (Carnegie Mellon University) Benjamin Pierce (University of Pennsylvania) Andrew Pitts (University of Cambridge) Norman Ramsey (Harvard University) Manuel Serrano (INRIA Sophia Antipolis) Peter Thiemann (Universitat Freiburg) Jan Vitek (Purdue University)

2 1

WS-FM 2004 Call For Participation
by Mario Bravetti 20 Jul '05

20 Jul '05

---------------------------------------------------------------------- We apologize if you receive multiple copies of this announcement. ---------------------------------------------------------------------- ====================================================================== 1st International Workshop on Web Services and Formal Methods (WS-FM 2004) February 23-24, 2004, Pisa, Italy Workshop affiliated to COORDINATION 2004, February 24-27, 2004 WS-FM 2004 homepage: http://www.cs.unibo.it/~lucchi/ws-fm04/ ====================================================================== - The technical program is available at: http://www.cs.unibo.it/~lucchi/ws-fm04/ - Information about registration, travel and accomodation can be found at the COORDINATION 2004 web site: http://www.di.unipi.it/Coordination2004/ If you intend to participate, we recommend you to register and book the hotel as soon as possible. The Coordination 2004 Organizing Committee informed us that hotels are going to be fully booked in short time.

1 1

Instance declaration of classes with method type constraints
by Johan Holmquist 30 Jun '05

30 Jun '05

Hi, How do you instantiate from classes with method type constraints, such as this one: class C a where m :: (Num b) => a -> b ?? I have been trying for some time now but everything I have tried fails. In particular, what I want to do is something like this: class Rect a where width :: (Num b) => a -> b height :: (Num b) => a -> b data Num a => PRect a = PRect (a, a) (a, a) deriving (Eq, Show) data IRect = IRect (Int, Int) (Int, Int) deriving (Eq, Show) instance Rect IRect where width ( IRect (x1, _ ) (x2, _ ) ) = abs(x2 - x1) height ( IRect ( _, y1) ( _, y2) ) = abs(y2 - y1) In this case, efforts to intantiate IRect from Rect fails with error messages like: (using GHCI) -----8<----- classtest2.hs:29: Cannot unify the type-signature variable `b' with the type `Int' Expected type: b Inferred type: Int In the expression: x2 - x1 In the first argument of `abs', namely `(x2 - x1)' -----8<----- Again, what should I do to make this work? Also, how is the PRect type to be instantiated? Regards /johan

4 5

PhD position in Monadic Computational Logics
by Lutz Schroeder 30 Jun '05

30 Jun '05

A 3-year PhD-Position is available in the project "Monadic Computational Logics in HOL" at the University of Bremen. The project is concerned with the implementation and further development of monadic computational logics, including monadic Hoare logic and monadic dynamic logic as well as extensions covering exception handling, as introduced by Till Mossakowski and myself. More detailed information can be found at http://www.informatik.uni-bremen.de/~lschrode/research/projects/HOL-MDL_e.h… Applications or further enquiries may be e-mailed to my address below. -- Lutz -- ----------------------------------------------------------------------------- Lutz Schroeder Phone +49-421-218-4683 Dept. of Computer Science Fax +49-421-218-3054 University of Bremen lschrode(a)informatik.uni-bremen.de P.O.Box 330440, D-28334 Bremen http://www.informatik.uni-bremen.de/~lschrode -----------------------------------------------------------------------------

1 0

[Announcement] PhD Scholarship at St Andrews
by Kevin Hammond 30 Jun '05

30 Jun '05

The School of Computer Science has one vacancy for an EPSRC funded 3-year PhD scholarship. Applicants must have a first class or upper second degree (or the equivalent from an overseas institution), and must fulfill the EPSRC citizenship requirements (roughly, they must be citizens of the UK or another EU country and be resident in the EU). We would obviously welcome applications from those who were interested in functional programming and Haskell. General school information below. Note that time is limited! Kevin Hammond, Roy Dyckhoff and James McKinna Postgraduate Places for 2005 in the School of Computer Science Well qualified students are sought for EPSRC funded PhD places for next year. You are encouraged to contact potential supervisors and discuss your interests before applying. We are particularly interested in applications from students interested in Computer Vision and Graphics, but eligible applicants from any area of Computer Science are encouraged to apply. Eligible UK applicants can expect a generous tax free maintenance award (£12K in 2005-6) and both EU and UK applicants are eligible for full payment of fees. In addition, first class applicants are eligible for the St Andrews Excellence Award, which provides an additional £2K in the first year of study. Computer Science at St Andrews obtained a 5 rating in the last Research Assessment Exercise, and is consistently rated in the top 10 CS departments in the UK. See http://www.dcs.st-and.ac.uk/news/parc.php for more details. For more information about the PG opportunities in the School please see http://www.dcs.st-and.ac.uk/postgrad/. For admissions procedures and forms please see http://www.dcs.st-and.ac.uk/postgrad/prospective/admissions.php for more information.

1 0

Final Call for Participation: ForTIA Industry Day at FM'05
by events-admin＠fmeurope.org 30 Jun '05

30 Jun '05

(Advance apologies for receiving multiple copies) Dear colleagues, It is a pleasure for us to announce the final program for the Industry Day at the upcoming Formal Methods'05 conference, University of Newcastle Upon Tyne, UK. I-day is organised by the Formal Techniques Industrial Association as a parallel track to the main academic symposium and will be held on Wednesday 20 July 2005. We have been able to secure a top-notch list of speakers: John Harrison from Intel, Christian Scheidler from Daimler Chrysler, Alexander Pretschner from ETH Zurich, Wolfram Schulte from Microsoft Research, Guy Broadfoot from Verum and Gerrit Muller from the Embedded Systems Institute. And of course the keynote speaker of the FM'05 symposium: prof. Mathai Joseph of the Tata Research Development and Design Centre. This year, the I-Day theme is: "Formal Methods Going Mainstream - Costs, Benefits and Experiences" and we are sure that the speakers will challenge this provocative title. To ensure the dialogue with the audience, we will close I-day with a panel session including all presenters. We look forward to this event and we hope that you will join the debate! The full Industry Day programme can be found at: http://www.fortia.org/iday05 Details on the academic symposium, tutorials, workshops and other co-located events, travel and registration details and on-line hotel booking information can be found at: http://www.csr.ncl.ac.uk/fm05 Note: if you register for the academic programme then I-Day is free of charge! See you all at Newcastle! Marcel Verhoef Bernhard Schaetz _______________________________________________ events mailing list events(a)fmeurope.org http://www.fmeurope.org/mailman/listinfo/events

1 0

Commerical Users of Functional Programming Workshop 2005
by Andy Moran 29 Jun '05

29 Jun '05

[ Apologies for multiple postings; please forward to potentially interested parties ] CUFP 2005 THE SECOND COMMERCIAL USERS OF FUNCTIONAL PROGRAMMING WORKSHOP Talinn, Estonia September 24th 2005 Co-located with ICFP Functional languages have been under academic development for over 25 years, and are still proving to be very fertile ground for programming language research. Consequently, most of the development focus of these languages is driven by academic and theoretical questions. More recently, however, functional languages have been very successfully used in commercial, industrial, and government settings, where their advantages have been able to be leveraged dramatically. The goal of CUFP is to act as a voice for commercial users of functional programming languages and technology. It aims to help functional programming become increasingly viable as a technology for use in the commercial, industrial, and government space, by providing a forum for FP professionals to share their experiences and ideas, whether business, management or engineering. It also aims to enable the formation and cementing of relationships and alliances that further the commercial use of functional languages. Providing user feedback to language designers and implementors is not a primary goal of the workshop, though it will be welcome if it occurs. Program plans ------------- The meeting will last a full day, with a mix of invited and submitted presentations, plus discussion sessions. Topics will range over a wide area, including: * Case studies both of successful and unsuccessful uses of functional programming; * Business opportunities and risks from using functional languages; * Enablers for functional language use in a commercial setting; * Barriers to the adoption of functional languages, and * Mitigation strategies for overcoming limitations of FP. There will be no published proceedings, as the meeting is intended to be more a discussion forum than a technical interchange. A full report of last year's workshop will appear in the Functional Programming column of SIGPLAN Notices. See http://www.galois.com/cufp/ for more information, including last year's schedule and a report describing last year's workshop. This year's schedule will also be available there soon. Submissions ----------- Submissions by prospective speakers or suggestions for speakers are welcome! Just send an e-mail to cufp at galois.com with an outline of what you'd like to talk about or what you think your suggestee should give a talk about. Program Committee ----------------- Mike Ashley: Mike.Ashley at sagian.com Jim Grundy: Jim_Grundy at ichips.intel.com Xavier Leroy: Xavier.Leroy at inria.fr Simon Peyton Jones: simonpj at microsoft.com Ulf Wiger: ulf.wiger at ericsson.com Andy Moran: moran at galois.com John Launchbury: john at galois.com (Chair) -- Andy Moran Phone: 503.626.6616, x113 Galois Connections Inc. Fax: 503.350.0833 12725 SW Millikan Way, Suite #290 http://www.galois.com Beaverton, OR 97005 moran(a)galois.com

1 0

Re: ANNOUNCE: GHC survey results
by Ketil Malde 29 Jun '05

29 Jun '05

Jim Apple <japple(a)freeshell.org> writes: > robert dockins wrote: >>> Why remove a feature from a product? Why not, instead, just choose >>> to not use it? >> Because the feature complicates the product, increases maintainance >> costs, and keeps the maintainers from working on other things people >> care more about? > That's fair. I just hope the implicit parameter implementation is > orthogonal enough that it's worth keeping around. Since there were also some hints about starting to use darcs, perhaps it would be possible to maintain a separate branch with the more experimental features? Or will they be too intrusive (and keeping the "experimental" branch in sync with developments from the "trunk" will cause too many conflicts)? -k -- If I haven't seen further, it is by standing in the footprints of giants

1 0