gmane.comp.lang.haskell.general

ICFP09 Announcement

Matthew Fluet (ICFP Publicity Chair — 2008-09-02T14:06:42

+--------------------------------------------------------------------+ ANNOUNCEMENT The 14th ACM SIGPLAN International Conference on Functional Programming ICFP 2009 31st August - 2nd September 2009 Edinburgh, United Kingdom ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. ICFP 2009 will be held in Scotland's historic capital city of Edinburgh, during the final week of the Edinburgh International Festival. Further information is available from: http://www.cs.nott.ac.uk/~gmh/icfp09.html Graham Hutton General Chair, ICFP 2009 +--------------------------------------------------------------------+ | Dr Graham Hutton Email : gmh< at >cs.nott.ac.uk | | Functional Programming Lab | | Schoo

WLPE'08 - Call for Papers

WLPE-08 — 2008-09-02T11:02:09

WLPE'08 -- Call for Papers The 18th Workshop on Logic-based methods in Programming Environments http://www.clip.dia.fi.upm.es/Conferences/WLPE08/ December 9th-13th 2008, Udine, Italy (Satellite Workshop of ICLP 2008) The 18th Workshop on Logic-based methods in Programming Environments will take place in Udine (Italy), as a satellite workshop of ICLP 2008, the 24th International Conference on Logic Programming. This workshop will continue the series of successful international workshops on logic programming environments held in Ohio, USA (1989), Eilat, Israel (1990), Paris, France (1991), Washington D.C., USA (1992), Vancouver, Canada (1993), Santa Margherita Ligure, Italy (1994), Portland, USA (1995), Leuven, Belgium (1997), Las Cruces, USA (1999), Paphos, Cyprus (2001), Copenhagen, Denmark (2002), Mumbai, India (2003), Saint Malo, France (2004), Sitges (Barcelona), Spain (2005), Seattl

BYTECODE09: 1st Call for Papers

Samir Genaim — 2008-09-02T08:19:36

******************************************************** * 1st Call for Papers * * * * Fourth Workshop on Bytecode Semantics, * * Verification, Analysis and Transformation * * * * York, UK, 29th March 2009, part of ETAPS 2009 * * * * Venue: The University of York * * * * http://www.clip.dia.fi.upm.es/Conferences/BYTECODE09 * * * ******************************************************** Important Dates =============== Paper Submission December 21, 2008 Notification January 25, 2009 Final Version February 8, 2009 Workshop March 29, 2009 Wor

The final view on typed sprintf and sscanf

2008-09-02T07:57:18

It would be remiss not to mention the dual solution to the problem of typed sprintf and sscanf sharing the same formatting specification. The previous message defined the embedded domain-specific language of formatting specifications in the initial style, as a data type. The language can also be defined in the final style. To the end user, the difference is hardly noticeable: all the tests of the previous message work as they are (modulo a few adjustments caused by the monomorphism restriction). However, whereas the initial style required GADT, the final solution is entirely in Haskell98. One often hears that hardly anything interesting can be written in Haskell98. I submit that implementing type-indexed terms, thought to require GADTs or similar dependent-type-like extensions, ought to count as interesting. Again, the formulation of the problem and the end-user interface remain exactly the same as described in the previous message. Here are a few examples: The only difference is the dummy unit argumen

Re: Linking Multiple Versions of the Same Package

Duncan Coutts — 2008-09-01T12:41:36

It does not stop you. It's a warning. The reason it warns is because almost every use of multiple versions of a package is a mistake. We do not currently have a mechanism to see which uses are deliberate or obviously safe so Cabal has to be conservative. Duncan

Re: Linking Multiple Versions of the Same Package

Ashley Yakeley — 2008-09-01T10:02:27

Sorry, that was accidentally sent early, and after I discovered that package versions are in fact recorded in External Core names. Please ignore...

Linking Multiple Versions of the Same Package

Ashley Yakeley — 2008-09-01T09:58:35

I tried doing this out of curiosity. Package B links to version 0.1 of open-witness, while package C links to B and version 0.1.1 of open-witness. Cabal stopped me when doing "cabal configure" in C: $ cabal configure Configuring C-0.1... Warning: This package indirectly depends on multiple versions of the same package. This is highly likely to cause a compile failure. package B-0.1 requires open-witness-0.1 package C-0.1 requires open-witness-0.1.1 It appears the issue is that package versions are not recorded in External Core names. Thus

The initial view on typed sprintf and sscanf

2008-09-01T02:40:41

We demonstrate typed sprintf and typed sscanf sharing the same formatting specification. Our solution is surprisingly trivial: it defines a simple embedded domain-specific language of formatting patterns. The functions sprintf and sscanf are two interpreters of the language, to build or parse a string according to the given pattern. Our solution relies only on GADTs. We demonstrate that lambda-abstractions at the type level are expressible already in the Hindley-Milner type system; GADT with the included polymorphic recursion help us use the abstractions. The typed sprintf takes the formatting specification and several arguments and returns the formatted string. The types and the number of arguments depend on the formatting specification. Conversely, the typed sscanf parses a string according to the formatting specification, passing parsed data to a consumer function. Again, the number and the types of the arguments to the consumer depend on the formatting specification. The typed sprintf problem has been

TLDI 2009 Call for Papers

Amal Ahmed — 2008-09-01T02:18:30

_______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: Compiler Construction course using Haskell?

Andreas Abel — 2008-08-31T20:05:32

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Dear Johannes, Hans-Wolfgang Loidl and I have given a course on compiler construction using Andrew Appel's book. There was free choice of the implementation language, and we had Java (2 teams and Hans-Wolfgang), python (one team), and Haskell (me). http://www.tcs.ifi.lmu.de/lehre/WS07-08/Compiler/schedule.html (German) I found Haskell very pleasent to use. However, one traversal of the abstract syntax tree did not suffice to generate Intel code. We used an intermediate language on which one can perform optimizations, a greedy instruction selector, and then liveness analysis and graph coloring for register allocation. We developed some tools to support the compiler development, such as an interpreter for the intermediate language and one for a relevant subset of the 386 assembly language (all programmed in Haskell). Cheers, Andreas Johannes Waldmann wrote: - -- Andreas Abel <>< Du bist der geliebte Mensch. Theoretical Computer Science, Universit

Final CFP and extended deadline IFL 2008

Sven-Bodo Scholz — 2008-08-26T17:26:38

******************************************************************************** * * FINAL CALL FOR PAPERS -- EXTENDED DEADLINE!! * CALL FOR PARTICIPATION * * 20th International Symposium on the * Implementation and Application of Functional Languages * IFL 2008 * 10-12.Sept 2008, Hatfield UK * * http://events.sac-home.org/ifl2008/ * ******************************************************************************** UPDATED DEADLINES: * Submission for draft proceedings: NOW 1. Sept * Early Registration: NOW 2. Sept Please note, that the draft proceedings do NOT require full papers; extended abstracts will be considered too. ******************************************************************************** The aim of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based

Re: Top Level <-

Derek Elkins — 2008-08-26T16:14:21

Haskell should be moving -toward- a capability-like model, not away from it.

Re: Top Level <-

Bulat Ziganshin — 2008-08-26T15:01:30

Hello Ashley, Monday, August 25, 2008, 3:12:18 AM, you wrote: yes, definitely. as it's hard to develop "real" app w/o using global vars, h98 still remains "unreal" language but from my POV it's important to push this feature into haskell standard

Re: Top Level <-

Edward Kmett — 2008-08-25T14:43:36

_______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell

Top Level <-

Ashley Yakeley — 2008-08-24T23:12:18

Is there any interest in implementing a top level "<-" to run monadic code? Currently this sort of thing is done with unsafePerformIO and switching off inlining with some pragma. Indeed, the 'atomically' haddock actually advises doing this to declare top-level TVars. The same trick is used in the source of Data.Unique and System.Random. This is bad Haskell. To avoid observation of effects, etc., we would need a new monad rather than IO. There would be equivalents of IO functions such as these: newIORef newMVar newTVarIO newUnique I can think of two uses: 1. Global mutable state. For instance, here's the count variable for Data.Unique rewritten: uniqSource :: MVar Integer uniqSource <- newMVarTL 0 Isn't that much nicer? 2. Solving the expression problem using open witnesses, a recent hobby-horse of mine. For instance, here's a simple scheme for extensible exceptions using top-level "<-": -- declare exception carrying

Re: Compiler Construction course using Haskell?

Norman Ramsey — 2008-08-22T22:53:51

> > In Fall 2006 I gave a graduate course in advanced functional programming > > in which the default project was a compiler from a functional language of > > the student's own design to the 2D circuit language invented by the Cult > > of the Bound Variable... > > .... Would you happen to have a > syllabus or other course material available online? Yes: http://www.cs.tufts.edu/~nr/cs252r/ Norman

Re: Compiler Construction course using Haskell?

Arnar Birgisson — 2008-08-22T10:04:59

As a student, I find this very interesting. Would you happen to have a syllabus or other course material (list of papers, assignments, etc.) available online? cheers, Arnar

Another First course in Haskell

Piyush P Kurur — 2008-08-22T03:53:47

Hi, I am planing a haskell based functional programming course. It is supposed to be a first course and I intend to show how real world applications can be built quite easily in haskell. Goals: 1) Cover all the basics like recursion, interesting data structures like zippers, monads 2) Haskell programming environment: by this I mean things like ghci, hadock, cabal The students after the course should seriously consider Haskell as a programming language for implementing their final year projects. In this aspect if one can convince that things like web-programming cgi scripting, networking, compiler projects, which are the favorits for programming projects, are better done in Haskell than in traditional languages like C and Java that would be a success. The course will be taken by mostly Computer Science undergrads. Any feed back is really welcome. I have about 2-3 months to plan the course. Regards ppk

Re: Compiler Construction course using Haskell?

Norman Ramsey — 2008-08-22T02:46:00

> I plan to give a course in compiler construction, > using Haskell as the implementation language > (not as source or target language). > > Something along these lines: > 1. combinator parsers (Parsec), > 2. simple interpreter (arithmetical expressions) > 3. add algebraic data types, functions > 4. type checker > 5. code generator. > Ideally, 2..5 would be using the very same tree traversal code > and just change the monad for evaluation. > > Any comments appreciated. Have you given such a course? Taken? In Fall 2006 I gave a graduate course in advanced functional programming in which the default project was a compiler from a functional language of the student's own design to the 2D circuit language invented by the Cult of the Bound Variable. The project was primarily an excuse to read papers about parsing combinators, polymorphic typed defunctionalization, A-Normal Form, generics for the masses, linear types, and so on, and to implement all that stuff in Haskell. This all worked out tole

Re: Fwd: Haskell job opportunity: Platform Architect at

Benjamin L. Russell — 2008-08-21T06:23:49

On Wed, 20 Aug 2008 20:12:00 +0200, "Johan Tibell" gmail.com> wrote: Let me know if you want to hire somebody for writing/documentation work on a telecommuting basis. Perhaps I could help market your product in Tokyo, since I live there. :-)

Re: Re:Fwd: Haskell job opportunity: Platform Architect at

Jason Dusek — 2008-08-20T23:57:49

Let's make World of Warcraft! -- _jsn