- Haskell - Haskell.org

ANN: functorm-1.0
by Stefan O'Rear 07 Jul '07

07 Jul '07

This is the Data.FunctorM module from 6.6's base, deleted from HEAD still used by some projects (notably jhc); this package can be used for compatibility. Hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/functorm-1.0 Tarball: http://hackage.haskell.org/packages/archive/functorm/1.0/functorm-1.0.tar.gz Stefan

1 0

TTSS 07 CFP
by Huibiao Zhu 05 Jul '07

05 Jul '07

1st International Workshop on Harnessing Theories for Tool Support in Software (TTSS’07) 22-23 September 2007, Macau, China http://www.iist.unu.edu/ttss07 Co-located with ICTAC 2007 The aim of the workshop is to bring together practitioners and researchers from academia, industry and government to present and discuss ideas about: a) How to deal with the complexity of software projects by multi-view modeling and separation of concerns about the design of functionality, interaction, concurrency, and extra-functionality, and b) How to ensure correctness and dependability of software using formal methods and tools of modeling, design, verification and validation into design and development processes and environments The workshop will provide enough time for discussion on problems and research. Each presentation will be 25 minutes followed by 10 minutes discussion. Topics of interest include, but are not limited to, the following areas: • Mathematical frameworks, methods and tools for model-driven development • Models, calculus and tool support for component-based and object-oriented software • rCOS and relational mathematical frameworks of object and component systems and their tool support PAPER SUBMISSION TTSS invites authors to submit original and unpublished work. Submissions should include an abstract, key words, the e-mail address of the corresponding author, and must not exceed 15 pages using ENTCS style. The submission website is http://www.easychair.org/TTSS07 PROCEEDINGS We are talking to ENTCS about the publication of the proceedings, and will consider the publication of a special issue of a journal for selected papers. IMPORTANT DATES • Submission deadline: 15 July, 2007 • Notification of acceptance: 15 August 2007 • Final manuscript due: 1 September 2007 Organized and supported by ECNU and UNU-IIST Program Chairs Geguang Pu ECNU, China Volker Stolz, UNU-IIST, Macau, China Local Organization Chair Volker Stolz, UNU-IIST, Macau, China Program Committee Members Farhad Arbab, CWI, The Netherlands Luis Barbosa, Universidade do Minho, Portugal James C. Browne, UT Austin, US Kung-Kiu Lau, Manchester University, UK Jin Liu, ECNU, China Xiaoshan Li, Macau University, China Markus Lumpe, Iowa State University, USA Zongyan Qiu, Peking University, China Anders P. Ravn, Aalborg University, Denmark Abhik Roychoudhury, NUS, Singapore Bernhard Schätz, TU Munich, Germany Heinrich Schmidt, RMIT University, Australia Meng Sun, CWI, The Netherlands Petr Tuma, Charles University, Czech Republic R. Venkatesh, TATA, India Xu Wang, UNU-IIST, Macau, China Ji Wang, NLPDP, China Naijun Zhan, CAS, China Jianhua Zhao, Naijin University, China Gianluigi Zavattaro, University of Bologna, Italy Advisors Patrick Cousot, ENS, France Jifeng He, ECNU, China Mathai Joseph, TATA, India Zhiming Liu, UNU-IIST, Macau, China Bertrand Meyer, ETH, Switzerland Jim Woodcock, University of York, UK

1 0

Where's the problem ?
by Rome 03 Jul '07

03 Jul '07

Hi everyone, I write a program for fast online multiplication, this means, leading digits are computed first, so this program is able to handle real numbers. My program and Source-Code is available under http://www.romeinf04.de http://www.romeinf04.de but only with german comments, because this is my master thesis. Now the problem: My program computes using the schoenhage-strassen multiüply-subroutine the output everytime only until the 32777th Digit, but then it holds without an error message. Windows Task manager tells me CPU Usage 100% and Memory Allocation is increasing. Profiling told me, the function Algorithm.resultOfMult is using this memory. To compute the 32777th digit, my program needs several digits of the input-numbers including the 32800th. I'm using GHC 6.6.1 with option -O2 to compile. Output is row-wise by an IO-function, calling itself recursively with updated parameters, hte output looks like: dig11 dig21 --> res1 dig12 dig22 --> res2 dig12 dig23 --> res3 . . . and so on If I use the Naive-Multiply-Subroutine, the problem occurs at the 16392th digit. I don't have any idea, where the problem might be... Greetings Roman Please excuse my english writing, I'm from Germany. -- View this message in context: http://www.nabble.com/Where%27s-the-problem---tf4019116.html#a11414756 Sent from the Haskell - Haskell mailing list archive at Nabble.com.

1 1

Anglo Haskell 2007, call for participation
by Neil Mitchell 28 Jun '07

28 Jun '07

Hi, People have proposed that we have another AngloHaskell this year. These events are being coordinated via the wiki: http://www.haskell.org/haskellwiki/AngloHaskell The current thoughts are to have a day of talks on Friday, followed by a day of social activities (punting perhaps, maybe some coding) on Saturday. The probable venue is MSR Cambridge, and the date is probably either August or early September. Can everyone interested in going please annotate the wiki with their time constraints, and intention to participate. This is NOT an academic conference. Everyone is welcome to attend, there is no fee. Everyone is invited to offer a talk. Thanks Neil and Philippa

1 0

External reviews
by Gabriele Keller 27 Jun '07

27 Jun '07

If you prefer to have two separate review forms, I can add dummy PC members to the PC for this purpose. So, please let me know if you want me to set it up for you, and for which papers you would submit two reviews. However, I would also need an email address different to the address of the main account (the system doesn't let me add two PC member with the same address) Gabi

1 1

FWD: PADL 2008: Call for Papers
by Simon Marlow 26 Jun '07

26 Jun '07

[posting on behalf of Gopal Gupta <gupta(a)utdallas.edu>] CALL FOR PAPERS!!! Tenth International Symposium on Practical Aspects of Declarative Languages 2008 (PADL '08) http://www.ist.unomaha.edu/padl2008/ San Francisco, USA January 7-8, 2008 Co-located with ACM POPL'08 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 raises numerous interesting research issues. Well-known questions include designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. Topics of interest include: * innovative applications of declarative languages; * declarative domain-specific languages and applications; * practical applications of theoretical results; * new language developments & their impact on applications; * evaluation of implementation techniques on practical applications; * novel uses of declarative languages in the classroom; and * practical experiences PADL 08 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages. PADL 08 will be co-located with the ACM POPL. IMPORTANT DATES AND SUBMISSION GUIDELINES Paper Submission: August 24, 2007 Notification: September 27, 2007 Camera-ready: October 23, 2007 Symposium: January 7-8, 2008 Authors should submit an electronic copy of the full paper (written in English) in Postscript (Level 2) or PDF. Papers must be no longer than 15 pages, written in 11-point font and with single spacing. Since the final proceedings will be published as Lecture Notes in Computer Science by Springer Verlag, authors are strongly encouraged to use the LNCS paper formatting guidelines for their submission. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email and postal addresses, telephone and fax numbers, abstract, and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. If electronic submission is impossible, please contact the program chair for information on how to submit hard copies. MOST PRACTICAL PAPER AWARD The Most Practical Paper award will be given to the submission that is judged by the program committee to be the best in terms of practicality, originality, and clarity of presentation. The program committee may choose not to make an award, or to make multiple awards. Contacts: For information about papers and submissions, please contact the Program Chair: Paul Hudak PC co-Chair - PADL 2008 Department of Computer Science Yale University P.O. Box 208285 New Haven, CT 06520 - 8285 Email: hudak(a)cs.yale.edu David S. Warren PC co-Chair - PADL 2008 Department of Computer Science Stony Brook University Stony Brook, NY Email: warren(a)cs.sunysb.edu For other information about the conference, please contact: Hai-Feng Guo General Chair - PADL 2008 Department of Computer Science College of Information Science & Technology University of Nebraska at Omaha Omaha, NE, U.S.A. Email: haifengguo(a)mail.unomaha.edu Sponsored by: COMPULOG Americas (http://www.cs.nmsu.edu/~complog) and University of Nebraska at Omaha

1 0

Building extra-libs (packages text, data, util, lang)
by bft 25 Jun '07

25 Jun '07

Hello I am trying to install FRUIT (Functional Reactive User Interface Toolkit - http://www.haskell.org/fruit/) I didn't succeed when building Greencard (2.03 or 2.05) because (I suppose) the packages text, data, util, lang were not found with the ghc-6.6.1haskell compiler. A part of the error generated is : "Glasgow Haskell Compiler, Version 6.6.1, for Haskell 98, compiled by GHC version 6.6.1 Using package config file: /home/bfotsing/lib/ghc-6.6.1/package.conf Using package config file: /home/bfotsing/.ghc/i386-linux-6.6.1/package.conf *** Deleting temp files: Deleting: *** Deleting temp dirs: Deleting: ghc-6.6.1: unknown package: text" I don't know where to get those packages or (maybe) how to build them since I didn't find them in the ghc extra-libs ( http://www.haskell.org/ghc/download_ghc_661.html) Thanks for your help BFT

1 1

Building extra-libs (packages text, data, util, lang)
by FOTSING TALLA Bernard 24 Jun '07

24 Jun '07

> Hello > I am trying to install FRUIT (Functional Reactive User Interface Toolkit - > http://www.haskell.org/fruit/) > I didn't succeed when building Greencard (2.03 or 2.05) because (I suppose) > the packages text, data, util, lang were not found with the > ghc-6.6.1 haskell compiler. > A part of the error generated is : > "Glasgow Haskell Compiler, Version 6.6.1, for Haskell 98, compiled by GHC > version 6.6.1 > Using package config file: /home/bfotsing/lib/ghc-6.6.1/package.conf > Using package config file: /home/bfotsing/.ghc/i386-linux-6.6.1/package.conf > *** Deleting temp files: > Deleting: > *** Deleting temp dirs: > Deleting: > ghc-6.6.1: unknown package: text" > I don't know where to get those packages or (maybe) how to build them since > I didn't find them in the ghc extra-libs ( > http://www.haskell.org/ghc/download_ghc_661.html) > Thanks for your help > BFT Hello I commented the part of code concerned in order to ignore those options, and the building failed again with this message : Casm.lhs:479:13: Couldn't match expected type `GHC.Ptr.Ptr t' against inferred type `[Char]' In the first argument of `ptext', namely `"C_RETURN(nodeptr);"' In the second argument of `($$)', namely `ptext "C_RETURN(nodeptr);"' In the first argument of `ppBlock', namely `(((ccode $$ (ppAssign "nodeptr" pprResult)) $$ end) $$ (ptext "C_RETURN(nodeptr);"))' make[1]: *** [Casm.o] Erreur 1 make[1]: quittant le répertoire « /home/bfotsing/gc-2.05/src » Can you help me?

1 0

Class type constraining?
by Hugo Pacheco 22 Jun '07

22 Jun '07

Hi, I have a set of functor definitions with corresponding instances newtype Id a = Ident {unIdent :: a} deriving Eq newtype K b a = Const {unConst :: b} deriving Eq instance Functor Id where fmap f (Ident x) = Ident $ f x instance Functor (K a) where fmap f (Const x) = Const x (...) And a class that creates a representation b for a functor f a: class Functor f => C f a b | f a -> b where ftest :: f a -> b instance C Id a a instance C (K b) a b I want to write some function test :: (C f a b) => (a -> b) test = ftest . undefined But, as expected, the type checker claims not to satisfy the context, since the function may be valid for any representable functor, as long as it has an instance. What I would want is to constrain the set of functors that the class applies to, for which I have all the required instances. Is it possible in Haskell? Sorry if this explanation is confusing. Thanks in advance, hugo

2 2

ANNOUNCE: Haskell Program Coverage 0.4
by Andy Gill 22 Jun '07

22 Jun '07

I am happy to announce release 0.4 of Hpc, a tool for Haskell developers. Hpc is a tool-kit to record and display Haskell Program Coverage. Hpc includes tools that instrument Haskell programs to record program coverage, run instrumented programs, and display the coverage information obtained. This version includes many changes since 0.2, including a small DSL for expressing coverage "holes". More details can be found on the Hpc web-page. http://projects.unsafePerformIO.com/hpc Feedback and feature requests are encouraged. Andy Gill

1 0