September 2012 - Haskell

Invitation to connect on LinkedIn
by Daneel van Tonder via LinkedIn 12 Sep '12

12 Sep '12

LinkedIn ------------ Daneel van Tonder requested to add you as a connection on LinkedIn: ------------------------------------------ Adrian, I'd like to add you to my professional network on LinkedIn. - Daneel Accept invitation from Daneel van Tonder http://www.linkedin.com/e/-y1615u-h70cw6t9-4p/A5eR2FIG5M9-4jk43rQ4JqtVY2yX2… View profile of Daneel van Tonder http://www.linkedin.com/e/-y1615u-h70cw6t9-4p/rso/67346300/kX8n/name/144943… ------------------------------------------ You are receiving Invitation emails. This email was intended for Adrian Borucki. Learn why this is included: http://www.linkedin.com/e/-y1615u-h70cw6t9-4p/plh/http%3A%2F%2Fhelp%2Elinke… (c) 2012, LinkedIn Corporation. 2029 Stierlin Ct, Mountain View, CA 94043, USA.

1 0

ANNOUNCE: GHC version 7.6.1
by Ian Lynagh 09 Sep '12

09 Sep '12

============================================================= The (Interactive) Glasgow Haskell Compiler -- version 7.6.1 ============================================================= The GHC Team is pleased to announce a new major release of GHC, 7.6.1. Here are some of the highlights of the 7.6 branch since 7.4: * Polymorphic kinds and data promotion are now fully implemented and supported features. * Windows 64bit is now a supported platform. * It is now possible to defer type errors until runtime using the -fdefer-type-errors flag. * The RTS now supports changing the number of capabilities at runtime with Control.Concurrent.setNumCapabilities. Full release notes are here: http://www.haskell.org/ghc/docs/7.6.1/html/users_guide/release-7-6-1.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://hackage.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://hackage.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://hackage.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://hackage.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug

5 4

ANNOUNCE: fugue
by Alec 07 Sep '12

07 Sep '12

Hi all, Fugue is (yet) another contribution to the thriving cottage industry of alternate preludes. The goals for this one include minimal dependencies (currently nothing outside of base), minimal new functionality (there is, as yet, not a single line of original code other than module import and export wrangling), and measured exuberance in bringing useful and unoffensive names into scope. Effectively, fugue is a Prelude for those times when one wants a bit more out of the Haskell libraries without having to ask for them. It's happened often enough that I've wanted (<$>), isJust, forM, and (<>) in the same file that I thought it might be nice to write one import instead of four or so. I honestly have no idea whether this is a good idea or not; it's certainly not intended to be particularly clever, just convenient. The code's on github at https://github.com/deviant-logic/fugue. I'd welcome any suggestions for improvements or dire warnings explaining how polluting the namespace will destroy everything that is pure and good in this world. If I don't hear any reasonable objections, I'll toss it up on hackage in a day or two. -A

1 0

ANNOUNCE: haskell-src-exts 1.13.5
by Niklas Broberg 07 Sep '12

07 Sep '12

Fellow Haskelleers, I'm pleased to announce the release of haskell-src-exts-1.13.5! * On hackage: http://hackage.haskell.org/package/haskell-src-exts * Via cabal: cabal install haskell-src-exts * Darcs repo: http://code.haskell.org/haskell-src-exts There are two primary reasons for this release: 1) to add the requested support for UHC's 'js' FFI calling convention (in 1.13.4), and 2) to export a stand-alone token stream lexer (in 1.13.5). NOTE: If after reading the above, you think "wow, a token stream lexer, I'll use that for some kind of refactoring tool", then you're most likely wrong. Please contact me in that case and I'll tell you why. :-) A probably unnecessary warning: This release may fail to parse some files that were previously possible to parse, if they included RULES pragmas using 'forall' as a varid. I really doubt any such exist, and they would not have been accepted by GHC if they did, so I sincerely doubt that anyone will be effected by this. Changelog: 1.13.4 --> 1.13.5 =============== * Expose Language.Haskell.Exts.Lexer, which implements a standalone token stream lexer. The module is re-exported both by Language.Haskell.Exts and by Language.Haskell.Exts.Annotated. 1.13.3 --> 1.13.4 =============== * Fix bug where operators starting with # written in parentheses would not be parsed when UnboxedTuples is turned on. Now works. * Allow 'family' and 'forall' as (non-type) varid's. This adds one more shift/reduce conflict to the parser, and its resolution means that '{-# RULES "name" forall = ... #-}' is not allowed. * Complete the set of FFI calling conventions from the Haskell 2010 report (even if no compiler implements them). Also include the 'js' calling convention, supported by UHC. Cheers, /Niklas

1 0

Call for papers: HiPEAC Workshop FD-COMA 2013
by Clemens Grelck 06 Sep '12

06 Sep '12

=========================================================================== Call for Papers 2nd Workshop on Feedback-Directed Compiler Optimization for Multi-Core Architectures FD-COMA 2013 Jan 22, 2013 8th HiPEAC Conference Berlin, Germany Jan 21-23, 2013 http://www.project-advance.eu/2012/07/fd-coma-workshop-2013/ http://www.hipeac.net/conference =========================================================================== FD-COMA is a half-day workshop during the 8th HiPEAC Conference in Berlin, January 21-23, 2013. The workshop is loosely connected to the FP-7 project Advance, but we particularly welcome contributions from outside the project consortium. =========================================================================== Mission: Feedback driven optimizations have long proven to be powerful instruments for achieving better hardware utilization, but the on-going multi-core and many-core revolution opens up a whole new realm of possible applications and variations of feedback-directed compiler optimization. The increasing hardware diversity of execution platforms and the likewise increasing hardware heterogeneity of individual execution platforms make compile time resource planning less and less feasible. Dynamic compilation techniques are required, instead, that adapt application programs to the actual hardware they are running on to make best use of it. Furthermore, the abundance of compute cores allows us to run feedback-directed compiler optimizations in parallel with an application itself and, thus, to adapt a running application to the hardware it is running on or to the data it is processing, to name just a few opportunities. This workshop aims at bringing people together that share an interest in the novel opportunities for feedback directed optimisations in the context of the emerging heterogeneous architectures. =========================================================================== Main topics: + Feedback directed compiler optimization for multi-core architectures + Data representation for runtime feedback information + Performance modelling for feedback, including statistical and constraint-based techniques + Performance measurement techniques suitable for dynamic feedback + Exploiting feedback for improved scheduling and improved mapping + Adaptive, feedback-controlled runtime systems for multi-core architectures + Exploiting feedback information for energy savings =========================================================================== FD-COMA welcomes submission of papers describing: + Experimental work + Industrial experience + Theoretical work + Software and hardware platforms + Work in progress all with respect to the above workshop topics =========================================================================== Paper submission: Submitted papers must not have been published or simultaneously submitted elsewhere. The full manuscript should be at most 8 pages in ACM SIGPLAN double column format. Submit a PDF copy of your manuscript via EasyChair: https://www.easychair.org/conferences/?conf=fdcoma2013 . Each paper will receive a minimum of two reviews. Papers will be selected based on their originality, relevance, technical clarity and presentation. Authors of accepted papers must guarantee that their papers will be registered and presented at the workshop. Accepted papers will be made available in printed form during the shop as well as in electronic form on the workshop homepage and as part of the HiPEAC conference materials. =========================================================================== Important dates: Submission deadline: 12/10/2012 Notification of acceptance: 12/11/2012 Final version due: 8/12/2012 =========================================================================== Workshop organizers: Clemens Grelck, University of Amsterdam, Netherlands Kevin Hammond, University of St Andrews, United Kingdom Sven-Bodo Scholz, Heriot-Watt University, United Kingdom =========================================================================== -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 University Lecturer 1098XH Amsterdam Netherlands University of Amsterdam Institute for Informatics T +31 (0) 20 525 8683 Computer Systems Architecture Group F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ----------------------------------------------------------------------

1 0

Haskell Weekly News: Issue 234
by Daniel Santa Cruz 06 Sep '12

06 Sep '12

Welcome to issue 243 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of August 26 to September 01, 2012. Quotes of the Week * companion_cube: "I don't understand this article at all" edwardk: "Well, when you finish reading it, here's a follow-up article" Top Reddit Stories * Parsing with Haskell and Attoparsec Domain: newartisans.com, Score: 64, Comments: 8 On Reddit: [1] http://goo.gl/rrlQG Original: [2] http://goo.gl/aHlTJ * FRP - Release of reactive-banana-0.7. Finally features dynamic event switching! Domain: apfelmus.nfshost.com, Score: 48, Comments: 21 On Reddit: [3] http://goo.gl/5QnBl Original: [4] http://goo.gl/8dnLg * Combinatorrent - Writing Haskell Code for Fun and Profit [InfoQ] Domain: infoq.com, Score: 46, Comments: 14 On Reddit: [5] http://goo.gl/FE4OF Original: [6] http://goo.gl/feU7U * Putting it all together -- Example project that pulls together Snap, Blaze, OpenId, IxSet, AcidState, and Sessions. Domain: self.haskell, Score: 34, Comments: 3 On Reddit: [7] http://goo.gl/huFaI Original: [8] http://goo.gl/huFaI * Invert the Inversion of Control Domain: thev.net, Score: 32, Comments: 30 On Reddit: [9] http://goo.gl/1uO5a Original: [10] http://goo.gl/89UnF * A follow up on my initial experience and why there's still something immensely attractive about Haskell Domain: binarysculpting.com, Score: 27, Comments: 19 On Reddit: [11] http://goo.gl/3RLNO Original: [12] http://goo.gl/81YF2 * Haskim -- a convenient Haskell VIM distribution Domain: github.com, Score: 25, Comments: 19 On Reddit: [13] http://goo.gl/9sJ3O Original: [14] http://goo.gl/Wq0Rq * Introducing Perdure: persistence for acyclic immutable data Domain: hackage.haskell.org, Score: 23, Comments: 12 On Reddit: [15] http://goo.gl/ACWDi Original: [16] http://goo.gl/CSi57 * Existential types and data abstraction Domain: iveselov.info, Score: 22, Comments: On Reddit: [17] http://goo.gl/K6JGl Original: [18] http://goo.gl/GBYlW * I just realized that running monads is applying a left monad action Domain: self.haskell, Score: 20, Comments: 63 On Reddit: [19] http://goo.gl/Geus4 Original: [20] http://goo.gl/Geus4 Top StackOverflow Questions * How can I recover sharing in a GADT? votes: 14, answers: 2 Read on SO: [21] http://goo.gl/I3cuW * Constructing efficient monad instances on `Set` (and other containers with constraints) using the continuation monad votes: 13, answers: 2 Read on SO: [22] http://goo.gl/Ys4Uy * Numbers as multiplicative functions (weird but entertaining) votes: 12, answers: 1 Read on SO: [23] http://goo.gl/yN8KN * Game server in Haskell votes: 10, answers: 3 Read on SO: [24] http://goo.gl/QV9de * Why doesn't sortBy take (a -> a -> Bool)? votes: 10, answers: 5 Read on SO: [25] http://goo.gl/Y7EzD * Default type instances referring to each other votes: 9, answers: 1 Read on SO: [26] http://goo.gl/6cUG7 * Applying a fixed-length-vector-function to the inital part of a longer fixed-length-vector votes: 9, answers: 2 Read on SO: [27] http://goo.gl/03KcE * Haskell: example of function of type a -> a, besides the identity votes: 9, answers: 5 Read on SO: [28] http://goo.gl/q2UDW * Stack overflow when using Haskell sort function votes: 8, answers: 2 Read on SO: [29] http://goo.gl/D31Ku * How to navigate up inside a HUET Zipper votes: 7, answers: 2 Read on SO: [30] http://goo.gl/X7dE3 * Haskell : reference to previously updated elements of list within the update function votes: 7, answers: 6 Read on SO: [31] http://goo.gl/0yRIo * Is there any way to make parsec report “shift-reduce” conflicts? votes: 7, answers: 1 Read on SO: [32] http://goo.gl/LQeDG * Haskell: how to write a monadic variadic function, with parameters using the monadic context votes: 7, answers: 1 Read on SO: [33] http://goo.gl/ThniY * Haskell parMap and parallelism votes: 7, answers: 1 Read on SO: [34] http://goo.gl/3qQHu Until next time, Daniel Santa Cruz References 1. http://newartisans.com/2012/08/parsing-with-haskell-and-attoparsec/ 2. http://www.reddit.com/r/haskell/comments/z2lir/parsing_with_haskell_and_att… 3. http://apfelmus.nfshost.com/blog/2012/08/26-frp-banana-0-7.html 4. http://www.reddit.com/r/haskell/comments/yv6ku/frp_release_of_reactivebanan… 5. http://www.infoq.com/presentations/Combinatorrent-Haskell-casestudy 6. http://www.reddit.com/r/haskell/comments/yzdyr/combinatorrent_writing_haske… 7. http://www.reddit.com/r/haskell/comments/z4iay/putting_it_all_together_exam… 8. http://www.reddit.com/r/haskell/comments/z4iay/putting_it_all_together_exam… 9. http://www.thev.net/PaulLiu/invert-inversion.html 10. http://www.reddit.com/r/haskell/comments/z4inb/invert_the_inversion_of_cont… 11. http://binarysculpting.com/2012/09/01/theres-something-about-haskell/ 12. http://www.reddit.com/r/haskell/comments/z6idz/a_follow_up_on_my_initial_ex… 13. https://github.com/jejansse/haskim 14. http://www.reddit.com/r/haskell/comments/z3orc/haskim_a_convenient_haskell_… 15. http://hackage.haskell.org/package/perdure-0.1.2 16. http://www.reddit.com/r/haskell/comments/z2sc6/introducing_perdure_persiste… 17. http://iveselov.info/posts/2012-08-30-existential-types.html 18. http://www.reddit.com/r/haskell/comments/z1ojj/existential_types_and_data_a… 19. http://www.reddit.com/r/haskell/comments/ytovd/i_just_realized_that_running… 20. http://www.reddit.com/r/haskell/comments/ytovd/i_just_realized_that_running… 21. http://stackoverflow.com/questions/12230088/how-can-i-recover-sharing-in-a-… 22. http://stackoverflow.com/questions/12183656/constructing-efficient-monad-in… 23. http://stackoverflow.com/questions/12133932/numbers-as-multiplicative-funct… 24. http://stackoverflow.com/questions/12134097/game-server-in-haskell 25. http://stackoverflow.com/questions/12152561/why-doesnt-sortby-take-a-a-bool 26. http://stackoverflow.com/questions/12199324/default-type-instances-referrin… 27. http://stackoverflow.com/questions/12221080/applying-a-fixed-length-vector-… 28. http://stackoverflow.com/questions/12230820/haskell-example-of-function-of-… 29. http://stackoverflow.com/questions/12203380/stack-overflow-when-using-haske… 30. http://stackoverflow.com/questions/12129300/how-to-navigate-up-inside-a-hue… 31. http://stackoverflow.com/questions/12144973/haskell-reference-to-previously… 32. http://stackoverflow.com/questions/12170780/is-there-any-way-to-make-parsec… 33. http://stackoverflow.com/questions/12175912/haskell-how-to-write-a-monadic-… 34. http://stackoverflow.com/questions/12224842/haskell-parmap-and-parallelism

1 0

[CUFP 2012] Birds of a Feather sessions
by Ashish Agarwal 05 Sep '12

05 Sep '12

========================================================= Birds of a Feather sessions (BOFs) Commercial Users of Functional Programming Workshop (CUFP 2012) http://cufp.org/bofs-2012 Copenhagen, Denmark, September 13 - 15 ========================================================= CUFP 2012 will again include Birds of a Feather sessions as in previous years. BoFs provide a place for our community to gather informally and reach consensus on matters of importance. Any CUFP attendee can propose a BoF session, and grab one of the spare rooms in the evening slots below. Attendance in the evening is open to all. BoF sessions facilitate ad-hoc discussions and provide a place to gather and start off the chat, before moving on during the evening to a local restaurant or pub. There is no deadline for proposing a session---you can even request a room on the day---but we encourage you to do so at the earliest possible time to help us with planning and to publicize your proposed discussion. Attendees are also free to show up even if you have not confirmed, but again earlier confirmation will help us with planning. Please see http://cufp.org/bofs-2012 for details on how to propose a BoF session or confirm attendance at one of them. General information on CUFP 2012 can be found at http://cufp.org/conference/2012. The conference is co-located with ICFP. You can register for CUFP at the main ICFP website http://www.icfpconference.org/icfp2012.

1 0

Research Position, Leeds: Parallel functional visualization
by David Duke 05 Sep '12

05 Sep '12

I have an open position in the Visualization group at Leeds for a researcher to work on one of two projects, the second of which is specific to Haskell: We are seeking to appoint an ambitious researcher within the Visualization and VR group at Leeds to work on one of two projects, (i) time-varying and higher-dimensional graphs, or (ii) high-performance visualization in Haskell. The post is available immediately, and lasts until 31 July 2016. 1. Time-varying and higher-dimensional graphs. We are developing powerful tools for the topological analysis of (time-varying) volumetric datasets. These produce large graphs capturing combinatorial structures and events, and visual analysis of these graphs provides significant insight into the data. Similar structures may be found in graphs resulting from optimisation problems in multi-parameter spaces. The research will investigate (i) the link between layout aesthetics and specific tasks over time-varying data; (ii) layout techniques that respect these aesthetics, for example embedding of the graph into higher-dimensional manifolds; (iii) techniques for eliding structural detail, and linking visual abstractions to other models of the data; and (iv) efficient implementation of layout algorithms, using established toolkits (e.g. VTK), and parallelisation on cluster-based hardware and/or many-core GPU architecture. You will be working with researchers on the "Multifield Extension of Topological Analysis" project, funded recently by the EPSRC.  2. Parallel functional visualization: Scientific visualization involves the application of compute-intensive algorithms to large volumes of data, often larger than can fit into core memory. Systems are still largely based on the "pipeline" model, extended to exploit different processing technologies (multi-core CPUs, GPUs, clusters), and strategies (streaming, tiling, out-of-core processing, etc). This research concerns an innovative approach that exploits laziness and parallelism in the pure functional language Haskell. Scivis "applications" will be constructed from expressions in a declarative domain-specific language, and transformed into imagery via lower-level DSLs and strategies that coordinate use of heterogeneous resources. Both projects involve fundamental computer science and interdisciplinary work alongside experts from other disciplines providing data and contributing to its analysis. The appointee will be expected to contribute to the programme described above through all stages of the research process, including basic research, programming, testing, evaluation, publication of results at the highest level, and assistance in developing proposals for funding. Work will involve collaboration with other senior members of the Leeds visualization group (Dr. Hamish Carr and Dr. Roy Ruddle), and there will be opportunities to assist with academic supervision of undergraduate and postgraduate students. CLOSING DATE: 21st September. For further information including person specification, and/or to submit an application, please see the following URL: http://jobs.leeds.ac.uk/fe/tpl_universityofleeds01.asp?s=FoQnTYvIgXJoLlXgd&… For informal inquiries, please feel free to contact me directly. David Duke Head, School of Computing, and Reader in Visualization E: D.J.Duke(a)leeds.ac.uk W: www.comp.leeds.ac.uk/djd/

1 0

4th *OPEN* Answer Set Programming Competition 2013 - EXTENDED DEADLINE - New Call for benchmarks
by Francesco Calimeri 04 Sep '12

04 Sep '12

[apologies for any cross-posting] ........................................................................ 4th OPEN Answer Set Programming Competition 2013 Call for Benchmark Problems University of Calabria - Vienna University of Technology Fall/Winter 2012/2013 http://aspcomp2013.mat.unical.it/ ........................................................................ The 4th Open Answer Set Programming Competition is open to ASP systems and *any other system* based on a declarative specification paradigm. The event is currently finalizing its Call for Benchmarks stage. == Call for Benchmark Problems == Participants will compete on a selected collection of declarative specifications of benchmark problems, taken from a variety of domains as well as real world applications, and instances thereof. These include, but are not limited to: - Deductive database tasks on large data-sets - Sequential and Temporal Planning - Classic and Applicative graph problems - Puzzles and Combinatorics - Scheduling, Timetabling, and other resource allocation problems - Combinatorial Optimization Problems - Ontology reasoning - Automated Theorem Proving and Model Checking - Reasoning tasks over large propositional instances - Constraint Programming problems - Other AI problems We encourage to provide help by proposing and/or devising new challenging benchmark problems. The submission of problems arising from applications of practical impact are strongly encouraged; problems used in the former ASP Competitions, or variants thereof, can be re-submitted. Benchmark authors are expected to produce a problem specification and an instance set (or a generator thereof). The detailed benchmark problems submission procedure is available at: http://www.mat.unical.it/aspcomp2013/BenchmarkSubmission. === About the ASP Competition Series === Answer Set Programming is a well-established paradigm of declarative programming with close relationship to other declarative modeling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. Since the first informal editions (Dagstuhl 2002 and 2005), ASP systems compare themselves in the nowadays customary ASP Competition: the 4th ASP Competition will be run jointly at the University of Calabria (Italy) and the Vienna University of Technology (Austria), in the first half of 2013. The event is the sequel to the ASP Competition series, held at the University of Potsdam (Germany) in 2006-2007, at the University of Leuven (Belgium) in 2009, and at University of Calabria (Italy) in 2011. The current competition takes place in cooperation with the 13th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), where the results will be announced. The ASP competition is held as an open tournament. The "Model & Solve" competition track fosters the spirit of integration among communities, and is thus open to all types of solvers: ASP systems, SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, planning reasoners, or any other. The "System" competition track is instead set up on a fixed language based on the answer set semantics. == Important Dates == * Problem selection stage - Problem submission deadline: Sep 20th, 2012 (*EXTENDED*) * Competition stage - "Model & Solve" submission deadline: Mar 1st, 2013 - "System" submission deadline: Mar 1st, 2013 * Sep 15-19th, 2013 - Announcement of results and awards at LPNMR 2013 - Corunna, Spain == Further Information == For further information please visit the competition web site: http://aspcomp2013.mat.unical.it/ or contact us by email: aspcomp2013(a)kr.tuwien.ac.at.

1 0

Call for Lightning Talks / Challenges, Workshop on Generic Programming 2012
by Andres Löh 03 Sep '12

03 Sep '12

-------------------------------------------------------------------------- CALL FOR LIGHTNING TALKS / CHALLENGES -------------------------------------------------------------------------- At the Workshop on Generic Programming 2012 on Sunday, September 9, 2012, we will have a discussion about OPEN PROBLEMS IN GENERIC PROGRAMMING The goal is to present and discuss one or more concrete examples where existing tools, libraries or mechanisms for generic programming in various programming languages fail. If you have the feeling that despite its promises, generic programming has failed to deliver, then this is your chance to step up and explain to the community what you would like to do, but currently cannot. We hope that this discussion will inspire the researchers within the community to work on the problems that will be proposed. If you have a challenge, please contact the workshop organizers by mail. We are offering a number of lightning talk slots to present the challenge to the audience as an introduction to the general discussion. Even if you cannot participate in the workshop, but have a challenge that is easy enough to describe, please contact us and if time permits we might try to present it. Ronald Garcia and Andres Loeh Workshop co-chairs

1 0