- Haskell-Cafe - Haskell.org

Parsing HTML tables with HXT
by Dmitry Simonchik 11 Apr '11

11 Apr '11

Dear Cafe, Can someone please help me with getting the value of the table cell with HXT in the following html: <table class="tblc"> <tr> <td class="tdc">x</td> <td>y</td> </tr> <tr> <td class="tdc">a</td> <td>b</td> </tr> </table> I need the value of the second cell in a row that has first cell with some predefined value (in the example above it can be x or a) I need the arrow of the type (IOSArrow XmlTree String) How to write it? Thanks

2 2

already installed packages alerted as not being installed
by Daniel Kahlenberg 11 Apr '11

11 Apr '11

Hello cafe-readers, does anyone of you observe similar problems e. g. on a Windows with ghc-7.0.2 setup: When I'm trying cabal install threadscope (as an example package depending on gtk2hs, latter which I've installed using the stepwise approach of cabal unpack first, then cabal configure --user etc.) it complains about cairo etc. not being installed and tries to re-install it on-the-fly, failing due to whats described her: http://hackage.haskell.org/trac/gtk2hs/ticket/1203! When I install cabal-dev and cab first and then re-install everything with cab instead of cabal the issue with re-installing already installed packages described above disappears and only an "unknown symbol" message related to the correctly found installed cairo package remains. So is there an error in package database handling somewhere or changed semantics in cabal | ghc-pkg | (even) pkg-config flags I missed? Cheers Daniel

2 2

CFP: APLAS 2011, Kenting, Taiwan
by Shin-Cheng Mu 11 Apr '11

11 Apr '11

========================================================== APLAS 2011 Call For Papers Ninth Asian Symposium on Programming Languages and Systems Kenting, Taiwan, December 5--7, 2011 (co-located with CPP 2011) http://flolac.iis.sinica.edu.tw/aplas11/ ========================================================== BACKGROUND: APLAS aims at stimulating programming language research by providing a forum for the presentation of latest results and the exchange of ideas in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS) founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past APLAS symposiums were successfully held in Shanghai ('10), Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops. Proceedings of the past symposiums were published in Springer-Verlag's LNCS 6461, 5904, 5356, 4807, 4279, 3780, 3302, and 2895. The 2011 edition will be held at Kenting, a seaside resort in Southern Taiwan. TOPICS: The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited to, the following topics: + semantics, logics, foundational theory; + design of languages and foundational calculi; + type systems; + compilers, interpreters, abstract machines; + program derivation and transformation; + program analysis, verification, model-checking, software security; + concurrency, constraints, domain-specific languages; + tools for programming, verification, implementation. APLAS 2011 is not limited to topics discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of systems and tools in the scope of APLAS are welcome to the System and Tool presentations category. Authors concerned about the appropriateness of a topic are welcome to consult with Program Chair prior to submission. IMPORTANT DATES: Abstract Deadline: June 13, 2011 Submission Deadline: June 17, 2011 (GMT) Notification: August 29, 2011 Camera-Ready: September 19, 2011 INVITED SPEAKERS: Nikolaj Bjorner, Microsoft Research Redmond Ranjit Jhala, UC San Diego Peter O'Hearn, Queen Mary U. London Sriram Rajamani, Microsoft Research India SUBMISSION INFORMATION: We solicit submissions in two categories: Regular research papers, describing original research results, including tool development and case studies, from a perspective of scientific research. Regular research papers should not exceed 16 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as Appendix or a link to a web page. System and Tool presentations, describing systems or tools that support theory, program construction, reasoning, and/or program execution in the scope of APLAS. Unlike presentations of regular research papers, presentation of accepted papers in this category is expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the systems or tools as described in the papers. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page at http://www.easychair.org/conferences/?conf=aplas2011. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings are planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Accepted papers must be presented at the conference. GENERAL CHAIR: Tyng-Ruey Chuang, Academia Sinica, Taiwan PROGRAM CHAIR: Hongseok Yang, Queen Mary U. London aplas2011(a)easychair.org PROGRAM COMMITTEE: Lars Birkedal (ITU, Denmark) James Brotherston (Imperial College, UK) Kung Chen (National Chengchi U., Taiwan) Wenguang Chen (Tsinghua U., China) Wei-Ngan Chin (NUS, Singapore) Javier Esparza (TUM, Germany) Xinyu Feng (USTC, China) Jerome Feret (INRIA, France) Matthew Fluet (RIT, USA) Rajiv Gupta (UC Riverside, USA) Masahito Hasegawa (Kyoto U., Japan) Radha Jagadeesan (Depaul U., USA) Naoki Kobayashi (Tohoku U., Japan) Daniel Kroning (U. Oxford, UK) Rupak Majumdar (MPI-SWS, Germany) Andrzej Murawski (U. Leicester, UK) Paulo Oliva (Queen Mary U. London, UK) Doron Peled (Bar Ilan U., Israel) Sukyoung Ryu (KAIST, Korea) Sriram Sankaranarayanan (U. Colorado, USA) Armando Solar-Lezama (MIT, USA) Sam Staton (U. Cambridge, UK) Viktor Vafeiadis (MPI-SWS, Germany) Kapil Vaswani (MSR, India) Martin Vechev (IBM, USA) Peng Wu (IBM, USA) Hongseok Yang (Queen Mary U. London, UK) Pen-Chung Yew (Academia Sinica, Taiwan) ORGANIZERS: Mike Dodds, U. Cambridge (Poster chair) Shin-Cheng Mu, Academia Sinica, Taiwan (Local arrangement chair) Noam Rinetzky, Queen Mary U. London (Publicity chair) Yih-Kuen Tsay, National Taiwan University (Finance chair)

1 0

Re: [Haskell-cafe] [Haskell-beginners] Calling a foreign function: superlinear comlexity
by Antoine Latter 11 Apr '11

11 Apr '11

On Sun, Apr 10, 2011 at 6:26 PM, Serguei Son <serguei.son(a)gmail.com> wrote: > I call GSL's gsl_ran_ugaussian function in the following way (using > bindings-gsl): > > module Main where > > import Bindings.Gsl.RandomNumberGeneration > import Bindings.Gsl.RandomNumberDistributions > import Foreign > import Control.Monad > import Data.List > > main = do > let n = 100000 > p <- peek p'gsl_rng_mt19937 > rng <- c'gsl_rng_alloc p > lst <- replicateM n $ c'gsl_rng_uniform rng > print $ sum lst > > As I increase n from 10^4 to 10^5 to 10^6 execution time grows superlinearly. > Not sure if it is related, but this thread also documents issues folks had with replicateM and performance: http://www.haskell.org/pipermail/haskell-cafe/2011-March/090419.html Antoine > To forestall the answer that the reason is the overhead of List, > this code scales approximately linearly: > > module Main where > > > import Foreign > import Control.Monad > import Data.List > > main = do > let n = 100000 > let lst = map sin [1..n] > print $ sum lst > > Another interesting observation: when I wrap the sin function > of math.h with signature CDouble -> IO CDouble calling it > repeatedly scales superlinearly, whereas when I wrap it as a pure > function calling it repeatedly scales linearly. > > What is the reason for this performance and how can > I make the first code scale linearly in execution time? > > > > > > _______________________________________________ > Beginners mailing list > Beginners(a)haskell.org > http://www.haskell.org/mailman/listinfo/beginners >

1 0

haskell-src-meta installation failed
by Qiuchi Jian 10 Apr '11

10 Apr '11

Hi guys, I tried to install haskell-src-meta and got the error below. I checked all dependencies which are listed on the hackage page, they are all installed with the right version. Can anyone tell me what is the problem? Thanks a lot. jqc@ubuntu:~$ cabal install haskell-src-meta Resolving dependencies... Configuring haskell-src-meta-0.3... Preprocessing library haskell-src-meta-0.3... Building haskell-src-meta-0.3... [1 of 7] Compiling Language.Haskell.Meta.Syntax.Translate ( src/Language/Haskell/Meta/Syntax/Translate.hs, dist/build/Language/Haskell/Meta/Syntax/Translate.o ) src/Language/Haskell/Meta/Syntax/Translate.hs:19:0: Bad interface file: /home/jqc/.cabal/lib/haskell-src-exts-1.9.6/ghc-6.12.3/Language/Haskell/Exts/Syntax.hi Data.Binary.getWord8: end of file cabal: Error: some packages failed to install: haskell-src-meta-0.3 failed during the building phase. The exception was: ExitFailure 1 Regards, Jian

2 1

CFP -- Haskell Symposium 2011
by Haskell Symposium 10 Apr '11

10 Apr '11

"Haskell 2011" ACM SIGPLAN Haskell Symposium 2011 Tokyo, Japan 22nd September, 2011 CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2011/ The ACM SIGPLAN Haskell Symposium 2011 will be co-located with the 2011 International Conference on Functional Programming (ICFP), in Tokyo, Japan. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, testing tools, and suchlike; * Functional Pearls, being elegant, instructive examples of using Haskell; * Applications, using Haskell for scientific and symbolic computing, database, multimedia, telecom and web applications, and so forth; * Practice and Experience, general experience with Haskell in education and industry. Papers in the latter three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. (More advice appears on the symposium webpage.) The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a program! Submission Details * Submission Deadline: Monday, 6th June 2011 * Author Notification: Friday, 1st July 2011 * Final Papers Due : Sunday, 10th July 2011 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm) The text should be in a 9pt font in two columns; the length is restricted to 12 pages, except for "Applications, Practice, and Experience" papers, which are restricted to 6 pages. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. In addition, we solicit proposals for system demonstrations, based on running (perhaps prototype) software rather than necessarily on novel research results. Proposals are limited to 2-page abstracts, in the same ACM format as papers, and should explain why a demonstration would be of interest to the Haskell community. They will be assessed for relevance by the PC; accepted proposals will be published on the Symposium website, but not formally published in the proceedings. Links * http://www.haskell.org/haskell-symposium, the permanent homepage of the Haskell Symposium. * http://www.haskell.org/haskell-symposium/2011, the 2011 Haskell Symposium web page. * http://www.icfpconference.org/icfp2011, the ICFP 2011 web page. Programme Committee * Koen Claessen, Chalmers University of Technology (chair) * Conal Elliott, LambdaPix * Andy Gill, University of Kansas * Ralf Hinze, Oxford University * Graham Hutton, University of Nottingham * John Launchbury, Galois, Inc. * Sam Lindley, University of Edinburgh * Rita Loogen, Philipps-Universität Marburg * Neil Mitchell, Standard Chartered * Matthew Naylor, University of York * Bruno Oliveira, Seoul National University * Dimitrios Vytiniotis, Microsoft Research * Steve Zdancewic, University of Pennsylvania

1 0

ImProve Tutorial
by Tom Hawkins 10 Apr '11

10 Apr '11

ImProve is a Haskell eDSL for embedded control systems -- we use it for automotive and off-highway powertrain control. I've started writing a tutorial for ImProve. So far it has a basic tour of the language and a handful of examples. Comments and suggestions are welcome. In other recent news, ImProve can now generate models in Simulink and Modelica. -Tom [1] http://github.com/tomahawkins/improve/wiki/ImProve

1 0

Deciding equality of functions.
by Grigory Sarnitskiy 10 Apr '11

10 Apr '11

I guess that deciding whether two functions are equal in most cases is algorithmically impossible. However maybe there exists quite a large domain of decidable cases? If so, how can I employ that in Haskell? It is a common situation when one has two implementations of the same function, one being straightforward but slow, and the other being fast but complex. It would be nice to be able to check if these two versions are equal to catch bugs in the more complex implementation.

7 6

ANNOUNCE: hplaylist-0.1
by Tim Chevalier 10 Apr '11

10 Apr '11

Hello, hplaylist is a very simple command-line utility, written in Haskell, for automatically syncing an iTunes playlist to a non-Apple-manufactured MP3 player (anything that mounts as a USB drive should work in principle). For example, if I have an iTunes playlist called "Songs about cheese", hplaylist allows me to type: $ hplaylist "Songs about cheese" which automatically copies the named playlist, and all music files included in the playlist, to my device. Download at: http://hackage.haskell.org/package/hplaylist-0.1 or https://github.com/catamorphism/hplaylist Cheers, Tim -- Tim Chevalier * http://cs.pdx.edu/~tjc/ * Often in error, never in doubt "an intelligent person fights for lost causes,realizing that others are merely effects" -- E.E. Cummings

1 0

Testing Implementation vs Model - Records or Type Classes?
by Heinrich Apfelmus 09 Apr '11

09 Apr '11

Hello, I'm writing a small Haskell library for functional reactive programming. The core of the library consists of two data types and several primitives. However, I have programmed this core *twice*: once as a *model* that displays the intended semantics, and once as the actual *implementation* to be used in production code. Of course, I would like to use QuickCheck to test that the implementation gives the same results as the model. My problem is: how to organize this with the minimum amount of boilerplate? It appears that I can use *multiparameter type classes* to solve this, but I'm not sure I'm happy with this, in particular because it makes the generated Haddock less readable (see 3) below). On the other hand, I could also use *record wildcards* to conveniently reify a module into a record data structure. But that will give me problems with combinators that are derived from the core combinators (see 2) below). Haskell Café, what are your suggestions and ideas? In particular, I wish to: 1) Write examples to be QuickChecked only once. I imagine that my main function for testing looks like this test_equal example = forAll $ \input -> example model input == example implementation input where example an expression involving the combinators from my library. The point is that I don't want to write example twice, once for each version. 2) Use derived combinators. For reference, here the full signature of the core combinators: data Event a data Behavior a instance Functor Behavior instance Applicative Behavior instance Functor Event instance Monoid (Event a) filter :: (a -> Bool) -> Event a -> Event a apply :: Behavior (a -> b) -> Event a -> Event b accumB :: a -> Event (a -> a) -> Behavior a When writing tests, I also want to use common derived combinators, like, say filterJust :: Event (Maybe a) -> Event a filterJust = fmap fromJust . filter isJust without implementing them twice. 3) Obtain readable Haddock. I like the simplicity and readability of an ordinary module signature. In contrast, libraries with many type class scare me. Or is there a way to make this less scary? I'm not sure about the last one: 4) Make both model and implementation available to the user, so that he can QuickCheck his own programs as well. Since the implementation makes heavy use of IO, it is a bit harder to test automatically, so the model might be useful to have. Best regards, Heinrich Apfelmus -- http://apfelmus.nfshost.com

3 3