http://blog.gmane.org/gmane.comp.lang.haskell.general hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://comments.gmane.org/gmane.comp.lang.haskell.general/16452 [Note the revised full paper submission date.] CALL FOR PAPERS DAMP 2009: Workshop on Declarative Aspects of Multicore Programming Savannah, GA, USA (co-located with POPL 2009) January 20, 2009 ABSTRACT SUBMISSION DEADLINE: OCTOBER 10 http://www.cse.unsw.edu.au/~pls/damp09/ Important Dates: Deadline for abstract submission: October 10, 2008 Deadline for full paper submission: October 14, 2008 Notification of acceptance: November 10, 2008 Final papers due: November 17, 2008 DAMP 2009: January 20, 2009 DAMP 2009 is the fourth in a series of one-day workshops seeking to explore ideas in programming language design that will greatly simplify programming for multicore architectures, and more generally for tightly coupled parallel architectures. DAMP 2009 is co-loc Manuel M T Chakravarty 2008-10-07T10:43:41 http://comments.gmane.org/gmane.comp.lang.haskell.general/16449 I've now uploaded my SourceGraph program to Hackage [1]. It's rather simple at the moment, but if you pass in the .cabal file as a parameter (e.g. run it as "SourceGraph Foo.cabal"), it will create in the same directory as the .cabal file a Directory called "SourceGraph" that contains an html report of some basic graph-theoretic analysis of your code. The output format isn't ideal, but it should serve it's purpose for now (I'll fix it up and actually make it usable once my Thesis has been handed in). What I'd appreciate if people could try it out and tell me if there's any code, etc. that it can't parse. At the moment, it ignores all Data-based functions (e.g. class and instance declarations as well as record functions) and only looks at "stand-alone" functions (i.e. normal functions). SourceGraph requires version 0.3 of my Graphalyze library (version 0.2 added the reports in, but had some bugs that 0.3 fixes). [1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/SourceGraph Ivan Miljenovic 2008-10-05T16:53:43 http://comments.gmane.org/gmane.comp.lang.haskell.general/16447 F I N A L C A L L F O R P A P E R S === P E P M 2009 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.clip.dia.fi.upm.es/Conferences/PEPM09 January 19-20, 2009 Savannah, Georgia, USA (Affiliated with POPL 2009) IMPORTANT DATES Abstract due: October 12, 2008 Submission: October 17, 2008 Author Notification: November 10, 2008 Camera-Ready Paper: November 17, 2008 SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. PEPM is classified as category A in the CORE ranking German Vidal 2008-10-03T10:43:11 http://comments.gmane.org/gmane.comp.lang.haskell.general/16445 _______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell Amal Ahmed 2008-10-01T20:00:49 http://comments.gmane.org/gmane.comp.lang.haskell.general/16443 Hi everyone, I am glad to announce the 3.0 release of ForSyDe's implementation, now available from HackageDB. The ForSyDe (Formal System Design) methodology has been developed with the objective to move system design (e.g. System on Chip, Hardware and Software systems) to a higher level of abstraction. ForSyDe is implemented as a Haskell-embedded behavioral DSL (Domain Specific Language). embedded compiler. We have also published tutorial which should be much more user-friendly than the Haddock documentation and the ForSyDe research papers. ForSyDe includes two DSL flavours which offer different features: 1) Deep-embedded DSL (ForSyDe.Signal) Deep-embedded signals, based on the same concepts as Lava, are aware of the system structure. Based on that structural information ForSyDe's embedded compiler, can perform different analysis and transformations. o Thanks to Template Haskell, computations are expressed in Haskell, not needing to specifically design a DSL for t Alfonso Acosta 2008-10-01T11:29:38 http://comments.gmane.org/gmane.comp.lang.haskell.general/16442 I'd like to announce the initial release of my graph-theoretic analysis library, Graphalyze [1], the darcs repo for which is also available [2]. This is a pre-release of the library that I'm writing for my mathematics honours thesis, "Graph-Theoretic Analysis of the Relationships in Discrete Data". I'll also be releasing a tool that uses this library to analyse the structure of Haskell code, that I'm tentatively calling SourceGraph. As it stands, the library has a number of algorithms included, some of which I've developed from scratch (e.g. clique finder), and others are implementations of published algorithms (mainly the two clustering algorithms). The code is meant to be more readable than efficient, and I wanted to explore ways of developing algorithms that match more closely the way graphs work (which makes FGL a much nicer fit than matrix-based or list-based graph data structures). This library is only a pre-release, as whilst everything in there works (at least it does for me), I'd like to get so Ivan Miljenovic 2008-09-29T16:11:58 http://comments.gmane.org/gmane.comp.lang.haskell.general/16440 Guerilla videos of the Haskell Symposium 2008 presentations. Enjoy. Regards, Malcolm _______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell Malcolm Wallace 2008-09-27T20:16:42 http://comments.gmane.org/gmane.comp.lang.haskell.general/16438 The ICFP programming contest results presentation: http://video.google.com/videoplay?docid=-4697764813432201693 Feel free to pass on this link to any other appropriate forum. Regards, Malcolm Malcolm Wallace 2008-09-24T05:06:05 http://comments.gmane.org/gmane.comp.lang.haskell.general/16429 C a l l f o r P a p e r s DAMP 2009: Workshop on Declarative Aspects of Multicore Programming Savannah, Georgia, USA --- January 20, 2009 (co-located with POPL 2009) DAMP 2009 is the fourth in a series of one-day workshops seeking to explore ideas in programming language design that will greatly simplify programming for multicore architectures, and more generally for tightly coupled parallel architectures. DAMP 2009 is co-located with the ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL 2009). The emphasis will be on functional and (constraint-)logic programming, but any programming language ideas that aim to raise the level of abstraction are welcome. DAMP seeks to gather together researchers in declarative approaches to parallel programming and to foster cross fertilization across different approaches. For further information, a CFP flyer, and details on paper submissions, see http://www.cse.unsw Manuel M T Chakravarty 2008-09-18T14:17:17 http://comments.gmane.org/gmane.comp.lang.haskell.general/16425 For all interested in Haskell GUIs, there is now a second preview release of qtHaskell - a set of Haskell bindings for Trolltech's Qt available at http://qthaskell.berlios.de There are a number of important changes from the previous version. 1. All FFI pointers are now Foreign Pointers. Those of a type derived from QObject are wrapped as QPointer types and only this wrapper is deleted when their finalizer runs. All other types are automatically deleted by their finalizer when they go out of Haskell scope - or more precisely when the finalizer acutally runs. To make the actual deletion time more easily controlable, most example code uses the function "returnGC" instead of just "return" in callback functions. Also non QObject derived types can be constructed with an alternative constructor qSomeObject_nf which has no finalizer. In this case it's the programmers job to delete the object when required. 2. All Qt enumerated types are implemented as equivalent Haskell types instead of jus David Harley 2008-09-15T22:11:40 http://comments.gmane.org/gmane.comp.lang.haskell.general/16422 _______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell Sittampalam, Ganesh 2008-09-12T20:22:23 http://comments.gmane.org/gmane.comp.lang.haskell.general/16420 _______________________________________________ Haskell mailing list Haskell< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell Wouter Swierstra 2008-09-11T13:32:37 http://comments.gmane.org/gmane.comp.lang.haskell.general/16418 CC 2009 International Conference on Compiler Construction March 22-29, York, United Kingdom Invited Speaker: Vivek Sarkar (Rice University, US) Part of ETAPS 2009 http://www.brics.dk/~mis/CC2009/ CC is a premier forum for presenting research on compilers in the broadest possible sense, including run-time techniques, programming tools, domain-specific languages, novel language constructs and so on. In recent years CC has seen a healthy increase in the number of submissions, in line with its broad outlook; its typical acceptance rate is 20-25%. CC is part of ETAPS, and this year it is held in York (UK), March 22-29 2009. The program committee would particularly welcome submissions from researchers in functional programming on any topic relating to analysis, optimisation and compilation of Haskell programs Abstracts are due on October 2, and the deadline for full paper submission is October 9. Prospective authors are welcome to contact the program chairs, Oege.de.Moor< at >comlab.ox.ac.uk 2008-09-10T10:31:18 http://comments.gmane.org/gmane.comp.lang.haskell.general/16417 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 WLPE-08 2008-09-10T09:12:48 http://comments.gmane.org/gmane.comp.lang.haskell.general/16415 Hi, By popular demand, the deadline has been extended to the 11th. Please submit! Andy Gill ---------------------------------------------------------------------------------- CALL FOR PAPERS!!! Eleventh International Symposium on Practical Aspects of Declarative Languages 2009 (PADL '09) http://cs.utdallas.edu/padl09/ Savannah Georgia, USA January 19-20, 2009 Co-located with ACM POPL'09 Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to vastly different real-world situations, ranging from data base management to active networks to software engineering to decision support systems. New developments in theory and implementation have opened up new application areas. At the same time, applications of declarative languages to novel problems raise numerous interesting research issues. Well-known questions include designing for scalability, languag Andy Gill 2008-09-08T12:30:09 http://comments.gmane.org/gmane.comp.lang.haskell.general/16413 +--------------------------------------------------------------------+ 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 Matthew Fluet (ICFP Publicity Chair 2008-09-02T14:06:42 http://comments.gmane.org/gmane.comp.lang.haskell.general/16411 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 WLPE-08 2008-09-02T11:02:09 http://comments.gmane.org/gmane.comp.lang.haskell.general/16410 ******************************************************** * 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 Samir Genaim 2008-09-02T08:19:36 http://comments.gmane.org/gmane.comp.lang.haskell.general/16409 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 oleg< at >okmij.org 2008-09-02T07:57:18 http://comments.gmane.org/gmane.comp.lang.haskell.general/16406 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 Ashley Yakeley 2008-09-01T09:58:35 http://comments.gmane.org/gmane.comp.lang.haskell.general/16405 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 oleg< at >okmij.org 2008-09-01T02:40:41 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.lang.haskell.general